{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:U56645CBLLJTXC3A5AL6VWQGUN","short_pith_number":"pith:U56645CB","schema_version":"1.0","canonical_sha256":"a77dee74415ad33b8b60e817eada06a3461f2edd39acfbf5b533985d0e8a00f8","source":{"kind":"arxiv","id":"1412.0628","version":1},"attestation_state":"computed","paper":{"title":"On the Hamiltonicity of the $k$-regular graph game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeremy Meza, Samuel Simon","submitted_at":"2014-12-01T20:21:10Z","abstract_excerpt":"We consider a game played on an initially empty graph where two players alternate drawing an edge between vertices subject to the condition that no degree can exceed $k$. We show that for $k=3$, either player can avoid a Hamilton cycle, and for $k\\geq4$, either player can force the resulting graph to be Hamiltonian."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1412.0628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-01T20:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"d1bf3f4aa35955576f5f47af874df21ab837775e901260418b0b4c2481736152","abstract_canon_sha256":"f7d354d5008917331e38789c22b9252ed7e30717600559e529c3edcce7173e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:22.956705Z","signature_b64":"aHsI1wb1LhWTMwwP0xEgkPIM2YDKqXQYA7f+2fYcYvx2H8+SKS07mwqXFwe8AiOpz89dQelhC2ssDIN2T1mnAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a77dee74415ad33b8b60e817eada06a3461f2edd39acfbf5b533985d0e8a00f8","last_reissued_at":"2026-05-18T02:32:22.956220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:22.956220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hamiltonicity of the $k$-regular graph game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jeremy Meza, Samuel Simon","submitted_at":"2014-12-01T20:21:10Z","abstract_excerpt":"We consider a game played on an initially empty graph where two players alternate drawing an edge between vertices subject to the condition that no degree can exceed $k$. We show that for $k=3$, either player can avoid a Hamilton cycle, and for $k\\geq4$, either player can force the resulting graph to be Hamiltonian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0628","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.0628","created_at":"2026-05-18T02:32:22.956302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0628v1","created_at":"2026-05-18T02:32:22.956302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0628","created_at":"2026-05-18T02:32:22.956302+00:00"},{"alias_kind":"pith_short_12","alias_value":"U56645CBLLJT","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"U56645CBLLJTXC3A","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"U56645CB","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN","json":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN.json","graph_json":"https://pith.science/api/pith-number/U56645CBLLJTXC3A5AL6VWQGUN/graph.json","events_json":"https://pith.science/api/pith-number/U56645CBLLJTXC3A5AL6VWQGUN/events.json","paper":"https://pith.science/paper/U56645CB"},"agent_actions":{"view_html":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN","download_json":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN.json","view_paper":"https://pith.science/paper/U56645CB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0628&json=true","fetch_graph":"https://pith.science/api/pith-number/U56645CBLLJTXC3A5AL6VWQGUN/graph.json","fetch_events":"https://pith.science/api/pith-number/U56645CBLLJTXC3A5AL6VWQGUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN/action/storage_attestation","attest_author":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN/action/author_attestation","sign_citation":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN/action/citation_signature","submit_replication":"https://pith.science/pith/U56645CBLLJTXC3A5AL6VWQGUN/action/replication_record"}},"created_at":"2026-05-18T02:32:22.956302+00:00","updated_at":"2026-05-18T02:32:22.956302+00:00"}