{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:T6VAMTNNBMY6L52TYEUBBQANB2","short_pith_number":"pith:T6VAMTNN","schema_version":"1.0","canonical_sha256":"9faa064dad0b31e5f753c12810c00d0ea7c7fcf85c9641505c571072690a06da","source":{"kind":"arxiv","id":"2506.18878","version":1},"attestation_state":"computed","paper":{"title":"Oblivious Deletion Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Roni Con","submitted_at":"2025-06-23T17:49:56Z","abstract_excerpt":"We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between the adversarial and random error models, and are motivated by applications like DNA storage, where the noise is caused by hard-to-model physical phenomena, but not by an adversary.\n  (1) (Explicit oblivious) We construct $t$ oblivious deletion codes, with redundancy $\\sim 2t\\log n$, matching the existential bound for adversarial deletions.\n  (2) (List decoding implies explicit oblivious) We show that explicit list-d"},"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":"2506.18878","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-06-23T17:49:56Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"6bf7c1126237ec87533aa1217aa35da82b2f23e96321f392560505aab13d1990","abstract_canon_sha256":"0a49f7bbbe466a0ba659e4db909b6bd634876a948573b3c7bbcca6a468d6e91c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:57.371737Z","signature_b64":"JTt5XAJ15HYiUzikpwjkB2tHitEYkjIespxwYNiaXwoetIgcvQ1ex01IBdZFtTriodqTMXYHvhexwLtzqVj7CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9faa064dad0b31e5f753c12810c00d0ea7c7fcf85c9641505c571072690a06da","last_reissued_at":"2026-07-05T11:25:57.371362Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:57.371362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oblivious Deletion Codes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Ray Li, Roni Con","submitted_at":"2025-06-23T17:49:56Z","abstract_excerpt":"We construct deletion error-correcting codes in the oblivious model, where errors are adversarial but oblivious to the encoder's randomness. Oblivious errors bridge the gap between the adversarial and random error models, and are motivated by applications like DNA storage, where the noise is caused by hard-to-model physical phenomena, but not by an adversary.\n  (1) (Explicit oblivious) We construct $t$ oblivious deletion codes, with redundancy $\\sim 2t\\log n$, matching the existential bound for adversarial deletions.\n  (2) (List decoding implies explicit oblivious) We show that explicit list-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18878","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/2506.18878/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.18878","created_at":"2026-07-05T11:25:57.371417+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.18878v1","created_at":"2026-07-05T11:25:57.371417+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18878","created_at":"2026-07-05T11:25:57.371417+00:00"},{"alias_kind":"pith_short_12","alias_value":"T6VAMTNNBMY6","created_at":"2026-07-05T11:25:57.371417+00:00"},{"alias_kind":"pith_short_16","alias_value":"T6VAMTNNBMY6L52T","created_at":"2026-07-05T11:25:57.371417+00:00"},{"alias_kind":"pith_short_8","alias_value":"T6VAMTNN","created_at":"2026-07-05T11:25:57.371417+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/T6VAMTNNBMY6L52TYEUBBQANB2","json":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2.json","graph_json":"https://pith.science/api/pith-number/T6VAMTNNBMY6L52TYEUBBQANB2/graph.json","events_json":"https://pith.science/api/pith-number/T6VAMTNNBMY6L52TYEUBBQANB2/events.json","paper":"https://pith.science/paper/T6VAMTNN"},"agent_actions":{"view_html":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2","download_json":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2.json","view_paper":"https://pith.science/paper/T6VAMTNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.18878&json=true","fetch_graph":"https://pith.science/api/pith-number/T6VAMTNNBMY6L52TYEUBBQANB2/graph.json","fetch_events":"https://pith.science/api/pith-number/T6VAMTNNBMY6L52TYEUBBQANB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2/action/storage_attestation","attest_author":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2/action/author_attestation","sign_citation":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2/action/citation_signature","submit_replication":"https://pith.science/pith/T6VAMTNNBMY6L52TYEUBBQANB2/action/replication_record"}},"created_at":"2026-07-05T11:25:57.371417+00:00","updated_at":"2026-07-05T11:25:57.371417+00:00"}