{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:36HOVZ43LJWXKPURRH4DONJIXZ","short_pith_number":"pith:36HOVZ43","schema_version":"1.0","canonical_sha256":"df8eeae79b5a6d753e9189f8373528be43f51aa067b5b4ae1f80de2e592a17fb","source":{"kind":"arxiv","id":"2607.14840","version":1},"attestation_state":"computed","paper":{"title":"Covering Sequences and Covering-Sequences Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tuvi Etzion","submitted_at":"2026-07-16T11:06:17Z","abstract_excerpt":"An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. An $(n,m,R)$-covering-sequences code is a set of cyclic sequences of length $m$, whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. These codes are the best building blocks for $(n,R)$-covering sequences. We show, for small radii, how the Hamming code can be used to construct such sequences of short length and such codes with a relatively small number of sequences and a total number of codewords. Sequences with small radius whose length "},"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":"2607.14840","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T11:06:17Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a14509df6ee404037af38aee957347fead0ef039e382486b690905fe94fac187","abstract_canon_sha256":"b0dd074c1e07c35682dc6a5828bcdbdd5d23fe8bde99150496adbeea9e97260f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:21:33.816228Z","signature_b64":"C9j2VGxkMuNOjDotY+7DTa9RgEletC/FKi80MSDOV48qqChmEYTXFEahxd6FNt+LMO071cbsdwoEdgMFcBxeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8eeae79b5a6d753e9189f8373528be43f51aa067b5b4ae1f80de2e592a17fb","last_reissued_at":"2026-07-17T01:21:33.815384Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:21:33.815384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering Sequences and Covering-Sequences Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Tuvi Etzion","submitted_at":"2026-07-16T11:06:17Z","abstract_excerpt":"An $(n,R)$-covering sequence is a cyclic sequence whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. An $(n,m,R)$-covering-sequences code is a set of cyclic sequences of length $m$, whose consecutive $n$-tuples form a code of length $n$ and covering radius $R$. These codes are the best building blocks for $(n,R)$-covering sequences. We show, for small radii, how the Hamming code can be used to construct such sequences of short length and such codes with a relatively small number of sequences and a total number of codewords. Sequences with small radius whose length "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14840","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.14840/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.14840","created_at":"2026-07-17T01:21:33.815827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.14840v1","created_at":"2026-07-17T01:21:33.815827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14840","created_at":"2026-07-17T01:21:33.815827+00:00"},{"alias_kind":"pith_short_12","alias_value":"36HOVZ43LJWX","created_at":"2026-07-17T01:21:33.815827+00:00"},{"alias_kind":"pith_short_16","alias_value":"36HOVZ43LJWXKPUR","created_at":"2026-07-17T01:21:33.815827+00:00"},{"alias_kind":"pith_short_8","alias_value":"36HOVZ43","created_at":"2026-07-17T01:21:33.815827+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/36HOVZ43LJWXKPURRH4DONJIXZ","json":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ.json","graph_json":"https://pith.science/api/pith-number/36HOVZ43LJWXKPURRH4DONJIXZ/graph.json","events_json":"https://pith.science/api/pith-number/36HOVZ43LJWXKPURRH4DONJIXZ/events.json","paper":"https://pith.science/paper/36HOVZ43"},"agent_actions":{"view_html":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ","download_json":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ.json","view_paper":"https://pith.science/paper/36HOVZ43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.14840&json=true","fetch_graph":"https://pith.science/api/pith-number/36HOVZ43LJWXKPURRH4DONJIXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/36HOVZ43LJWXKPURRH4DONJIXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ/action/storage_attestation","attest_author":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ/action/author_attestation","sign_citation":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ/action/citation_signature","submit_replication":"https://pith.science/pith/36HOVZ43LJWXKPURRH4DONJIXZ/action/replication_record"}},"created_at":"2026-07-17T01:21:33.815827+00:00","updated_at":"2026-07-17T01:21:33.815827+00:00"}