{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:5BS3EIA5SE36RPBYK5HNTIW4HN","short_pith_number":"pith:5BS3EIA5","canonical_record":{"source":{"id":"2502.08424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T14:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"8f6b6e3eb44cfadb217ec612e8f89c7b4472aa322a386f07e9d33714d0c2b3bd","abstract_canon_sha256":"260aa9e9f37858816d3949d49e1466a4df5935cbed97d5a45dd9460c6fa48b9a"},"schema_version":"1.0"},"canonical_sha256":"e865b2201d9137e8bc38574ed9a2dc3b74bf423c9883705308c6e9806c9aba43","source":{"kind":"arxiv","id":"2502.08424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08424","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08424v2","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08424","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"5BS3EIA5SE36","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_16","alias_value":"5BS3EIA5SE36RPBY","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_8","alias_value":"5BS3EIA5","created_at":"2026-07-05T11:37:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:5BS3EIA5SE36RPBYK5HNTIW4HN","target":"record","payload":{"canonical_record":{"source":{"id":"2502.08424","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T14:07:18Z","cross_cats_sorted":[],"title_canon_sha256":"8f6b6e3eb44cfadb217ec612e8f89c7b4472aa322a386f07e9d33714d0c2b3bd","abstract_canon_sha256":"260aa9e9f37858816d3949d49e1466a4df5935cbed97d5a45dd9460c6fa48b9a"},"schema_version":"1.0"},"canonical_sha256":"e865b2201d9137e8bc38574ed9a2dc3b74bf423c9883705308c6e9806c9aba43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:15.954853Z","signature_b64":"mHh4H7YMcdVZ2sAJF93ufZFvB9XuG0KL7dqOtgR7MOSU7V1RSxyBkF+qWXoVuceJhUd9dr02infiJ2t2f9jDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e865b2201d9137e8bc38574ed9a2dc3b74bf423c9883705308c6e9806c9aba43","last_reissued_at":"2026-07-05T11:37:15.954358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:15.954358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.08424","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"utd7R3xfi9+SCPU+OzoJvEusyIIJLvvEhZotyhaPiTb6y3Mu7IRE8VV4ssoejM82LcyxQXxTtUDyorcmCqAvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:23:00.039667Z"},"content_sha256":"aee01410b35cc85eee674554d3b0c403f23c67de15116d47de6b78c8665941c5","schema_version":"1.0","event_id":"sha256:aee01410b35cc85eee674554d3b0c403f23c67de15116d47de6b78c8665941c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:5BS3EIA5SE36RPBYK5HNTIW4HN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructions of Covering Sequences and Arrays","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hoang Ta, Tuvi Etzion, Van Khu Vu, Yeow Meng Chee","submitted_at":"2025-02-12T14:07:18Z","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$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n \\leq 20$ and $1 \\leq R \\leq 3$, are obtained. The definition is generalized in two directions. An $(n,m,R)$-covering sequence code is a set of cyclic sequences of length $m$ whose consecutive $n$-tuples form a code of length~$n$ and covering radius $R$. The definition is also generalized to arrays in which the $m \\times n$ sub-matrices form a covering code with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08424","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.08424/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQ9h+QIQPuX35eiSZvnvuPu2f1MtPYz7DjC3BJ8FPM7JFtk86NAEXy37nXGRgtMyPvw3iZUGwDacG4fyCQsWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:23:00.040435Z"},"content_sha256":"c4fbb0feb0f82c99be33eeb03d0ee2fb00dda8dbe3d7c5563521d06efae79046","schema_version":"1.0","event_id":"sha256:c4fbb0feb0f82c99be33eeb03d0ee2fb00dda8dbe3d7c5563521d06efae79046"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/bundle.json","state_url":"https://pith.science/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T15:23:00Z","links":{"resolver":"https://pith.science/pith/5BS3EIA5SE36RPBYK5HNTIW4HN","bundle":"https://pith.science/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/bundle.json","state":"https://pith.science/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5BS3EIA5SE36RPBYK5HNTIW4HN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5BS3EIA5SE36RPBYK5HNTIW4HN","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":"260aa9e9f37858816d3949d49e1466a4df5935cbed97d5a45dd9460c6fa48b9a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T14:07:18Z","title_canon_sha256":"8f6b6e3eb44cfadb217ec612e8f89c7b4472aa322a386f07e9d33714d0c2b3bd"},"schema_version":"1.0","source":{"id":"2502.08424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.08424","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"arxiv_version","alias_value":"2502.08424v2","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08424","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_12","alias_value":"5BS3EIA5SE36","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_16","alias_value":"5BS3EIA5SE36RPBY","created_at":"2026-07-05T11:37:15Z"},{"alias_kind":"pith_short_8","alias_value":"5BS3EIA5","created_at":"2026-07-05T11:37:15Z"}],"graph_snapshots":[{"event_id":"sha256:c4fbb0feb0f82c99be33eeb03d0ee2fb00dda8dbe3d7c5563521d06efae79046","target":"graph","created_at":"2026-07-05T11:37:15Z","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/2502.08424/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$. Using several construction methods improvements of the upper bounds on the length of such sequences for $n \\leq 20$ and $1 \\leq R \\leq 3$, are obtained. The definition is generalized in two directions. An $(n,m,R)$-covering sequence code is a set of cyclic sequences of length $m$ whose consecutive $n$-tuples form a code of length~$n$ and covering radius $R$. The definition is also generalized to arrays in which the $m \\times n$ sub-matrices form a covering code with","authors_text":"Hoang Ta, Tuvi Etzion, Van Khu Vu, Yeow Meng Chee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T14:07:18Z","title":"Constructions of Covering Sequences and Arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08424","kind":"arxiv","version":2},"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:aee01410b35cc85eee674554d3b0c403f23c67de15116d47de6b78c8665941c5","target":"record","created_at":"2026-07-05T11:37:15Z","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":"260aa9e9f37858816d3949d49e1466a4df5935cbed97d5a45dd9460c6fa48b9a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-12T14:07:18Z","title_canon_sha256":"8f6b6e3eb44cfadb217ec612e8f89c7b4472aa322a386f07e9d33714d0c2b3bd"},"schema_version":"1.0","source":{"id":"2502.08424","kind":"arxiv","version":2}},"canonical_sha256":"e865b2201d9137e8bc38574ed9a2dc3b74bf423c9883705308c6e9806c9aba43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e865b2201d9137e8bc38574ed9a2dc3b74bf423c9883705308c6e9806c9aba43","first_computed_at":"2026-07-05T11:37:15.954358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:15.954358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mHh4H7YMcdVZ2sAJF93ufZFvB9XuG0KL7dqOtgR7MOSU7V1RSxyBkF+qWXoVuceJhUd9dr02infiJ2t2f9jDBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:15.954853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.08424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aee01410b35cc85eee674554d3b0c403f23c67de15116d47de6b78c8665941c5","sha256:c4fbb0feb0f82c99be33eeb03d0ee2fb00dda8dbe3d7c5563521d06efae79046"],"state_sha256":"24e3d4965c222a1922ee3cf5db3c859409fec19b26340b191bb88a6441436155"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g21+lrDqfKKoeTL7qzqDcDCYXf4KXre1SVXba4EvomRm/+YZA/UbbZSKZhNex97L9jGU0DR6uBLT48KqPW7tAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:23:00.046282Z","bundle_sha256":"04c9a2aea3036f00f482a81e63d7431bf8d37aca90a3f7a10c53cbc8a898b054"}}