{"as_of":"2026-07-31T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5947b49545b2f41c39d5aba692ed931b84de53df382c89e5f95de02dde158d76","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T11:19:45.343830Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-31T06:34:12.847434+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/2209.08166/citation-record","integrity":"/paper/2209.08166/integrity","json":"/paper/2209.08166/citation-record.json","paper":"/paper/2209.08166"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Global alignment of molecular sequences via ances- tral state reconstruction","venue":null,"work_id":"bd7ffc2b-8f59-40c1-9df1-21b0b2b20a5d","year":2012},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:bf5409f161d4db9d35bcb6e1d5543669f2b1b4607e250716e4f9f9c912996fbd","observation_id":"5b42bfbd-96d9-49c1-ab56-e431ce557911","resolution":{"observed_at":"2026-05-24T11:26:09.950899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reconstructing strings from random traces","venue":null,"work_id":"02b542d4-3dcc-4b1f-b6a2-67fa92815358","year":2004},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:a80a78c5c5625f453b8b29b0863d4f8c2e4a61e9e78a9758d17dab5c0c0c0435","observation_id":"104657f4-7fa4-427d-9078-67c30e963851","resolution":{"observed_at":"2026-05-24T11:26:09.947384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace reconstruction problems in computational biology","venue":null,"work_id":"b398fbc1-ff2b-4165-bdc3-fd0be6aba3d8","year":2020},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:b13dda88a8fdd1224864481bcd6b5359cec10abe5a136dc8a6d271584d9c19ea","observation_id":"3b076b86-8e55-4229-b422-c9bee8f1e858","resolution":{"observed_at":"2026-05-24T11:26:09.944000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03296","last_updated":"2022-01-11T12:10:13Z","snapshot_observed_at":"2026-07-06T09:53:33.843565Z","submitted_at":"2020-09-07T17:56:08Z","title":"New upper bounds for trace reconstruction","version":3},"cited_work":{"arxiv_id":"2009.03296","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2009.03296","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"New upper bounds for trace reconstruction","venue":null,"work_id":"f9446377-2c39-40ff-9d6c-83f39b90e051","year":2009},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"cited_paper":"/paper/2009.03296","citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:458608e00d0afb184043b77a70cc93a1ff7195e789b1348bb7bb01b817085dc9","observation_id":"be6082d0-ca12-4a0e-827c-5d345e6c09f6","resolution":{"observed_at":"2026-05-24T11:24:24.081625Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"New lower bounds for trace reconstruction","venue":null,"work_id":"abd3cb7c-1de0-4306-947b-1eb3dbb775b3","year":2021},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:b4f16586787d97663eecf1b1c93d9460ccd83430717381085ad98beda484e0db","observation_id":"0b8ff72e-4082-4539-b431-3fc4b2810b96","resolution":{"observed_at":"2026-05-24T11:26:09.940521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal average-case approximate trace reconstruction from few traces","venue":null,"work_id":"efc1d7fc-13b3-47a5-b324-8fcdc2b6232b","year":2022},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:104367cafde0a44e040f5560306076929603998d23c2fcca02d170d8e3a9db35","observation_id":"4fd59357-4bef-490d-959c-a937599e4429","resolution":{"observed_at":"2026-05-24T11:26:09.954751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Coded trace reconstruction","venue":null,"work_id":"185a53a6-aecc-46b4-831a-e3885adb4bd9","year":2020},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:45221c597dd66a7e4c2a2a95133014b7b6b4e8a35a2909dded2238b1cab16815","observation_id":"1880133e-85a3-4cfa-a46c-7f6f47a1e1a4","resolution":{"observed_at":"2026-05-24T11:26:10.006075Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Reconstructing trees from traces","venue":null,"work_id":"07736057-defd-4e21-9de0-0ccd25110424","year":2019},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:f01387d79699129b2bff6400c0c1f1f744ce82781b86464c27a50d04b0b6493d","observation_id":"158c3c48-b177-4dfb-81ef-d1aff879ae4f","resolution":{"observed_at":"2026-05-24T11:26:09.992978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Approximate trace reconstruction: Algorithms","venue":null,"work_id":"afdc4a99-eb89-40bc-ae50-4392f5a69ccf","year":2021},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:20e879b31b529da11a219bc39c1c1558d81b2930059e97ad4ce0fbcb66b0ba36","observation_id":"da4eecda-8da6-490e-a97c-c179a7edc607","resolution":{"observed_at":"2026-05-24T11:26:09.981602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal mean- based algorithms for trace reconstruction","venue":null,"work_id":"3f8ddbb7-0a39-4195-8e4a-d3035fb25376","year":2017},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:d3acab3198b1a7cc8f556a63146d82917d14307155777a6de3490093782fa059","observation_id":"5155ef7b-1b83-46bb-9119-faaa76e50519","resolution":{"observed_at":"2026-05-24T11:26:09.970371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace reconstruction with varying deletion probabilities","venue":null,"work_id":"b93d70f6-d1aa-4353-beb2-6aab4dad678c","year":2018},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:af311be66884ee92d81176ff477a423b78c6243de384d6999923ee169a66a15c","observation_id":"b6221e78-37a9-44ce-9423-40285ee23809","resolution":{"observed_at":"2026-05-24T11:26:09.965470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Lower bounds for trace reconstruction","venue":null,"work_id":"40976452-3a37-407e-a0f0-dbbd80b8a8bf","year":2020},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:af8617e7be52f97058219e9f25785e907bd8fcc035bae5979911df23ca059083","observation_id":"7869c973-d6f2-4edb-9bfc-f2cbd0143d71","resolution":{"observed_at":"2026-05-24T11:26:10.000061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Subpoly- nomial trace reconstruction for random strings and arbitrary deletion probability","venue":null,"work_id":"0ed7defa-9f0a-418c-9af2-cdc3a6bf904b","year":2020},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:bfd642ec03feec0b7f49df7c0d1c4d0d7dfff8b7181f0401ddb229374fd37184","observation_id":"3d661b0c-b889-4038-b947-79c410fc8dc9","resolution":{"observed_at":"2026-05-24T11:26:09.996895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace reconstruction with constant deletion probability and related results","venue":null,"work_id":"d9886368-5684-4c4d-a628-92e90d42b703","year":2008},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:563f895bf2711c2bd261f0acf5b6b77f5674883c2875bdd54738d94b29b8ccef","observation_id":"c7020102-6e0b-4515-80d1-e96117247931","resolution":{"observed_at":"2026-05-24T11:26:09.989061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Capture and translocation characteristics of short branched dna labels in solid-state nanopores","venue":null,"work_id":"08eae0a4-e128-4f0e-a391-456c1a29241e","year":2018},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:b88dee4178491bfee56243dce5dd6ce624ce1ac9e1b1c69f5ef9a70ba597a187","observation_id":"692e5519-ebf8-40af-8880-f903afa77186","resolution":{"observed_at":"2026-05-24T11:26:09.985024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace reconstruction: Generalized and parame- terized","venue":null,"work_id":"c9930554-2e57-4fda-a371-3e8d48e8b67f","year":2021},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:38c2d3f6635ba20e4e1b5bfaaed5a776985f858ddf2f95b60d04b270ec7b8d93","observation_id":"8c1c2dda-f6dc-4b18-b652-c7bfcdcb12fb","resolution":{"observed_at":"2026-05-24T11:26:09.978228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Levenshtein","venue":null,"work_id":"358174b4-f631-4b73-93e1-972714c932b8","year":1997},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:79ecad08666cb5b38c8aec542cef59275313ad06c1c4f05d57469c139d569769","observation_id":"08557a71-b56b-4542-ac0a-646e339f8a51","resolution":{"observed_at":"2026-05-24T11:26:09.974745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace recon- struction revisited","venue":null,"work_id":"7d10cbe9-7383-41af-bacc-cc215d513b77","year":null},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:51bf3eb02628c235fa933fdefc5c2aaf991fe1d0c006edf0cf31d8f8d69f4c60","observation_id":"a1525011-f643-42e2-936b-3e7c76d7a985","resolution":{"observed_at":"2026-05-24T11:26:09.971234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Circular trace reconstruction","venue":null,"work_id":"df3fafe8-1f35-4645-977f-6e4b98de681e","year":2021},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:6db35cb274f0c4e096294b1373d8dcb0003c223828c7df02a508628d2f1a5993","observation_id":"1f278818-d89f-4266-bc7d-d54a406e9ab4","resolution":{"observed_at":"2026-05-24T11:26:09.966701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Trace reconstruction with exp(O(n1/3)) samples","venue":null,"work_id":"6d689a34-8f18-494b-8d45-ee8a3b335ba4","year":2017},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:2f27e35004c2a14c7fea75e6f98c7b9992c6971b5daea8883eb6fd47a0d53437","observation_id":"fa6b1106-28fb-4869-a5cb-5bb1250782e1","resolution":{"observed_at":"2026-05-24T11:26:09.963649Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved string reconstruction over insertion-deletion channels","venue":null,"work_id":"de6468bb-2c31-479a-bb34-b6f71cbb0c88","year":2008},"citing_paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-24T11:19:45.343830Z"},"links":{"citing_paper":"/paper/2209.08166"},"observation_digest":"sha256:755e9331d45935cbec3d7da7fb377464ba090ab80e13ced4224d96a5b7fed410","observation_id":"fcb600da-6fd6-4bf6-a9c0-f69f7edd24b4","resolution":{"observed_at":"2026-05-24T11:26:09.960460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-31T06:34:12.847434+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2209.08166","last_updated":"2022-09-16T20:49:20Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T13:53:13.702355Z","submitted_at":"2022-09-16T20:49:20Z","title":"The trace reconstruction problem for spider graphs"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":20},"total_outbound_references":21},"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-07-31T06:34:12.847434+00:00","source":"crossref"},{"observed_at":"2026-07-31T06:34:08.642788+00:00","source":"retraction_watch"}],"thesis":"As of 31 July 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2209.08166."}