{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:VHOFYGBOVSRURLUEUXKH7WPPYB","short_pith_number":"pith:VHOFYGBO","canonical_record":{"source":{"id":"2411.18765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"4cef80a28aa9d9306c98d6e87a301fa51fbd55c6f3a28bde72ef5ebf5bd12069","abstract_canon_sha256":"11ebd6021eb02fcf959326af4da39459c77e363c089682ccc67caedfa7c0676c"},"schema_version":"1.0"},"canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","source":{"kind":"arxiv","id":"2411.18765","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18765","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18765v1","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18765","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHOFYGBOVSRU","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_16","alias_value":"VHOFYGBOVSRURLUE","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_8","alias_value":"VHOFYGBO","created_at":"2026-07-05T09:41:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:VHOFYGBOVSRURLUEUXKH7WPPYB","target":"record","payload":{"canonical_record":{"source":{"id":"2411.18765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","cross_cats_sorted":[],"title_canon_sha256":"4cef80a28aa9d9306c98d6e87a301fa51fbd55c6f3a28bde72ef5ebf5bd12069","abstract_canon_sha256":"11ebd6021eb02fcf959326af4da39459c77e363c089682ccc67caedfa7c0676c"},"schema_version":"1.0"},"canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:51.237803Z","signature_b64":"a+DSC+8DLXx8E1bL+WRTmxWJTX9VAzbN3cHP7EsZCcj2l2EA/OF/bCHg+OCDQns/GpjTOwSx9k0W8sCkTAwFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","last_reissued_at":"2026-07-05T09:41:51.236937Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:51.236937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.18765","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-05T09:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YYa/QCITVVJZcl/qFACFw2oEl8oYc569SWAukrOTyi1w00coqq0p0NM98PI1daCpYdpIt0pPR7Ln3UO6HCcJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:15:17.384644Z"},"content_sha256":"967d274b5638ad2e92c1455576c77b64853b1f0de29ca34dd32d5d6de3ec8137","schema_version":"1.0","event_id":"sha256:967d274b5638ad2e92c1455576c77b64853b1f0de29ca34dd32d5d6de3ec8137"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:VHOFYGBOVSRURLUEUXKH7WPPYB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Allen Liu, Anders Aamand, Shyam Narayanan","submitted_at":"2024-11-27T21:41:08Z","abstract_excerpt":"In the trace reconstruction problem our goal is to learn an unknown string $x\\in \\{0,1\\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\\delta$ and concatenating the remaining bits. It is a major open question whether the trace reconstruction problem can be solved with a polynomial number of traces when the deletion probability $\\delta$ is constant. The best known upper bound and lower bounds are respectively $\\exp(\\tilde O(n^{1/5}))$ and $\\tilde \\Omega(n^{3/2})$ both by Chase [Cha21b,Cha21a]. Our main result is that if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18765","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/2411.18765/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-05T09:41:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tgJF8hgPO3dpTF/nbz35n/NnGvi0OvGB6FC8yqgh8PWu3ok3XLed/Ibd+DxRQVA8HeckQutX2xpyJ+lUatoDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:15:17.386293Z"},"content_sha256":"3e158201551f6f1304ba63aa1b1cd30c812dfed906d0951b148f0a389c5cb884","schema_version":"1.0","event_id":"sha256:3e158201551f6f1304ba63aa1b1cd30c812dfed906d0951b148f0a389c5cb884"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/bundle.json","state_url":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/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-13T01:15:17Z","links":{"resolver":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB","bundle":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/bundle.json","state":"https://pith.science/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHOFYGBOVSRURLUEUXKH7WPPYB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:VHOFYGBOVSRURLUEUXKH7WPPYB","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":"11ebd6021eb02fcf959326af4da39459c77e363c089682ccc67caedfa7c0676c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","title_canon_sha256":"4cef80a28aa9d9306c98d6e87a301fa51fbd55c6f3a28bde72ef5ebf5bd12069"},"schema_version":"1.0","source":{"id":"2411.18765","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.18765","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"arxiv_version","alias_value":"2411.18765v1","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18765","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_12","alias_value":"VHOFYGBOVSRU","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_16","alias_value":"VHOFYGBOVSRURLUE","created_at":"2026-07-05T09:41:51Z"},{"alias_kind":"pith_short_8","alias_value":"VHOFYGBO","created_at":"2026-07-05T09:41:51Z"}],"graph_snapshots":[{"event_id":"sha256:3e158201551f6f1304ba63aa1b1cd30c812dfed906d0951b148f0a389c5cb884","target":"graph","created_at":"2026-07-05T09:41:51Z","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/2411.18765/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the trace reconstruction problem our goal is to learn an unknown string $x\\in \\{0,1\\}^n$ given independent traces of $x$. A trace is obtained by independently deleting each bit of $x$ with some probability $\\delta$ and concatenating the remaining bits. It is a major open question whether the trace reconstruction problem can be solved with a polynomial number of traces when the deletion probability $\\delta$ is constant. The best known upper bound and lower bounds are respectively $\\exp(\\tilde O(n^{1/5}))$ and $\\tilde \\Omega(n^{3/2})$ both by Chase [Cha21b,Cha21a]. Our main result is that if ","authors_text":"Allen Liu, Anders Aamand, Shyam Narayanan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18765","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:967d274b5638ad2e92c1455576c77b64853b1f0de29ca34dd32d5d6de3ec8137","target":"record","created_at":"2026-07-05T09:41:51Z","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":"11ebd6021eb02fcf959326af4da39459c77e363c089682ccc67caedfa7c0676c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-27T21:41:08Z","title_canon_sha256":"4cef80a28aa9d9306c98d6e87a301fa51fbd55c6f3a28bde72ef5ebf5bd12069"},"schema_version":"1.0","source":{"id":"2411.18765","kind":"arxiv","version":1}},"canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9dc5c182eaca348ae84a5d47fd9efc075cfbd12da29be5870a90736601edc6f","first_computed_at":"2026-07-05T09:41:51.236937Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:51.236937Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a+DSC+8DLXx8E1bL+WRTmxWJTX9VAzbN3cHP7EsZCcj2l2EA/OF/bCHg+OCDQns/GpjTOwSx9k0W8sCkTAwFCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:51.237803Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.18765","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:967d274b5638ad2e92c1455576c77b64853b1f0de29ca34dd32d5d6de3ec8137","sha256:3e158201551f6f1304ba63aa1b1cd30c812dfed906d0951b148f0a389c5cb884"],"state_sha256":"593e7815796c00bd1fcefcef61883182dce705fd1d0e35ae7ce45c7216aed7d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1IuGDyBQRx0z6jSe2k1CsKewTYq4zdiCjdc2RTLWkBl3Fsnn3pgc/PtNjbfsoGyw65CT9H7RFOdJcm0bshzkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:15:17.409177Z","bundle_sha256":"54bab2a3948d2ece7b44528c545e1a209e492d50782cb0709fde419a290dcbe1"}}