{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MBFIXP6WZKPEUP4VH6EHT2CZXN","short_pith_number":"pith:MBFIXP6W","schema_version":"1.0","canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","source":{"kind":"arxiv","id":"1908.03996","version":3},"attestation_state":"computed","paper":{"title":"Coded trace reconstruction in a constant number of traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruce Spang, Joshua Brakensiek, Ray Li","submitted_at":"2019-08-12T04:27:12Z","abstract_excerpt":"The coded trace reconstruction problem asks to construct a code $C\\subset \\{0,1\\}^n$ such that any $x\\in C$ is recoverable from independent outputs (\"traces\") of $x$ from a binary deletion channel (BDC). We present binary codes of rate $1-\\varepsilon$ that are efficiently recoverable from ${\\exp(O_q(\\log^{1/3}(\\frac{1}{\\varepsilon})))}$ (a constant independent of $n$) traces of a $\\operatorname{BDC}_q$ for any constant deletion probability $q\\in(0,1)$. We also show that, for rate $1-\\varepsilon$ binary codes, $\\tilde \\Omega(\\log^{5/2}(1/\\varepsilon))$ traces are required. The results follow fr"},"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":"1908.03996","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-12T04:27:12Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO","math.IT"],"title_canon_sha256":"dc00f706305297d2f6cebe65343294a70afe1c9fc8152b8d23bf50aaaffbd6e9","abstract_canon_sha256":"c323138729efdeedc01cd5681be7be8afe1319722631555a00095ac586040c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:34:49.392680Z","signature_b64":"VWB3mzNAc+RnGesLkurY8pjDlWx4hKvIT08GwKAhpWpd7L7+FoSLMisx1yXKjBHbY3n5+HnJ1lLuPbbo2xLhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","last_reissued_at":"2026-07-05T01:34:49.392303Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:34:49.392303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coded trace reconstruction in a constant number of traces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Bruce Spang, Joshua Brakensiek, Ray Li","submitted_at":"2019-08-12T04:27:12Z","abstract_excerpt":"The coded trace reconstruction problem asks to construct a code $C\\subset \\{0,1\\}^n$ such that any $x\\in C$ is recoverable from independent outputs (\"traces\") of $x$ from a binary deletion channel (BDC). We present binary codes of rate $1-\\varepsilon$ that are efficiently recoverable from ${\\exp(O_q(\\log^{1/3}(\\frac{1}{\\varepsilon})))}$ (a constant independent of $n$) traces of a $\\operatorname{BDC}_q$ for any constant deletion probability $q\\in(0,1)$. We also show that, for rate $1-\\varepsilon$ binary codes, $\\tilde \\Omega(\\log^{5/2}(1/\\varepsilon))$ traces are required. The results follow fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03996","kind":"arxiv","version":3},"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/1908.03996/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":"1908.03996","created_at":"2026-07-05T01:34:49.392375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03996v3","created_at":"2026-07-05T01:34:49.392375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03996","created_at":"2026-07-05T01:34:49.392375+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBFIXP6WZKPE","created_at":"2026-07-05T01:34:49.392375+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBFIXP6WZKPEUP4V","created_at":"2026-07-05T01:34:49.392375+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBFIXP6W","created_at":"2026-07-05T01:34:49.392375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28802","citing_title":"Salami Slicing Trellis for Synchronization Errors in DNA Coding","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN","json":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN.json","graph_json":"https://pith.science/api/pith-number/MBFIXP6WZKPEUP4VH6EHT2CZXN/graph.json","events_json":"https://pith.science/api/pith-number/MBFIXP6WZKPEUP4VH6EHT2CZXN/events.json","paper":"https://pith.science/paper/MBFIXP6W"},"agent_actions":{"view_html":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN","download_json":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN.json","view_paper":"https://pith.science/paper/MBFIXP6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03996&json=true","fetch_graph":"https://pith.science/api/pith-number/MBFIXP6WZKPEUP4VH6EHT2CZXN/graph.json","fetch_events":"https://pith.science/api/pith-number/MBFIXP6WZKPEUP4VH6EHT2CZXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/action/storage_attestation","attest_author":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/action/author_attestation","sign_citation":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/action/citation_signature","submit_replication":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/action/replication_record"}},"created_at":"2026-07-05T01:34:49.392375+00:00","updated_at":"2026-07-05T01:34:49.392375+00:00"}