{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:36HOVZ43LJWXKPURRH4DONJIXZ","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":"b0dd074c1e07c35682dc6a5828bcdbdd5d23fe8bde99150496adbeea9e97260f","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T11:06:17Z","title_canon_sha256":"a14509df6ee404037af38aee957347fead0ef039e382486b690905fe94fac187"},"schema_version":"1.0","source":{"id":"2607.14840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.14840","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"2607.14840v1","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.14840","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"36HOVZ43LJWX","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_16","alias_value":"36HOVZ43LJWXKPUR","created_at":"2026-07-17T01:21:33Z"},{"alias_kind":"pith_short_8","alias_value":"36HOVZ43","created_at":"2026-07-17T01:21:33Z"}],"graph_snapshots":[{"event_id":"sha256:c9730742aa9f2c346da034b25b96c0a745c6af21c1041c4d03b30a34b44a1ccd","target":"graph","created_at":"2026-07-17T01:21:33Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.14840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Tuvi Etzion","cross_cats":["math.IT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T11:06:17Z","title":"Covering Sequences and Covering-Sequences Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.14840","kind":"arxiv","version":1},"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:98ad14c6e8dcb4f91d34142dd53af1f96390ddd18dde0abcad5f5a27f571e847","target":"record","created_at":"2026-07-17T01:21:33Z","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":"b0dd074c1e07c35682dc6a5828bcdbdd5d23fe8bde99150496adbeea9e97260f","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-07-16T11:06:17Z","title_canon_sha256":"a14509df6ee404037af38aee957347fead0ef039e382486b690905fe94fac187"},"schema_version":"1.0","source":{"id":"2607.14840","kind":"arxiv","version":1}},"canonical_sha256":"df8eeae79b5a6d753e9189f8373528be43f51aa067b5b4ae1f80de2e592a17fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df8eeae79b5a6d753e9189f8373528be43f51aa067b5b4ae1f80de2e592a17fb","first_computed_at":"2026-07-17T01:21:33.815384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-17T01:21:33.815384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C9j2VGxkMuNOjDotY+7DTa9RgEletC/FKi80MSDOV48qqChmEYTXFEahxd6FNt+LMO071cbsdwoEdgMFcBxeDw==","signature_status":"signed_v1","signed_at":"2026-07-17T01:21:33.816228Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.14840","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98ad14c6e8dcb4f91d34142dd53af1f96390ddd18dde0abcad5f5a27f571e847","sha256:c9730742aa9f2c346da034b25b96c0a745c6af21c1041c4d03b30a34b44a1ccd"],"state_sha256":"4f1b249cd9d02cb00359b885e984ff58a72e5713580bbfb1652e5ef2f7bb9ce7"}