{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QHOEQL5UASJPIQJEGO5P46ZDQF","short_pith_number":"pith:QHOEQL5U","schema_version":"1.0","canonical_sha256":"81dc482fb40492f4412433bafe7b238146ecb57b8fec8dcb2306a05b5099ef18","source":{"kind":"arxiv","id":"2009.03296","version":3},"attestation_state":"computed","paper":{"title":"New upper bounds for trace reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.PR","authors_text":"Zachary Chase","submitted_at":"2020-09-07T17:56:08Z","abstract_excerpt":"We show that any $n$-bit string can be recovered with high probability from $\\exp(\\widetilde{O}(n^{1/5}))$ independent random subsequences."},"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":"2009.03296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2020-09-07T17:56:08Z","cross_cats_sorted":["cs.IT","math.CO","math.IT"],"title_canon_sha256":"3aa889b9d079a647959338986af18b4a12767c75f65dfdec0b311204dbde3939","abstract_canon_sha256":"e984ccc25159a51157e98f737c8430370a02f341bb58df12e2fc20416a42340f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:47:13.085303Z","signature_b64":"kSIZpZ9cNOBRJUKiwO2k4e+1764h/FybjBmrbQ7nqauJEIoNjR3u4d3AXdiDSEjG9SlYSXbPhpHtNtF8OZ5WAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81dc482fb40492f4412433bafe7b238146ecb57b8fec8dcb2306a05b5099ef18","last_reissued_at":"2026-07-05T03:47:13.084879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:47:13.084879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New upper bounds for trace reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.CO","math.IT"],"primary_cat":"math.PR","authors_text":"Zachary Chase","submitted_at":"2020-09-07T17:56:08Z","abstract_excerpt":"We show that any $n$-bit string can be recovered with high probability from $\\exp(\\widetilde{O}(n^{1/5}))$ independent random subsequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.03296","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/2009.03296/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":"2009.03296","created_at":"2026-07-05T03:47:13.084935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.03296v3","created_at":"2026-07-05T03:47:13.084935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.03296","created_at":"2026-07-05T03:47:13.084935+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHOEQL5UASJP","created_at":"2026-07-05T03:47:13.084935+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHOEQL5UASJPIQJE","created_at":"2026-07-05T03:47:13.084935+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHOEQL5U","created_at":"2026-07-05T03:47:13.084935+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2209.08166","citing_title":"The trace reconstruction problem for spider graphs","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF","json":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF.json","graph_json":"https://pith.science/api/pith-number/QHOEQL5UASJPIQJEGO5P46ZDQF/graph.json","events_json":"https://pith.science/api/pith-number/QHOEQL5UASJPIQJEGO5P46ZDQF/events.json","paper":"https://pith.science/paper/QHOEQL5U"},"agent_actions":{"view_html":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF","download_json":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF.json","view_paper":"https://pith.science/paper/QHOEQL5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.03296&json=true","fetch_graph":"https://pith.science/api/pith-number/QHOEQL5UASJPIQJEGO5P46ZDQF/graph.json","fetch_events":"https://pith.science/api/pith-number/QHOEQL5UASJPIQJEGO5P46ZDQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF/action/storage_attestation","attest_author":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF/action/author_attestation","sign_citation":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF/action/citation_signature","submit_replication":"https://pith.science/pith/QHOEQL5UASJPIQJEGO5P46ZDQF/action/replication_record"}},"created_at":"2026-07-05T03:47:13.084935+00:00","updated_at":"2026-07-05T03:47:13.084935+00:00"}