{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HQPQIK2KY3C3O6XYHHX7KTVKWQ","short_pith_number":"pith:HQPQIK2K","schema_version":"1.0","canonical_sha256":"3c1f042b4ac6c5b77af839eff54eaab43562b1d4dd0e486a2380a1133542d926","source":{"kind":"arxiv","id":"1401.0050","version":6},"attestation_state":"computed","paper":{"title":"Bounds on the rate of superimposed codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii, Vladislav Shchukin","submitted_at":"2013-12-30T22:59:39Z","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"},"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":"1401.0050","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-30T22:59:39Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"9e1b25b2bc0c139645b7f19505c5c142a8c5be69865f6de3b685c996b70f1f16","abstract_canon_sha256":"fa868dca3471a423675111564b4c4bb615841ca790951c177164a503b23b5bf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:36.342909Z","signature_b64":"wQjyHjoUdan5lZPeZzQbK4jvypSe7eJISjwWAemiWQHpeYDJW0HjixQ6tjFCF45oOnVc5G7EUEucrc0BDP8JBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c1f042b4ac6c5b77af839eff54eaab43562b1d4dd0e486a2380a1133542d926","last_reissued_at":"2026-05-18T01:14:36.342192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:36.342192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the rate of superimposed codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Arkady D'yachkov, Ilya Vorobyev, Nikita Polianskii, Vladislav Shchukin","submitted_at":"2013-12-30T22:59:39Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0050","kind":"arxiv","version":6},"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":"1401.0050","created_at":"2026-05-18T01:14:36.342303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0050v6","created_at":"2026-05-18T01:14:36.342303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0050","created_at":"2026-05-18T01:14:36.342303+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQPQIK2KY3C3","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQPQIK2KY3C3O6XY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQPQIK2K","created_at":"2026-05-18T12:27:46.883200+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/HQPQIK2KY3C3O6XYHHX7KTVKWQ","json":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ.json","graph_json":"https://pith.science/api/pith-number/HQPQIK2KY3C3O6XYHHX7KTVKWQ/graph.json","events_json":"https://pith.science/api/pith-number/HQPQIK2KY3C3O6XYHHX7KTVKWQ/events.json","paper":"https://pith.science/paper/HQPQIK2K"},"agent_actions":{"view_html":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ","download_json":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ.json","view_paper":"https://pith.science/paper/HQPQIK2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0050&json=true","fetch_graph":"https://pith.science/api/pith-number/HQPQIK2KY3C3O6XYHHX7KTVKWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/HQPQIK2KY3C3O6XYHHX7KTVKWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ/action/storage_attestation","attest_author":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ/action/author_attestation","sign_citation":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ/action/citation_signature","submit_replication":"https://pith.science/pith/HQPQIK2KY3C3O6XYHHX7KTVKWQ/action/replication_record"}},"created_at":"2026-05-18T01:14:36.342303+00:00","updated_at":"2026-05-18T01:14:36.342303+00:00"}