{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LC5OZQYJJ2HU52IZFCQDMCWDXZ","short_pith_number":"pith:LC5OZQYJ","schema_version":"1.0","canonical_sha256":"58baecc3094e8f4ee91928a0360ac3be5289d5272552a85c3f52661a8758a902","source":{"kind":"arxiv","id":"1712.01834","version":2},"attestation_state":"computed","paper":{"title":"Optimal Quasi-Gray Codes: The Alphabet Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Debarati Das, Diptarka Chakraborty, Michal Kouck\\'y, Nitin Saurabh","submitted_at":"2017-12-05T14:43:45Z","abstract_excerpt":"A quasi-Gray code of dimension $n$ and length $\\ell$ over an alphabet $\\Sigma$ is a sequence of distinct words $w_1,w_2,\\dots,w_\\ell$ from $\\Sigma^n$ such that any two consecutive words differ in at most $c$ coordinates, for some fixed constant $c>0$. In this paper we are interested in the read and write complexity of quasi-Gray codes in the bit-probe model, where we measure the number of symbols read and written in order to transform any word $w_i$ into its successor $w_{i+1}$.\n  We present construction of quasi-Gray codes of dimension $n$ and length $3^n$ over the ternary alphabet $\\{0,1,2\\}"},"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":"1712.01834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-12-05T14:43:45Z","cross_cats_sorted":["cs.CC","cs.DS","math.IT"],"title_canon_sha256":"6f32173ee0cdd4c18fdb3c9cca8308df2eac306d1cb14d640334706dcde754bb","abstract_canon_sha256":"4ec05a829bf3d1c0ac7e42e8bfbce1faa1420756f758c6ce756b9d7a3dde10f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:38.840702Z","signature_b64":"iu+67M8GeOa7baRqJwaCw5Lt5w/6qMGQh3ABqOxcUfT6z/u8ZeVTZCAGuOOhEH5sBhWpbkdWgQN0sp22gJ9SDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58baecc3094e8f4ee91928a0360ac3be5289d5272552a85c3f52661a8758a902","last_reissued_at":"2026-05-18T00:10:38.839971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:38.839971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Quasi-Gray Codes: The Alphabet Matters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.IT"],"primary_cat":"cs.IT","authors_text":"Debarati Das, Diptarka Chakraborty, Michal Kouck\\'y, Nitin Saurabh","submitted_at":"2017-12-05T14:43:45Z","abstract_excerpt":"A quasi-Gray code of dimension $n$ and length $\\ell$ over an alphabet $\\Sigma$ is a sequence of distinct words $w_1,w_2,\\dots,w_\\ell$ from $\\Sigma^n$ such that any two consecutive words differ in at most $c$ coordinates, for some fixed constant $c>0$. In this paper we are interested in the read and write complexity of quasi-Gray codes in the bit-probe model, where we measure the number of symbols read and written in order to transform any word $w_i$ into its successor $w_{i+1}$.\n  We present construction of quasi-Gray codes of dimension $n$ and length $3^n$ over the ternary alphabet $\\{0,1,2\\}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.01834","kind":"arxiv","version":2},"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":"1712.01834","created_at":"2026-05-18T00:10:38.840097+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.01834v2","created_at":"2026-05-18T00:10:38.840097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.01834","created_at":"2026-05-18T00:10:38.840097+00:00"},{"alias_kind":"pith_short_12","alias_value":"LC5OZQYJJ2HU","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LC5OZQYJJ2HU52IZ","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LC5OZQYJ","created_at":"2026-05-18T12:31:28.150371+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/LC5OZQYJJ2HU52IZFCQDMCWDXZ","json":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ.json","graph_json":"https://pith.science/api/pith-number/LC5OZQYJJ2HU52IZFCQDMCWDXZ/graph.json","events_json":"https://pith.science/api/pith-number/LC5OZQYJJ2HU52IZFCQDMCWDXZ/events.json","paper":"https://pith.science/paper/LC5OZQYJ"},"agent_actions":{"view_html":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ","download_json":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ.json","view_paper":"https://pith.science/paper/LC5OZQYJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.01834&json=true","fetch_graph":"https://pith.science/api/pith-number/LC5OZQYJJ2HU52IZFCQDMCWDXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LC5OZQYJJ2HU52IZFCQDMCWDXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ/action/storage_attestation","attest_author":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ/action/author_attestation","sign_citation":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ/action/citation_signature","submit_replication":"https://pith.science/pith/LC5OZQYJJ2HU52IZFCQDMCWDXZ/action/replication_record"}},"created_at":"2026-05-18T00:10:38.840097+00:00","updated_at":"2026-05-18T00:10:38.840097+00:00"}