{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VJB7OOAYYOK2DU7UPN4J3VPIKA","short_pith_number":"pith:VJB7OOAY","schema_version":"1.0","canonical_sha256":"aa43f73818c395a1d3f47b789dd5e8503eb6965bac22cd6f04f34eee633864f1","source":{"kind":"arxiv","id":"1603.08827","version":1},"attestation_state":"computed","paper":{"title":"Generalized Gray codes with prescribed ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Petr Gregor, Tom\\'a\\v{s} Dvo\\v{r}\\'ak, V\\'aclav Koubek","submitted_at":"2016-03-29T16:16:35Z","abstract_excerpt":"An $n$-bit Gray code is a sequence of all $n$-bit strings such that consecutive strings differ in a single bit. It is well-known that given $\\alpha,\\beta\\in\\{0,1\\}^n$, an $n$-bit Gray code between $\\alpha$ and $\\beta$ exists iff the Hamming distance $d(\\alpha,\\beta)$ of $\\alpha$ and $\\beta$ is odd. We generalize this classical result to $k$ pairwise disjoint pairs $\\alpha_i, \\beta_i\\in\\{0,1\\}^n$: if $d(\\alpha_i,\\beta_i)$ is odd for all $i$ and $k<n$, then the set of all $n$-bit strings can be partitioned into $k$ sequences such that the $i$-th sequence leads from $\\alpha_i$ to $\\beta_i$ and co"},"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":"1603.08827","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-03-29T16:16:35Z","cross_cats_sorted":[],"title_canon_sha256":"69d2cb332548977e2b1f60a294285c8f2830453c100f333204df40844947eed5","abstract_canon_sha256":"160561428bafcc85a9f91d16c1fa263e87d14a7607153c79858b07bb0360fbf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:34.622608Z","signature_b64":"LyvxCjD9KhB0713NtAZbTkqnQJV7m4gnbNOXqFwUPvAi+qsQJ7zVG7neHManTbPL8BDDTN5hZsE8hsbfaHd/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa43f73818c395a1d3f47b789dd5e8503eb6965bac22cd6f04f34eee633864f1","last_reissued_at":"2026-05-18T00:49:34.622026Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:34.622026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Gray codes with prescribed ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Petr Gregor, Tom\\'a\\v{s} Dvo\\v{r}\\'ak, V\\'aclav Koubek","submitted_at":"2016-03-29T16:16:35Z","abstract_excerpt":"An $n$-bit Gray code is a sequence of all $n$-bit strings such that consecutive strings differ in a single bit. It is well-known that given $\\alpha,\\beta\\in\\{0,1\\}^n$, an $n$-bit Gray code between $\\alpha$ and $\\beta$ exists iff the Hamming distance $d(\\alpha,\\beta)$ of $\\alpha$ and $\\beta$ is odd. We generalize this classical result to $k$ pairwise disjoint pairs $\\alpha_i, \\beta_i\\in\\{0,1\\}^n$: if $d(\\alpha_i,\\beta_i)$ is odd for all $i$ and $k<n$, then the set of all $n$-bit strings can be partitioned into $k$ sequences such that the $i$-th sequence leads from $\\alpha_i$ to $\\beta_i$ and co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08827","kind":"arxiv","version":1},"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":"1603.08827","created_at":"2026-05-18T00:49:34.622127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.08827v1","created_at":"2026-05-18T00:49:34.622127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08827","created_at":"2026-05-18T00:49:34.622127+00:00"},{"alias_kind":"pith_short_12","alias_value":"VJB7OOAYYOK2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VJB7OOAYYOK2DU7U","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VJB7OOAY","created_at":"2026-05-18T12:30:48.956258+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/VJB7OOAYYOK2DU7UPN4J3VPIKA","json":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA.json","graph_json":"https://pith.science/api/pith-number/VJB7OOAYYOK2DU7UPN4J3VPIKA/graph.json","events_json":"https://pith.science/api/pith-number/VJB7OOAYYOK2DU7UPN4J3VPIKA/events.json","paper":"https://pith.science/paper/VJB7OOAY"},"agent_actions":{"view_html":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA","download_json":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA.json","view_paper":"https://pith.science/paper/VJB7OOAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.08827&json=true","fetch_graph":"https://pith.science/api/pith-number/VJB7OOAYYOK2DU7UPN4J3VPIKA/graph.json","fetch_events":"https://pith.science/api/pith-number/VJB7OOAYYOK2DU7UPN4J3VPIKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA/action/storage_attestation","attest_author":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA/action/author_attestation","sign_citation":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA/action/citation_signature","submit_replication":"https://pith.science/pith/VJB7OOAYYOK2DU7UPN4J3VPIKA/action/replication_record"}},"created_at":"2026-05-18T00:49:34.622127+00:00","updated_at":"2026-05-18T00:49:34.622127+00:00"}