{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HV2EYICT2JEKBC2Y4ON7SYBJNC","short_pith_number":"pith:HV2EYICT","canonical_record":{"source":{"id":"1303.7110","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-28T12:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"2dd7df3f44d7052b908a32901f3ae496221550a6d7a326bd4460be5200bf79e6","abstract_canon_sha256":"804ffce2d44670f406683d15c6a769c34db42ab851f5f5051f3bcbf6d8311ac2"},"schema_version":"1.0"},"canonical_sha256":"3d744c2053d248a08b58e39bf96029688e0f07c27a8f22ad917c78fafa55842c","source":{"kind":"arxiv","id":"1303.7110","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7110","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7110v4","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7110","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"HV2EYICT2JEK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HV2EYICT2JEKBC2Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HV2EYICT","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HV2EYICT2JEKBC2Y4ON7SYBJNC","target":"record","payload":{"canonical_record":{"source":{"id":"1303.7110","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-28T12:21:24Z","cross_cats_sorted":[],"title_canon_sha256":"2dd7df3f44d7052b908a32901f3ae496221550a6d7a326bd4460be5200bf79e6","abstract_canon_sha256":"804ffce2d44670f406683d15c6a769c34db42ab851f5f5051f3bcbf6d8311ac2"},"schema_version":"1.0"},"canonical_sha256":"3d744c2053d248a08b58e39bf96029688e0f07c27a8f22ad917c78fafa55842c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:35.371714Z","signature_b64":"MjjXizDI8ykDWLYMlgePp5wWnlBmG4BDyYk6mmj70ktvA5nKwP0KWbGMRyJGWNyisV0JbBnK/4GzoJmErpcdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d744c2053d248a08b58e39bf96029688e0f07c27a8f22ad917c78fafa55842c","last_reissued_at":"2026-05-18T02:56:35.370946Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:35.370946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.7110","source_version":4,"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-18T02:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bYLpu63pj00oQ1JENpwOI212eN7Rueymg/3tUk7mDbSfATdQk6EczmnnlNCbHXxekHohQ4L7GMjxWFJHngakCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:13:04.304828Z"},"content_sha256":"5f4da71d7f01296d7f082e22cec0c647d8b831bcecf99e3e872a8e9160e11b19","schema_version":"1.0","event_id":"sha256:5f4da71d7f01296d7f082e22cec0c647d8b831bcecf99e3e872a8e9160e11b19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HV2EYICT2JEKBC2Y4ON7SYBJNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The q-Analog of the Middle Levels Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tuvi Etzion","submitted_at":"2013-03-28T12:21:24Z","abstract_excerpt":"The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem. Let $n=2k+1$ and let $q$ be a power of a prime number. Consider the set of $(k+1)$-dimensional subspaces and the set of $k$-dimensional subspaces of $\\F_q^n$. Can these subspaces be ordered in a way that for any two adjacent subspaces $X$ and $Y$, either $X \\subset Y$ or $Y \\subset X$? A construction method which yields many Hamiltonian cycles for any given "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7110","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"},"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-18T02:56:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VuQwAJlpyNwgnOdvF0fWVDylgYwKdhidcUbd6zpn+YhfwyoQCAAwaMEQWQiztjqm1js4+FJ7miexLwGIFSwJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:13:04.305203Z"},"content_sha256":"79743e92d81c89d2b5534ce567b2afec58384211607ccb4172f8b1e20361966c","schema_version":"1.0","event_id":"sha256:79743e92d81c89d2b5534ce567b2afec58384211607ccb4172f8b1e20361966c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/bundle.json","state_url":"https://pith.science/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/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-05-30T04:13:04Z","links":{"resolver":"https://pith.science/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC","bundle":"https://pith.science/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/bundle.json","state":"https://pith.science/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HV2EYICT2JEKBC2Y4ON7SYBJNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HV2EYICT2JEKBC2Y4ON7SYBJNC","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":"804ffce2d44670f406683d15c6a769c34db42ab851f5f5051f3bcbf6d8311ac2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-28T12:21:24Z","title_canon_sha256":"2dd7df3f44d7052b908a32901f3ae496221550a6d7a326bd4460be5200bf79e6"},"schema_version":"1.0","source":{"id":"1303.7110","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.7110","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"arxiv_version","alias_value":"1303.7110v4","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.7110","created_at":"2026-05-18T02:56:35Z"},{"alias_kind":"pith_short_12","alias_value":"HV2EYICT2JEK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HV2EYICT2JEKBC2Y","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HV2EYICT","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:79743e92d81c89d2b5534ce567b2afec58384211607ccb4172f8b1e20361966c","target":"graph","created_at":"2026-05-18T02:56:35Z","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":"The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem. Let $n=2k+1$ and let $q$ be a power of a prime number. Consider the set of $(k+1)$-dimensional subspaces and the set of $k$-dimensional subspaces of $\\F_q^n$. Can these subspaces be ordered in a way that for any two adjacent subspaces $X$ and $Y$, either $X \\subset Y$ or $Y \\subset X$? A construction method which yields many Hamiltonian cycles for any given ","authors_text":"Tuvi Etzion","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-28T12:21:24Z","title":"The q-Analog of the Middle Levels Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.7110","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:5f4da71d7f01296d7f082e22cec0c647d8b831bcecf99e3e872a8e9160e11b19","target":"record","created_at":"2026-05-18T02:56:35Z","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":"804ffce2d44670f406683d15c6a769c34db42ab851f5f5051f3bcbf6d8311ac2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-28T12:21:24Z","title_canon_sha256":"2dd7df3f44d7052b908a32901f3ae496221550a6d7a326bd4460be5200bf79e6"},"schema_version":"1.0","source":{"id":"1303.7110","kind":"arxiv","version":4}},"canonical_sha256":"3d744c2053d248a08b58e39bf96029688e0f07c27a8f22ad917c78fafa55842c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d744c2053d248a08b58e39bf96029688e0f07c27a8f22ad917c78fafa55842c","first_computed_at":"2026-05-18T02:56:35.370946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:35.370946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MjjXizDI8ykDWLYMlgePp5wWnlBmG4BDyYk6mmj70ktvA5nKwP0KWbGMRyJGWNyisV0JbBnK/4GzoJmErpcdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:35.371714Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.7110","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f4da71d7f01296d7f082e22cec0c647d8b831bcecf99e3e872a8e9160e11b19","sha256:79743e92d81c89d2b5534ce567b2afec58384211607ccb4172f8b1e20361966c"],"state_sha256":"fb79fe33965acb1aa25155bb885b1768d2e1b41cb628208bc287ae60da6d2b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kGSFzI6M2Cr8J3WiiYtuEEZSU1muGbOFju4UcZhMotzVJtPCDQlOQSzZDHB7G4hIdXLwkH+Uks5+I2uN8VbGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:13:04.307980Z","bundle_sha256":"dfc2bd4819de65ea9b7a93c138c2e3c5394284e95aefa07f861375967856aa67"}}