{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MBFIXP6WZKPEUP4VH6EHT2CZXN","short_pith_number":"pith:MBFIXP6W","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"},"canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","source":{"kind":"arxiv","id":"1908.03996","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03996","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03996v3","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03996","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"MBFIXP6WZKPE","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"MBFIXP6WZKPEUP4V","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"MBFIXP6W","created_at":"2026-07-05T01:34:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MBFIXP6WZKPEUP4VH6EHT2CZXN","target":"record","payload":{"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"},"canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","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"},"source_kind":"arxiv","source_id":"1908.03996","source_version":3,"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-05T01:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iFhbv+cKitlemU1BwjOh9BgInFJ0wD+R1Ds3QqX8QSIJo3hZEKvwttwZESGwb+SX+v7+WXY8D7fNWveJ8tCeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:43.156149Z"},"content_sha256":"1fffb5ec2cdd65af14ec180bde1f90510c01d70fef8be0ad6ee3ff7e180aa123","schema_version":"1.0","event_id":"sha256:1fffb5ec2cdd65af14ec180bde1f90510c01d70fef8be0ad6ee3ff7e180aa123"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MBFIXP6WZKPEUP4VH6EHT2CZXN","target":"graph","payload":{"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"},"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-05T01:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"85R4B1wgTwZ5IU38ejUhELED34VsNh/jwK+828V5YB4szYSwSeZGwVjwh0u0V1RMgRgEJ4juqwwXxLXIhaDVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T22:33:43.156562Z"},"content_sha256":"d806653985a97d45aeac8af9eb1a512f072b285306b13708e87153b4e85b34ce","schema_version":"1.0","event_id":"sha256:d806653985a97d45aeac8af9eb1a512f072b285306b13708e87153b4e85b34ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/bundle.json","state_url":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/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-07-08T22:33:43Z","links":{"resolver":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN","bundle":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/bundle.json","state":"https://pith.science/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBFIXP6WZKPEUP4VH6EHT2CZXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MBFIXP6WZKPEUP4VH6EHT2CZXN","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":"c323138729efdeedc01cd5681be7be8afe1319722631555a00095ac586040c0e","cross_cats_sorted":["cs.CC","cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-12T04:27:12Z","title_canon_sha256":"dc00f706305297d2f6cebe65343294a70afe1c9fc8152b8d23bf50aaaffbd6e9"},"schema_version":"1.0","source":{"id":"1908.03996","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03996","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03996v3","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03996","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"MBFIXP6WZKPE","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_16","alias_value":"MBFIXP6WZKPEUP4V","created_at":"2026-07-05T01:34:49Z"},{"alias_kind":"pith_short_8","alias_value":"MBFIXP6W","created_at":"2026-07-05T01:34:49Z"}],"graph_snapshots":[{"event_id":"sha256:d806653985a97d45aeac8af9eb1a512f072b285306b13708e87153b4e85b34ce","target":"graph","created_at":"2026-07-05T01:34:49Z","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/1908.03996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bruce Spang, Joshua Brakensiek, Ray Li","cross_cats":["cs.CC","cs.DS","math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-12T04:27:12Z","title":"Coded trace reconstruction in a constant number of traces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03996","kind":"arxiv","version":3},"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:1fffb5ec2cdd65af14ec180bde1f90510c01d70fef8be0ad6ee3ff7e180aa123","target":"record","created_at":"2026-07-05T01:34:49Z","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":"c323138729efdeedc01cd5681be7be8afe1319722631555a00095ac586040c0e","cross_cats_sorted":["cs.CC","cs.DS","math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-08-12T04:27:12Z","title_canon_sha256":"dc00f706305297d2f6cebe65343294a70afe1c9fc8152b8d23bf50aaaffbd6e9"},"schema_version":"1.0","source":{"id":"1908.03996","kind":"arxiv","version":3}},"canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"604a8bbfd6ca9e4a3f953f8879e859bb4a5b4a733a7fa4fb77d84a7123f5055f","first_computed_at":"2026-07-05T01:34:49.392303Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:34:49.392303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VWB3mzNAc+RnGesLkurY8pjDlWx4hKvIT08GwKAhpWpd7L7+FoSLMisx1yXKjBHbY3n5+HnJ1lLuPbbo2xLhAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:34:49.392680Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03996","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fffb5ec2cdd65af14ec180bde1f90510c01d70fef8be0ad6ee3ff7e180aa123","sha256:d806653985a97d45aeac8af9eb1a512f072b285306b13708e87153b4e85b34ce"],"state_sha256":"e1cebb531d7ad61481e12c02e1c1c58ab5ec910bd018bd3e116d0d3b46e63089"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFXy4MwGikMhrT7iJCa/EK3IKZGmM9oOj9IRBSq6nyzEiPf/N6NKA31eud/9eH3o/wg78P03UWss+NfWog9WCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T22:33:43.158631Z","bundle_sha256":"48bdf7f982ddbc37920b1bd9d18508e33a7f7ba22f0f196d78c033282dba8577"}}