{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XBBQGXW7MK6RIIOAR4OJBWKH2S","short_pith_number":"pith:XBBQGXW7","schema_version":"1.0","canonical_sha256":"b843035edf62bd1421c08f1c90d947d4ac35134ebdc06ea8abfb78dc6d07d13f","source":{"kind":"arxiv","id":"2009.01346","version":2},"attestation_state":"computed","paper":{"title":"Circular Trace Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Michael Ren, Shyam Narayanan","submitted_at":"2020-09-02T21:09:55Z","abstract_excerpt":"Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the study of Circular trace reconstruction, where the unknown string $x$ is circular and traces are now rotated by a random cyclic shift. Trace reconstruction is related to many computational biology problems studying DNA, which is a primary motivation for this problem as well, as many types of DNA are known to be circular.\n  Our main results are as follows. First"},"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.01346","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-09-02T21:09:55Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"3815b464d9900c38d899ebefcfcec9b9107dd0269dca2db47e09be6a6ec586fb","abstract_canon_sha256":"e45cde2457a288667888acfe2766718f615aa7184e88c7de4de9a695db99efdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:56.255789Z","signature_b64":"1UGVP+8DmAUyn5QyVnsi+Q4wCW8NrTZSdSiqJ2WIjlakaecap76pAzHxCY/LWuxoMf2C54IC4pl6PCPVIZx2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b843035edf62bd1421c08f1c90d947d4ac35134ebdc06ea8abfb78dc6d07d13f","last_reissued_at":"2026-07-05T01:58:56.255296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:56.255296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular Trace Reconstruction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Michael Ren, Shyam Narayanan","submitted_at":"2020-09-02T21:09:55Z","abstract_excerpt":"Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the study of Circular trace reconstruction, where the unknown string $x$ is circular and traces are now rotated by a random cyclic shift. Trace reconstruction is related to many computational biology problems studying DNA, which is a primary motivation for this problem as well, as many types of DNA are known to be circular.\n  Our main results are as follows. First"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.01346","kind":"arxiv","version":2},"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.01346/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.01346","created_at":"2026-07-05T01:58:56.255361+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.01346v2","created_at":"2026-07-05T01:58:56.255361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.01346","created_at":"2026-07-05T01:58:56.255361+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBBQGXW7MK6R","created_at":"2026-07-05T01:58:56.255361+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBBQGXW7MK6RIIOA","created_at":"2026-07-05T01:58:56.255361+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBBQGXW7","created_at":"2026-07-05T01:58:56.255361+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00674","citing_title":"A Generalized Trace Reconstruction Problem: Recovering a String of Probabilities","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S","json":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S.json","graph_json":"https://pith.science/api/pith-number/XBBQGXW7MK6RIIOAR4OJBWKH2S/graph.json","events_json":"https://pith.science/api/pith-number/XBBQGXW7MK6RIIOAR4OJBWKH2S/events.json","paper":"https://pith.science/paper/XBBQGXW7"},"agent_actions":{"view_html":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S","download_json":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S.json","view_paper":"https://pith.science/paper/XBBQGXW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.01346&json=true","fetch_graph":"https://pith.science/api/pith-number/XBBQGXW7MK6RIIOAR4OJBWKH2S/graph.json","fetch_events":"https://pith.science/api/pith-number/XBBQGXW7MK6RIIOAR4OJBWKH2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S/action/storage_attestation","attest_author":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S/action/author_attestation","sign_citation":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S/action/citation_signature","submit_replication":"https://pith.science/pith/XBBQGXW7MK6RIIOAR4OJBWKH2S/action/replication_record"}},"created_at":"2026-07-05T01:58:56.255361+00:00","updated_at":"2026-07-05T01:58:56.255361+00:00"}