{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FTAVSMVXGPN2AHSRLEMHASWYEB","short_pith_number":"pith:FTAVSMVX","schema_version":"1.0","canonical_sha256":"2cc15932b733dba01e515918704ad8205770e51d047d89ecc4107e5a0621d3c8","source":{"kind":"arxiv","id":"1506.07898","version":4},"attestation_state":"computed","paper":{"title":"Efficient computation of middle levels Gray codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jerri Nummenpalo, Torsten M\\\"utze","submitted_at":"2015-06-25T20:50:17Z","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"},"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":"1506.07898","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-25T20:50:17Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"b8b635f16ae38f7336b61c48d721cf8355d3594d1be90c9a3e49e963cbd21bee","abstract_canon_sha256":"df2f58940c2332433b18b0bed6d7ada10fe09fc9bf5e9d88a510fe0c975ab3ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:07.915954Z","signature_b64":"HJkEkM68F42tRMCxTVVx3SdKMeNXEKWZwenWoBfl9Ykn5jeNH0EeXEE1YnZpIffV3sGLx8Rm50xXZWsx+/2oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cc15932b733dba01e515918704ad8205770e51d047d89ecc4107e5a0621d3c8","last_reissued_at":"2026-05-18T00:42:07.915359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:07.915359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computation of middle levels Gray codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Jerri Nummenpalo, Torsten M\\\"utze","submitted_at":"2015-06-25T20:50:17Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07898","kind":"arxiv","version":4},"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":"1506.07898","created_at":"2026-05-18T00:42:07.915454+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07898v4","created_at":"2026-05-18T00:42:07.915454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07898","created_at":"2026-05-18T00:42:07.915454+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTAVSMVXGPN2","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTAVSMVXGPN2AHSR","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTAVSMVX","created_at":"2026-05-18T12:29:22.688609+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/FTAVSMVXGPN2AHSRLEMHASWYEB","json":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB.json","graph_json":"https://pith.science/api/pith-number/FTAVSMVXGPN2AHSRLEMHASWYEB/graph.json","events_json":"https://pith.science/api/pith-number/FTAVSMVXGPN2AHSRLEMHASWYEB/events.json","paper":"https://pith.science/paper/FTAVSMVX"},"agent_actions":{"view_html":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB","download_json":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB.json","view_paper":"https://pith.science/paper/FTAVSMVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07898&json=true","fetch_graph":"https://pith.science/api/pith-number/FTAVSMVXGPN2AHSRLEMHASWYEB/graph.json","fetch_events":"https://pith.science/api/pith-number/FTAVSMVXGPN2AHSRLEMHASWYEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB/action/storage_attestation","attest_author":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB/action/author_attestation","sign_citation":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB/action/citation_signature","submit_replication":"https://pith.science/pith/FTAVSMVXGPN2AHSRLEMHASWYEB/action/replication_record"}},"created_at":"2026-05-18T00:42:07.915454+00:00","updated_at":"2026-05-18T00:42:07.915454+00:00"}