Skip to content

instruction.md

Latest commit

 

History

History
31 lines (24 loc) · 1.8 KB

instruction.md

File metadata and controls

31 lines (24 loc) · 1.8 KB
Raw

Reconstruct a graph from its scrambled vertex deck

The input contains nine independently relabeled eight-vertex cards. Recover a simple graph on vertices 0..8 with exactly 15 edges. For every card submit the deleted original vertex and a bijective local_to_original map of its local vertices 0..7 onto the other eight original vertices.

The verifier checks every mapped card edge set against the corresponding vertex-deleted subgraph. It also aggregates all mapped cards and requires every original edge to occur exactly seven times and every nonedge zero times. Relabeled isomorphic reconstructions are accepted.

Evidence is matching JSON (application/json) with exactly schema_version (the string "1"), task_id, result, and limitations. This reconstructs one finite deck only and does not prove the Reconstruction Conjecture.

Submission

Exact reconstruction of one finite deck only.

Write /app/submission.json to the exact schema in environment/submission_schema.json. The submission envelope requires task_id, conclusion, result, claimed_assurance, scope, completeness, evidence, and limitations.

  • Conclusion: exactly FINITE_GRAPH_DECK_RECONSTRUCTION
  • Assurance: scoreable values are UNVERIFIED, COMPUTED, CHECKED (ceiling CHECKED); the submission schema accepts any of UNVERIFIED, COMPUTED, CHECKED, VERIFIED but only scoreable assurances receive credit.
  • Scope: the exact value declared in submission_schema.json
  • Completeness: COMPLETE.
  • Evidence: 1-1 item(s); allowed path(s): evidence/answer.txt; digest must match ^sha256:[0-9a-f]{64}$.
  • Evidence media types: application/json.
  • Required artifact filenames: evidence/answer.txt.