{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TGYIRKGSOBVKJUMSXH56S7CO2A","short_pith_number":"pith:TGYIRKGS","schema_version":"1.0","canonical_sha256":"99b088a8d2706aa4d192b9fbe97c4ed03b6bf746b950f21ce7025fa6207c1568","source":{"kind":"arxiv","id":"1701.06705","version":1},"attestation_state":"computed","paper":{"title":"Generalized Gray codes with prescribed ends of small dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Tom\\'a\\v{s} Dvo\\v{r}\\'ak, V\\'aclav Koubek","submitted_at":"2017-01-24T01:50:31Z","abstract_excerpt":"Given pairwise distinct vertices $\\{\\alpha_i , \\beta_i\\}^k_{i=1}$ of the $n$-dimensional hypercube $Q_n$ such that the distance of $\\alpha_i$ and $\\beta_i$ is odd, are there paths $P_i$ between $\\alpha_i$ and $\\beta_i$ such that $\\{V (P_i)\\}^k_{i=1}$ partitions $V(Q_n)$? A positive solution for every $n\\ge1$ and $k=1$ is known as a Gray code of dimension $n$. In this paper we settle this problem for small values of $n$."},"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":"1701.06705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-01-24T01:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"077f81408dd123aef687fd06bcb1796764cfdbbc3fa4a0cadc5c8c6ed05b4766","abstract_canon_sha256":"ff7fd7b2b436d97b8a8bf47a55e424c414ab5657172452d64914068d02e408bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:12.330666Z","signature_b64":"CyO9Cafi9xZPTYb4CkEzy2x0BMlfYX/KTSJR1uPCqc+Nk1n0Lwnv1PSlXpj5b3oyptqB2TzGKuBUF50xmmO+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99b088a8d2706aa4d192b9fbe97c4ed03b6bf746b950f21ce7025fa6207c1568","last_reissued_at":"2026-05-18T00:52:12.330217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:12.330217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Gray codes with prescribed ends of small dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Tom\\'a\\v{s} Dvo\\v{r}\\'ak, V\\'aclav Koubek","submitted_at":"2017-01-24T01:50:31Z","abstract_excerpt":"Given pairwise distinct vertices $\\{\\alpha_i , \\beta_i\\}^k_{i=1}$ of the $n$-dimensional hypercube $Q_n$ such that the distance of $\\alpha_i$ and $\\beta_i$ is odd, are there paths $P_i$ between $\\alpha_i$ and $\\beta_i$ such that $\\{V (P_i)\\}^k_{i=1}$ partitions $V(Q_n)$? A positive solution for every $n\\ge1$ and $k=1$ is known as a Gray code of dimension $n$. In this paper we settle this problem for small values of $n$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06705","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":"1701.06705","created_at":"2026-05-18T00:52:12.330303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06705v1","created_at":"2026-05-18T00:52:12.330303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06705","created_at":"2026-05-18T00:52:12.330303+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGYIRKGSOBVK","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGYIRKGSOBVKJUMS","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGYIRKGS","created_at":"2026-05-18T12:31:46.661854+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/TGYIRKGSOBVKJUMSXH56S7CO2A","json":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A.json","graph_json":"https://pith.science/api/pith-number/TGYIRKGSOBVKJUMSXH56S7CO2A/graph.json","events_json":"https://pith.science/api/pith-number/TGYIRKGSOBVKJUMSXH56S7CO2A/events.json","paper":"https://pith.science/paper/TGYIRKGS"},"agent_actions":{"view_html":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A","download_json":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A.json","view_paper":"https://pith.science/paper/TGYIRKGS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06705&json=true","fetch_graph":"https://pith.science/api/pith-number/TGYIRKGSOBVKJUMSXH56S7CO2A/graph.json","fetch_events":"https://pith.science/api/pith-number/TGYIRKGSOBVKJUMSXH56S7CO2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A/action/storage_attestation","attest_author":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A/action/author_attestation","sign_citation":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A/action/citation_signature","submit_replication":"https://pith.science/pith/TGYIRKGSOBVKJUMSXH56S7CO2A/action/replication_record"}},"created_at":"2026-05-18T00:52:12.330303+00:00","updated_at":"2026-05-18T00:52:12.330303+00:00"}