{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VLT3334POHGYWTSSQ4ZGAIOQKA","short_pith_number":"pith:VLT3334P","canonical_record":{"source":{"id":"2308.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-15T14:17:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42e345dc872f8dcb28ae11fa8b2d003bdd7a77d87df900aa3722cbe8bed9d8b5","abstract_canon_sha256":"0bb8e219ae4f2c5cdaa129fa4f988cf55bdc0283ebac398104e51d6c46a590a7"},"schema_version":"1.0"},"canonical_sha256":"aae7bdef8f71cd8b4e5287326021d0501686f5235e1e77a32029910f3480ec84","source":{"kind":"arxiv","id":"2308.07793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07793","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07793v1","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07793","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"VLT3334POHGY","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_16","alias_value":"VLT3334POHGYWTSS","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_8","alias_value":"VLT3334P","created_at":"2026-07-05T06:41:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VLT3334POHGYWTSSQ4ZGAIOQKA","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-15T14:17:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42e345dc872f8dcb28ae11fa8b2d003bdd7a77d87df900aa3722cbe8bed9d8b5","abstract_canon_sha256":"0bb8e219ae4f2c5cdaa129fa4f988cf55bdc0283ebac398104e51d6c46a590a7"},"schema_version":"1.0"},"canonical_sha256":"aae7bdef8f71cd8b4e5287326021d0501686f5235e1e77a32029910f3480ec84","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:31.423000Z","signature_b64":"E3rrlH9dulhcnRzk7j+GbPV9RF4xBNcq5JJA7oITr4dL2aonGVai+Du1fTmJf8ft+Ycf/bIbm0g/xLeQGT2BDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae7bdef8f71cd8b4e5287326021d0501686f5235e1e77a32029910f3480ec84","last_reissued_at":"2026-07-05T06:41:31.422558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:31.422558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07793","source_version":1,"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-07-05T06:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"reLkeAtJSrhNbj3+Iu1lMz0YvM2sAZFNZb7BaggTty6C1wHasgr2qLxpcxza1hpIwqKL7FWjlWXBV4hJ4BUnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:11:38.589220Z"},"content_sha256":"2a359a52f16ab0cf0f87076b7b8af8811371e6369772c86d9f9cc2ee7df6e0d9","schema_version":"1.0","event_id":"sha256:2a359a52f16ab0cf0f87076b7b8af8811371e6369772c86d9f9cc2ee7df6e0d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VLT3334POHGYWTSSQ4ZGAIOQKA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jehoshua Bruck, Jin Sima, Netanel Raviv","submitted_at":"2023-08-15T14:17:35Z","abstract_excerpt":"Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In this paper, we address this problem and present an order-wise optimal construction of codes that are capable of correcting multiple substitution, deletion, and insertion errors for this channel model. The key ingredient in the code construction is a technique we call robust indexing: simultaneously assigning indices to unordered strings (hence, creating orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07793","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07793/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:41:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggYMZjC3zUXEr3TLNkvQxuKcl0D4o12N2Y/+g81m+YJ4z8Ir0Xq135Q66k8zW4hb2eZLF+IgU2GVAZ76rv+VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:11:38.589891Z"},"content_sha256":"df15aa7e7d28099f7f1abdcd06b5a83b1eafafc8ce6049811996fadd0a0559bf","schema_version":"1.0","event_id":"sha256:df15aa7e7d28099f7f1abdcd06b5a83b1eafafc8ce6049811996fadd0a0559bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/bundle.json","state_url":"https://pith.science/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/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-08-14T15:11:38Z","links":{"resolver":"https://pith.science/pith/VLT3334POHGYWTSSQ4ZGAIOQKA","bundle":"https://pith.science/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/bundle.json","state":"https://pith.science/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLT3334POHGYWTSSQ4ZGAIOQKA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VLT3334POHGYWTSSQ4ZGAIOQKA","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":"0bb8e219ae4f2c5cdaa129fa4f988cf55bdc0283ebac398104e51d6c46a590a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-15T14:17:35Z","title_canon_sha256":"42e345dc872f8dcb28ae11fa8b2d003bdd7a77d87df900aa3722cbe8bed9d8b5"},"schema_version":"1.0","source":{"id":"2308.07793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07793","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07793v1","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07793","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_12","alias_value":"VLT3334POHGY","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_16","alias_value":"VLT3334POHGYWTSS","created_at":"2026-07-05T06:41:31Z"},{"alias_kind":"pith_short_8","alias_value":"VLT3334P","created_at":"2026-07-05T06:41:31Z"}],"graph_snapshots":[{"event_id":"sha256:df15aa7e7d28099f7f1abdcd06b5a83b1eafafc8ce6049811996fadd0a0559bf","target":"graph","created_at":"2026-07-05T06:41:31Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.07793/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Encoding data as a set of unordered strings is receiving great attention as it captures one of the basic features of DNA storage systems. However, the challenge of constructing optimal redundancy codes for this channel remained elusive. In this paper, we address this problem and present an order-wise optimal construction of codes that are capable of correcting multiple substitution, deletion, and insertion errors for this channel model. The key ingredient in the code construction is a technique we call robust indexing: simultaneously assigning indices to unordered strings (hence, creating orde","authors_text":"Jehoshua Bruck, Jin Sima, Netanel Raviv","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-15T14:17:35Z","title":"Robust Indexing for the Sliced Channel: Almost Optimal Codes for Substitutions and Deletions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07793","kind":"arxiv","version":1},"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:2a359a52f16ab0cf0f87076b7b8af8811371e6369772c86d9f9cc2ee7df6e0d9","target":"record","created_at":"2026-07-05T06:41:31Z","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":"0bb8e219ae4f2c5cdaa129fa4f988cf55bdc0283ebac398104e51d6c46a590a7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-08-15T14:17:35Z","title_canon_sha256":"42e345dc872f8dcb28ae11fa8b2d003bdd7a77d87df900aa3722cbe8bed9d8b5"},"schema_version":"1.0","source":{"id":"2308.07793","kind":"arxiv","version":1}},"canonical_sha256":"aae7bdef8f71cd8b4e5287326021d0501686f5235e1e77a32029910f3480ec84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aae7bdef8f71cd8b4e5287326021d0501686f5235e1e77a32029910f3480ec84","first_computed_at":"2026-07-05T06:41:31.422558Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:31.422558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E3rrlH9dulhcnRzk7j+GbPV9RF4xBNcq5JJA7oITr4dL2aonGVai+Du1fTmJf8ft+Ycf/bIbm0g/xLeQGT2BDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:31.423000Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a359a52f16ab0cf0f87076b7b8af8811371e6369772c86d9f9cc2ee7df6e0d9","sha256:df15aa7e7d28099f7f1abdcd06b5a83b1eafafc8ce6049811996fadd0a0559bf"],"state_sha256":"48de94729156d9886d05577e61d38243cea22957f0a5dd7ddd3b4898464c1cb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26e97BZysYDIWIwR87yQZoeFKQHM51IsjHgC+BLjwRx6aM8zjAf2+md0zEmDuEv2F7hnxIdzVLF8GJPNdHfgCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:11:38.595923Z","bundle_sha256":"4e57d240bf650b31efcc439fc8a1d1c9e26c13461b31689a8d67887e2b55d96c"}}