{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AKKLYIOSKKLFL45DOQ3OAGGMW6","short_pith_number":"pith:AKKLYIOS","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"},"canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","source":{"kind":"arxiv","id":"1710.08249","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08249","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08249v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08249","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"AKKLYIOSKKLF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKKLYIOSKKLFL45D","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKKLYIOS","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AKKLYIOSKKLFL45DOQ3OAGGMW6","target":"record","payload":{"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"},"canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","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"},"source_kind":"arxiv","source_id":"1710.08249","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKK9kTNwqWyTXWu4KdABstyHffjQwYtxQ6O3rMIWkhZ8YoYmCe2CUnOnnYcNfwT+DbwT6P+beOd/Rs66V36EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:12:20.547590Z"},"content_sha256":"fbba66eb54e72030c964510ea6fe9a989da8eb5ad63fa715b6ab0c63076397df","schema_version":"1.0","event_id":"sha256:fbba66eb54e72030c964510ea6fe9a989da8eb5ad63fa715b6ab0c63076397df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AKKLYIOSKKLFL45DOQ3OAGGMW6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:15:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Phe9ZGlSVi13wRl+ajhMzKxHl7qo/vpsqFXiNc7LR+MRVU7e9GCzfW8J2euIdoocuf4sGcguzl7r45gmx8pfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T00:12:20.547959Z"},"content_sha256":"585cabdd7c0e35048d759c6aa7e0ff0d23b2d28d80ba9bdd20274bb845a6e10d","schema_version":"1.0","event_id":"sha256:585cabdd7c0e35048d759c6aa7e0ff0d23b2d28d80ba9bdd20274bb845a6e10d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/bundle.json","state_url":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T00:12:20Z","links":{"resolver":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6","bundle":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/bundle.json","state":"https://pith.science/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKKLYIOSKKLFL45DOQ3OAGGMW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AKKLYIOSKKLFL45DOQ3OAGGMW6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"077e9005b825cb5bd207dc82896f542190a5167c28545f4b4974d15ef53a7344","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T13:05:21Z","title_canon_sha256":"1090e2013d063c5505b1c6c2a559536aa7257e88a8b3bef7e8ad800781612434"},"schema_version":"1.0","source":{"id":"1710.08249","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08249","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08249v2","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08249","created_at":"2026-05-18T00:15:41Z"},{"alias_kind":"pith_short_12","alias_value":"AKKLYIOSKKLF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AKKLYIOSKKLFL45D","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AKKLYIOS","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:585cabdd7c0e35048d759c6aa7e0ff0d23b2d28d80ba9bdd20274bb845a6e10d","target":"graph","created_at":"2026-05-18T00:15:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Jerri Nummenpalo, Petr Gregor, Torsten M\\\"utze","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T13:05:21Z","title":"A short proof of the middle levels theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08249","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fbba66eb54e72030c964510ea6fe9a989da8eb5ad63fa715b6ab0c63076397df","target":"record","created_at":"2026-05-18T00:15:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"077e9005b825cb5bd207dc82896f542190a5167c28545f4b4974d15ef53a7344","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-23T13:05:21Z","title_canon_sha256":"1090e2013d063c5505b1c6c2a559536aa7257e88a8b3bef7e8ad800781612434"},"schema_version":"1.0","source":{"id":"1710.08249","kind":"arxiv","version":2}},"canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0294bc21d2529655f3a37436e018ccb79d8b85bfc3576804ad3e902fc112b388","first_computed_at":"2026-05-18T00:15:41.989698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:41.989698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"APJhD0i72LmttkXic1AfWpH97W/Ci32gQNYUO/9ydEGi1i2nd34dO8nPZEpKD+MSdsYXYr5jUdOfhGRDZdy6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:41.990368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08249","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbba66eb54e72030c964510ea6fe9a989da8eb5ad63fa715b6ab0c63076397df","sha256:585cabdd7c0e35048d759c6aa7e0ff0d23b2d28d80ba9bdd20274bb845a6e10d"],"state_sha256":"d20487cf2fa2908bf22ca83e9db722ff75ea6bd72902ee0d06017a6b0f39867a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT4X/qdeLjYf4lBsfsMTxxwiaAeR+7ZfMvcTT9FYR/Q328wZeD9pyHsMvH8YWb2K7hbohqJPCnkqGI/NaeKiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T00:12:20.550775Z","bundle_sha256":"cef9f6e29b9cd8885ce8eac06e74a537a1e1ec153da1c3fa90504c6bacb31375"}}