{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AKKLYIOSKKLFL45DOQ3OAGGMW6","short_pith_number":"pith:AKKLYIOS","schema_version":"1.0","canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","source":{"kind":"arxiv","id":"1710.08249","version":2},"attestation_state":"computed","paper":{"title":"A short proof of the middle levels theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jerri Nummenpalo, Petr Gregor, Torsten M\\\"utze","submitted_at":"2017-10-23T13:05:21Z","abstract_excerpt":"Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts that this graph has a Hamilton cycle for any $n\\geq 1$. In this paper we present a new proof of this conjecture, which is much shorter and more accessible than the original proof."},"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":"1710.08249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T13:05:21Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1090e2013d063c5505b1c6c2a559536aa7257e88a8b3bef7e8ad800781612434","abstract_canon_sha256":"077e9005b825cb5bd207dc82896f542190a5167c28545f4b4974d15ef53a7344"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:41.990368Z","signature_b64":"APJhD0i72LmttkXic1AfWpH97W/Ci32gQNYUO/9ydEGi1i2nd34dO8nPZEpKD+MSdsYXYr5jUdOfhGRDZdy6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","last_reissued_at":"2026-05-18T00:15:41.989698Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:41.989698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A short proof of the middle levels theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jerri Nummenpalo, Petr Gregor, Torsten M\\\"utze","submitted_at":"2017-10-23T13:05:21Z","abstract_excerpt":"Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts that this graph has a Hamilton cycle for any $n\\geq 1$. In this paper we present a new proof of this conjecture, which is much shorter and more accessible than the original proof."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08249","kind":"arxiv","version":2},"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":"1710.08249","created_at":"2026-05-18T00:15:41.989784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.08249v2","created_at":"2026-05-18T00:15:41.989784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08249","created_at":"2026-05-18T00:15:41.989784+00:00"},{"alias_kind":"pith_short_12","alias_value":"AKKLYIOSKKLF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AKKLYIOSKKLFL45D","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AKKLYIOS","created_at":"2026-05-18T12:31:05.417338+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/AKKLYIOSKKLFL45DOQ3OAGGMW6","json":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6.json","graph_json":"https://pith.science/api/pith-number/AKKLYIOSKKLFL45DOQ3OAGGMW6/graph.json","events_json":"https://pith.science/api/pith-number/AKKLYIOSKKLFL45DOQ3OAGGMW6/events.json","paper":"https://pith.science/paper/AKKLYIOS"},"agent_actions":{"view_html":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6","download_json":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6.json","view_paper":"https://pith.science/paper/AKKLYIOS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.08249&json=true","fetch_graph":"https://pith.science/api/pith-number/AKKLYIOSKKLFL45DOQ3OAGGMW6/graph.json","fetch_events":"https://pith.science/api/pith-number/AKKLYIOSKKLFL45DOQ3OAGGMW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/action/storage_attestation","attest_author":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/action/author_attestation","sign_citation":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/action/citation_signature","submit_replication":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/action/replication_record"}},"created_at":"2026-05-18T00:15:41.989784+00:00","updated_at":"2026-05-18T00:15:41.989784+00:00"}