{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GIAPG7PIHH2EH7TKGRS5MEL4ON","short_pith_number":"pith:GIAPG7PI","schema_version":"1.0","canonical_sha256":"3200f37de839f443fe6a3465d6117c73553fc87e0bf2b6c9acd4d6ea4886a14e","source":{"kind":"arxiv","id":"1410.8566","version":5},"attestation_state":"computed","paper":{"title":"Almost Cover-Free Codes and Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Shchukin","submitted_at":"2014-10-30T21:30:42Z","abstract_excerpt":"An $s$-subset of codewords of a binary code $X$ is said to be an {\\em $(s,\\ell)$-bad} in $X$ if the code $X$ contains a subset of other $\\ell$ codewords such that the conjunction of the $\\ell$ codewords is covered by the disjunctive sum of the $s$ codewords. Otherwise, the $s$-subset of codewords of $X$ is said to be an {\\em $(s,\\ell)$-good} in~$X$.mA binary code $X$ is said to be a cover-free $(s,\\ell)$-code if the code $X$ does not contain $(s,\\ell)$-bad subsets. In this paper, we introduce a natural {\\em probabilistic} generalization of cover-free $(s,\\ell)$-codes, namely: a binary code is "},"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":"1410.8566","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T21:30:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1a61206e803784b1050fc955fe91d066034bee7e5bf8c1c682878ddb01bdacd8","abstract_canon_sha256":"007ccbc3ce897c0d434d38bbe1c94ba3973febe6c37907323cd721c021d2cbb2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:28.569326Z","signature_b64":"+QlU18cKjP3H2UKTEjq4YSqKqI+ABr9xbKdHj1F14hhivLzsJy6BYEH06EoXT5zpGJoAyMIJoTlwjNmfkLjxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3200f37de839f443fe6a3465d6117c73553fc87e0bf2b6c9acd4d6ea4886a14e","last_reissued_at":"2026-05-18T02:20:28.568901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:28.568901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost Cover-Free Codes and Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Shchukin","submitted_at":"2014-10-30T21:30:42Z","abstract_excerpt":"An $s$-subset of codewords of a binary code $X$ is said to be an {\\em $(s,\\ell)$-bad} in $X$ if the code $X$ contains a subset of other $\\ell$ codewords such that the conjunction of the $\\ell$ codewords is covered by the disjunctive sum of the $s$ codewords. Otherwise, the $s$-subset of codewords of $X$ is said to be an {\\em $(s,\\ell)$-good} in~$X$.mA binary code $X$ is said to be a cover-free $(s,\\ell)$-code if the code $X$ does not contain $(s,\\ell)$-bad subsets. In this paper, we introduce a natural {\\em probabilistic} generalization of cover-free $(s,\\ell)$-codes, namely: a binary code is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8566","kind":"arxiv","version":5},"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":"1410.8566","created_at":"2026-05-18T02:20:28.568966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8566v5","created_at":"2026-05-18T02:20:28.568966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8566","created_at":"2026-05-18T02:20:28.568966+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIAPG7PIHH2E","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIAPG7PIHH2EH7TK","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIAPG7PI","created_at":"2026-05-18T12:28:30.664211+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/GIAPG7PIHH2EH7TKGRS5MEL4ON","json":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON.json","graph_json":"https://pith.science/api/pith-number/GIAPG7PIHH2EH7TKGRS5MEL4ON/graph.json","events_json":"https://pith.science/api/pith-number/GIAPG7PIHH2EH7TKGRS5MEL4ON/events.json","paper":"https://pith.science/paper/GIAPG7PI"},"agent_actions":{"view_html":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON","download_json":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON.json","view_paper":"https://pith.science/paper/GIAPG7PI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8566&json=true","fetch_graph":"https://pith.science/api/pith-number/GIAPG7PIHH2EH7TKGRS5MEL4ON/graph.json","fetch_events":"https://pith.science/api/pith-number/GIAPG7PIHH2EH7TKGRS5MEL4ON/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON/action/storage_attestation","attest_author":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON/action/author_attestation","sign_citation":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON/action/citation_signature","submit_replication":"https://pith.science/pith/GIAPG7PIHH2EH7TKGRS5MEL4ON/action/replication_record"}},"created_at":"2026-05-18T02:20:28.568966+00:00","updated_at":"2026-05-18T02:20:28.568966+00:00"}