{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NDHPDVHPB5BYSWY6LTBST5JM6F","short_pith_number":"pith:NDHPDVHP","schema_version":"1.0","canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","source":{"kind":"arxiv","id":"1410.8385","version":5},"attestation_state":"computed","paper":{"title":"Symmetric Disjunctive List-Decoding Codes","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-30T14:48:58Z","abstract_excerpt":"A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \\ge 2$, $L \\ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets can cover not more than $L-1$ other sets of the family. In this paper, we consider a similar class of binary codes which are based on a {\\em symmetric disjunctive sum} (SDS) of binary symbols. By definition, the symmetric disjunctive sum (SDS) takes values from the ternary alphabet $\\{0, 1, *\\}$, where the symbol~$*$ denotes \"erasure\". Namely: SDS is equal to"},"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.8385","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T14:48:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9eb699dd70662cb3706167ed22ae8be527fe6890c964495b202d234ca4b49e9d","abstract_canon_sha256":"1ae0931c0c1cf1f6ac517a10a53356b077f396f0e6b1eb2660e55b61ab4095fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:09.914073Z","signature_b64":"emJchfnM+N+4Iuq55FV8lr2ppZiQpEqGEfA5SoGM+OiDAdcD9g2psRVpWTZzqS3lfafRxGAu+iCz83/v//ceAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","last_reissued_at":"2026-05-18T02:20:09.913391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:09.913391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric Disjunctive List-Decoding Codes","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-30T14:48:58Z","abstract_excerpt":"A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \\ge 2$, $L \\ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets can cover not more than $L-1$ other sets of the family. In this paper, we consider a similar class of binary codes which are based on a {\\em symmetric disjunctive sum} (SDS) of binary symbols. By definition, the symmetric disjunctive sum (SDS) takes values from the ternary alphabet $\\{0, 1, *\\}$, where the symbol~$*$ denotes \"erasure\". Namely: SDS is equal to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8385","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.8385","created_at":"2026-05-18T02:20:09.913499+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.8385v5","created_at":"2026-05-18T02:20:09.913499+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8385","created_at":"2026-05-18T02:20:09.913499+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDHPDVHPB5BY","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDHPDVHPB5BYSWY6","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDHPDVHP","created_at":"2026-05-18T12:28:41.024544+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/NDHPDVHPB5BYSWY6LTBST5JM6F","json":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F.json","graph_json":"https://pith.science/api/pith-number/NDHPDVHPB5BYSWY6LTBST5JM6F/graph.json","events_json":"https://pith.science/api/pith-number/NDHPDVHPB5BYSWY6LTBST5JM6F/events.json","paper":"https://pith.science/paper/NDHPDVHP"},"agent_actions":{"view_html":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F","download_json":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F.json","view_paper":"https://pith.science/paper/NDHPDVHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.8385&json=true","fetch_graph":"https://pith.science/api/pith-number/NDHPDVHPB5BYSWY6LTBST5JM6F/graph.json","fetch_events":"https://pith.science/api/pith-number/NDHPDVHPB5BYSWY6LTBST5JM6F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/action/storage_attestation","attest_author":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/action/author_attestation","sign_citation":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/action/citation_signature","submit_replication":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/action/replication_record"}},"created_at":"2026-05-18T02:20:09.913499+00:00","updated_at":"2026-05-18T02:20:09.913499+00:00"}