{"as_of":"2026-08-17T23:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:30d469a437e5d09fc2f30fd2bf6d76cb0e1a78f64b2eeab466b351ac1d93fa69","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T21:53:21.297372Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.04073/citation-record","integrity":"/paper/2607.04073/integrity","json":"/paper/2607.04073/citation-record.json","paper":"/paper/2607.04073"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Indiana University mathematics journal , pages=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:d539cf4478373c1c1c977f551f4ef91e6525e34a644b96e0f8650a83a5196ef5","observation_id":"f88308cc-5eb0-4a05-a300-fd97f9b5ae58","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/rsa.20182","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Random Structures & Algorithms , volume =","venue":"Random Structures and Algorithms","work_id":"bbb8cd87-88fd-4e3f-9a96-354409e4c125","year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:234dcb1c30165f1fe2c971e9319bee6743b760f9c2d308e99652ea9b0b3a05e4","observation_id":"c64c0bb3-cae9-4aa0-a204-6df6b831e665","resolution":{"observed_at":"2026-07-11T21:58:19.242714Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-12T14:49:15.599274+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T14:49:15.599274+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Theory of Computing Systems , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:947e8badee4ac1d3c35921aa25127d22f01e14b827f2cdb751af8ec6c104cb26","observation_id":"f333c948-4d5d-4320-b1ce-c939b6f196f7","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"1990 , isbn =","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:823c0b697edb8b47cdf667153d444b617640df7765589f3997742b4cc41cbb1e","observation_id":"8f6d2459-c35a-4f15-bd5f-4ec659c7a155","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"SIAM Journal on Mathematics of Data Science , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:7b185b373ef4ddf019cc67bba69ade4818322a9e15427fc5838791d6c83fbb74","observation_id":"a5f52eef-5fac-446a-9274-204a582f1c74","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Applied and Computational Harmonic Analysis , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:767565fc1cd8dd8b4f85fbfcfb4376b71c0727804b25c363ad7db1b9e8150fd1","observation_id":"e9ed6072-7441-46d5-bc28-ab0715236869","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:d76c26942d29ec002486744ca1bd52bd6174472601ac9e8894817e7e31065595","observation_id":"78a58629-c489-4c8e-871e-ef41b40ac97b","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms , pages =","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:c67e8b898eb3c774b28ea3a7622ab932c8653959d15522ffc5f659c1893640e1","observation_id":"afc67c13-8641-4b22-8229-52511229eaae","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"and Sinha, Sandip , booktitle=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:7f4758af197ebc8c11981c44bdc883826b033fbc05f0b65cf65e6ca08e360a27","observation_id":"f258b069-401f-4fb9-a55c-dd9577bb414c","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Mathematical Statistics and Learning , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:db7f381bb32ec7fffd5e3d7830599f9a2d40e056dd544893eab5598871eadcd8","observation_id":"f4661819-c797-49a2-af66-6e32a82f0560","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0004972700011515","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bulletin of the Australian Mathematical Society , author=","venue":"Bulletin of the Australian Mathematical Society","work_id":"bbc70540-b014-4f16-a170-e8e5a249b916","year":1983},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:38da2482ca433d8221e5cba1971ab439f3e43cc9a09a59067a84489be79a0b7b","observation_id":"65de5db1-dc56-42d1-b699-f3dd31cb6347","resolution":{"observed_at":"2026-07-11T21:58:19.259672Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-12T14:49:16.111438+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T14:49:16.111438+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"12th Innovations in Theoretical Computer Science Conference (ITCS 2021) , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:7a32cc824653e3b1af3b4e84bc9da88949f9107ad9bc5ed2f8ab42f67143bd82","observation_id":"68d66489-1e32-4f38-9d4b-58d64220f2d2","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:2f547c1b1041c702e2e349367239789cea60b0603915638cbca046f1df38e744","observation_id":"dd73748b-685f-4897-8767-e2cc7ffd04a3","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages =","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:1258011f928e0fd96d11e092a9dc786a6d2a8a82c41b2da5bd31617184387ba2","observation_id":"a173f3ec-f077-41be-8202-7930da06136b","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Annales de l’Institut Henri Poincar","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:b891a9f01abe58104a581adc539b70c6edd0e57b2df989932922e8ffea7063fe","observation_id":"5be13a4f-65da-4c81-9aef-ce5c21cd532b","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:a1973a69d0d56f0cd1dcc2c20a292a8be4c1969f17af79ece6a761ad45480add","observation_id":"62ae7323-ffd6-486c-a069-2615176e0020","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:735d6b6c17eb8fddb542008d24f82dd82eab83d059170936b153a8b8f58077cc","observation_id":"31137225-3712-46ba-aa25-9a98acdf00d5","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:f08322e2a9bf2d83f2b4c87e2fe912104dc6bd87e7621825fc16e92cb21bac87","observation_id":"379ac5bc-6f44-4ad4-a8ab-d9e6720d18f8","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"IEEE Transactions on Information Theory , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:201ea583c3bcbccdcb8fa24a3e36c25097a7bbb4af21debf5524a7b2fda604dc","observation_id":"bd7d7c8c-6f67-48e2-b6e5-1fa09d82279e","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:539c58fe03699c2493157a33b66ea0df85a178a9f34e2fd313f2fd70d48dac89","observation_id":"6be42d65-df81-4d19-b8a3-dab5f3c19275","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) , pages =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:326686db452ee93d747311a44d46c282ba8cec05611f16f7c194ed3aeee527fe","observation_id":"16ba7c36-e228-435c-adcd-0cf79450dfae","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Knuth , journal =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:8bd254a0926c3b9a3a2eb5d8fea7b108cde67752f333d6e99e8ba85bcdfb95fa","observation_id":"b7e9eb77-5927-4278-acb5-d9f8692b2da0","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Trace Reconstruction with Constant Deletion Probability and Related Results , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:7c9d7591d24b58ed0086b6fa47698e1ecc927b0a948aaf90f823770a2ae26aa0","observation_id":"8851eef9-3128-4ea7-83be-45d50ed0a18d","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"The Annals of Applied Probability , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:8aff03a5054f9edd44ee14497a3248acc408182b5f6bbb0d2891cee86a7fa247","observation_id":"b078e0da-1613-45b9-b871-99e74ea4ff9e","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:31bb71fa5f7f2285ff28fda2b9a5ed4169ab0379677364f9b54d4ef0f97459ac","observation_id":"c4b626b1-0242-4232-b77f-199d05856a6c","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"2020 , month = apr, journal =","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:2ee10c2f87d5915080518b411fff43c7b1e484a0cf35d7bbeb759bf37f65c036","observation_id":"d5d50318-7eeb-4d23-927f-7f86adb06026","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Average-","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:ecd816f8bd35befedddd8fb987df4dc725ad4689016c98313f48cce95505875c","observation_id":"8abc378e-55d8-405d-b294-e965d42c5d7d","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"On k -Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:8d1dc5ce7206ac3925ba53299aef037570f4edbb077794f0bc4a559874a90cea","observation_id":"770b3aab-dfb7-4828-8412-38373521d155","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing , pages =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:6900ab1e11c4614d381384072908088bb8919a07e0f7ea6ff10503524d19bf23","observation_id":"c56ac56a-335c-4c88-aed6-b6c4148236b4","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"IEEE Transactions on Information Theory , author =","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:e64b96c22fe6c31fbd2134e54c4bb18780b69345fd0ab27d570727e74ac2b362","observation_id":"54d36d41-a286-4e76-9a1e-cd64491bf673","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Trace Reconstruction with Bounded Edit Distance , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:b6c120cd64b85ad161fb71374ab25d692e9b2fb0064efef6901d5eb13da8e282","observation_id":"9c711a64-1992-4744-a7f3-915a3a387136","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":", title =","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:7bc922fc1c257f4dbbb6f5e40b653e428283d9ec49c5dd8462e1f51663299410","observation_id":"b86ecf79-92f8-48f3-93b0-89b8bcfe765a","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"17th Innovations in Theoretical Computer Science Conference (ITCS 2026) , pages =","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:c0e404b0cbcf8b78efd9ee1aea9f6c296e9f633b70f495b89809a46d765f3a6a","observation_id":"829c2378-0b24-415d-ab00-7af67729f656","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:de9317055887c0beeacbc4c2a493399f654cf33a2af54b49815aa94b543fde19","observation_id":"3a3ab0e8-ef98-46da-8723-372e5d147013","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"Subpolynomial trace reconstruction for random strings","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:3ebb00c346793ab78a7044fbff9244b5d5b08b23aecd3bbf9be9c0add56a213b","observation_id":"310e775f-3d6b-414a-8042-2d2f637b7566","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:53:21.297372Z","title":"and Schiffer, Benjamin G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:41cc474e7a843a426dd9d55966f4e7d57f602b96101007fdae76ce12ddd53f1a","observation_id":"bf3291a3-e81a-485f-a5c3-259fb68b654b","resolution":{"observed_at":"2026-07-11T21:53:21.297372Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Sinha, Sandip , month = jan, year =","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"1ed38cad-f3b5-4328-846f-a85fb249b498","year":2023},"citing_paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-07-11T21:53:21.297372Z"},"links":{"citing_paper":"/paper/2607.04073"},"observation_digest":"sha256:b47181845eeb7f4bc5e2ca49d111dad9cb453e74fb232b2c5b4dbf0e16f66b52","observation_id":"d153db93-fb9a-4dee-9782-2f43e2310df2","resolution":{"observed_at":"2026-07-11T21:58:19.266793Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-07-12T14:49:16.847214+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T14:49:16.847214+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.04073","last_updated":"2026-07-05T01:33:16Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T23:59:13.882792Z","submitted_at":"2026-07-05T01:33:16Z","title":"Quasipolynomial Trace Reconstruction"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2607.04073."}