{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NDHPDVHPB5BYSWY6LTBST5JM6F","short_pith_number":"pith:NDHPDVHP","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"},"canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","source":{"kind":"arxiv","id":"1410.8385","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8385","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8385v5","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8385","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"NDHPDVHPB5BY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NDHPDVHPB5BYSWY6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NDHPDVHP","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NDHPDVHPB5BYSWY6LTBST5JM6F","target":"record","payload":{"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"},"canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","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"},"source_kind":"arxiv","source_id":"1410.8385","source_version":5,"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-05-18T02:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vQPsjFEsVrJ6+OSGu+ArjO44N/nPT8Hrhomx8SgZ0BUK0V9evXMt1S8W5f1OOGJLNMjLkkp7EY2cIzgwrwSDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:00:33.705459Z"},"content_sha256":"bad3d7cf930ccb4a704a700548d83bbaebd9a45ef3ee1aab928f19da8b8f3819","schema_version":"1.0","event_id":"sha256:bad3d7cf930ccb4a704a700548d83bbaebd9a45ef3ee1aab928f19da8b8f3819"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NDHPDVHPB5BYSWY6LTBST5JM6F","target":"graph","payload":{"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"},"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-05-18T02:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vjEGovj03Gcw7uREbEguZlVGwniwiR2DvCsdSkKacXW9lIDX1Wmnwd+JT6Q0buwup3JUAQJVbJA9HAf1p5PWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T16:00:33.705889Z"},"content_sha256":"39fe8e7c7c9cee4d22ba3f22bbfb9fefd2883a864271a3660fa85f05a24138f5","schema_version":"1.0","event_id":"sha256:39fe8e7c7c9cee4d22ba3f22bbfb9fefd2883a864271a3660fa85f05a24138f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/bundle.json","state_url":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/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-06-24T16:00:33Z","links":{"resolver":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F","bundle":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/bundle.json","state":"https://pith.science/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NDHPDVHPB5BYSWY6LTBST5JM6F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NDHPDVHPB5BYSWY6LTBST5JM6F","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":"1ae0931c0c1cf1f6ac517a10a53356b077f396f0e6b1eb2660e55b61ab4095fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T14:48:58Z","title_canon_sha256":"9eb699dd70662cb3706167ed22ae8be527fe6890c964495b202d234ca4b49e9d"},"schema_version":"1.0","source":{"id":"1410.8385","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.8385","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.8385v5","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.8385","created_at":"2026-05-18T02:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"NDHPDVHPB5BY","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NDHPDVHPB5BYSWY6","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NDHPDVHP","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:39fe8e7c7c9cee4d22ba3f22bbfb9fefd2883a864271a3660fa85f05a24138f5","target":"graph","created_at":"2026-05-18T02:20:09Z","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 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","authors_text":"Arkadii D'yachkov, Ilya Vorobyev, Nikita Polyanskii, Vladislav Shchukin","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T14:48:58Z","title":"Symmetric Disjunctive List-Decoding Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.8385","kind":"arxiv","version":5},"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:bad3d7cf930ccb4a704a700548d83bbaebd9a45ef3ee1aab928f19da8b8f3819","target":"record","created_at":"2026-05-18T02:20:09Z","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":"1ae0931c0c1cf1f6ac517a10a53356b077f396f0e6b1eb2660e55b61ab4095fd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-30T14:48:58Z","title_canon_sha256":"9eb699dd70662cb3706167ed22ae8be527fe6890c964495b202d234ca4b49e9d"},"schema_version":"1.0","source":{"id":"1410.8385","kind":"arxiv","version":5}},"canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68cef1d4ef0f43895b1e5cc329f52cf171f7f70c190cf1daaf539325e72bfd9f","first_computed_at":"2026-05-18T02:20:09.913391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:09.913391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"emJchfnM+N+4Iuq55FV8lr2ppZiQpEqGEfA5SoGM+OiDAdcD9g2psRVpWTZzqS3lfafRxGAu+iCz83/v//ceAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:09.914073Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.8385","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad3d7cf930ccb4a704a700548d83bbaebd9a45ef3ee1aab928f19da8b8f3819","sha256:39fe8e7c7c9cee4d22ba3f22bbfb9fefd2883a864271a3660fa85f05a24138f5"],"state_sha256":"1cfeac634c4b309b6084bbf7b96e78fa9b11bbde4f7ed72a42fb4ae783effe85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EqcHnnDrTJ71pTkyh9BXRRmHBnD1A8ZXOcNtut8R3JjTdL2EZh81fdzNPQeHMluLGz80SpN9FzGh+NVod97VCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T16:00:33.709381Z","bundle_sha256":"57d885235cf41b6ad470bb2d658e092ae249fd42585e39179b0b2f30ba6c5cd3"}}