{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HQPQIK2KY3C3O6XYHHX7KTVKWQ","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":"fa868dca3471a423675111564b4c4bb615841ca790951c177164a503b23b5bf0","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T22:59:39Z","title_canon_sha256":"9e1b25b2bc0c139645b7f19505c5c142a8c5be69865f6de3b685c996b70f1f16"},"schema_version":"1.0","source":{"id":"1401.0050","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0050","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0050v6","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0050","created_at":"2026-05-18T01:14:36Z"},{"alias_kind":"pith_short_12","alias_value":"HQPQIK2KY3C3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HQPQIK2KY3C3O6XY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HQPQIK2K","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:17debe8f9acef82f00106bea82e288d03ac0d08630fe5592f2dc66d405b782f0","target":"graph","created_at":"2026-05-18T01:14:36Z","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"},"paper":{"abstract_excerpt":"A binary code is called a superimposed cover-free $(s,\\ell)$-code if the code is identified by the incidence matrix of a family of finite sets in which no intersection of $\\ell$ sets is covered by the union of $s$ others. A binary code is called a superimposed list-decoding $s_L$-code if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not more than $L-1$ other sets of the family. For $L=\\ell=1$, both of the definitions coincide and the corresponding binary code is called a superimposed $s$-code. Our aim is to obtain new low","authors_text":"Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii, Vladislav Shchukin","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T22:59:39Z","title":"Bounds on the rate of superimposed codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0050","kind":"arxiv","version":6},"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:96b117780f1f8bf33fb0b2454ad411b3a2dc14be73c164f95bc3eab2cf53005b","target":"record","created_at":"2026-05-18T01:14:36Z","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":"fa868dca3471a423675111564b4c4bb615841ca790951c177164a503b23b5bf0","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T22:59:39Z","title_canon_sha256":"9e1b25b2bc0c139645b7f19505c5c142a8c5be69865f6de3b685c996b70f1f16"},"schema_version":"1.0","source":{"id":"1401.0050","kind":"arxiv","version":6}},"canonical_sha256":"3c1f042b4ac6c5b77af839eff54eaab43562b1d4dd0e486a2380a1133542d926","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c1f042b4ac6c5b77af839eff54eaab43562b1d4dd0e486a2380a1133542d926","first_computed_at":"2026-05-18T01:14:36.342192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:36.342192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wQjyHjoUdan5lZPeZzQbK4jvypSe7eJISjwWAemiWQHpeYDJW0HjixQ6tjFCF45oOnVc5G7EUEucrc0BDP8JBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:36.342909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0050","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96b117780f1f8bf33fb0b2454ad411b3a2dc14be73c164f95bc3eab2cf53005b","sha256:17debe8f9acef82f00106bea82e288d03ac0d08630fe5592f2dc66d405b782f0"],"state_sha256":"e784e97db49b456650a07b5822694855271f0198fbba0ffdb44e8bee904f7151"}