{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FTAVSMVXGPN2AHSRLEMHASWYEB","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":"df2f58940c2332433b18b0bed6d7ada10fe09fc9bf5e9d88a510fe0c975ab3ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-25T20:50:17Z","title_canon_sha256":"b8b635f16ae38f7336b61c48d721cf8355d3594d1be90c9a3e49e963cbd21bee"},"schema_version":"1.0","source":{"id":"1506.07898","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07898","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07898v4","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07898","created_at":"2026-05-18T00:42:07Z"},{"alias_kind":"pith_short_12","alias_value":"FTAVSMVXGPN2","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"FTAVSMVXGPN2AHSR","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"FTAVSMVX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:1cb2e6f8a5de29aaeacae9544a6e99d3d5a48e7b48c7b742abf0fbc5124b9fc9","target":"graph","created_at":"2026-05-18T00:42:07Z","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":"For any integer $n\\geq 1$ a middle levels Gray code is a cyclic listing of all bitstrings of length $2n+1$ that have either $n$ or $n+1$ entries equal to 1 such that any two consecutive bitstrings in the list differ in exactly one bit. The question whether such a Gray code exists for every $n\\geq 1$ has been the subject of intensive research during the last 30 years, and has been answered affirmatively only recently [T. M\\\"utze. Proof of the middle levels conjecture. Proc. London Math. Soc., 112(4):677--713, 2016]. In this work we provide the first efficient algorithm to compute a middle level","authors_text":"Jerri Nummenpalo, Torsten M\\\"utze","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-25T20:50:17Z","title":"Efficient computation of middle levels Gray codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07898","kind":"arxiv","version":4},"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:8a19196ff91408d6a195f04bcaf24aa7d15de5e005eff8b294777aefb6d2b108","target":"record","created_at":"2026-05-18T00:42:07Z","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":"df2f58940c2332433b18b0bed6d7ada10fe09fc9bf5e9d88a510fe0c975ab3ca","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-25T20:50:17Z","title_canon_sha256":"b8b635f16ae38f7336b61c48d721cf8355d3594d1be90c9a3e49e963cbd21bee"},"schema_version":"1.0","source":{"id":"1506.07898","kind":"arxiv","version":4}},"canonical_sha256":"2cc15932b733dba01e515918704ad8205770e51d047d89ecc4107e5a0621d3c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cc15932b733dba01e515918704ad8205770e51d047d89ecc4107e5a0621d3c8","first_computed_at":"2026-05-18T00:42:07.915359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:07.915359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HJkEkM68F42tRMCxTVVx3SdKMeNXEKWZwenWoBfl9Ykn5jeNH0EeXEE1YnZpIffV3sGLx8Rm50xXZWsx+/2oAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:07.915954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07898","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a19196ff91408d6a195f04bcaf24aa7d15de5e005eff8b294777aefb6d2b108","sha256:1cb2e6f8a5de29aaeacae9544a6e99d3d5a48e7b48c7b742abf0fbc5124b9fc9"],"state_sha256":"7030d3d726c337c2b53f6a1187b630a0ab4097a0132c86201eb7d86963fd8d31"}