{"as_of":"2026-08-13T08:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:664e806121efe98bcd83e8d9fac68e00181da0dd7542629525a70269d39365f8","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T11:11:11.570916Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.18765/citation-record","integrity":"/paper/2411.18765/integrity","json":"/paper/2411.18765/citation-record.json","paper":"/paper/2411.18765"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:11:12.095545Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"39452791-b255-400b-8097-6277b49d417f","year":2019},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.415136Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:abb02b718f9878dca056ebf49f21c1f6b1d8fdfeaeb0d5d5c7fc0246ea719c1e","observation_id":"b3c5092a-a4dc-4588-9afa-4f82eac2f884","resolution":{"observed_at":"2026-08-12T11:11:12.100362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.079655Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"02a22245-01fb-47e0-918e-e15475f8fd9a","year":2019},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.420388Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:9e40c4a7cff0d700caa3dbc4d888a42ae968c37ab7cb7065f4a89fa5de5f269b","observation_id":"0f4d0a64-e4fb-4022-b089-129da57f47a8","resolution":{"observed_at":"2026-08-12T11:11:12.084680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.065919Z","title":"Reconstructing strings from random traces","venue":null,"work_id":"a63fb049-3947-4bca-be7b-50ef852e7164","year":2004},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.425475Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:600ef1fec30e5b2f73280cfaa28aad58a612cdf202f590744a6c55a5de62c181","observation_id":"d8e0ef8e-d366-4b7e-9de8-491236ee4cb8","resolution":{"observed_at":"2026-08-12T11:11:12.070207Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.051674Z","title":"Coded trace reconstruction in a constant number of traces","venue":null,"work_id":"8c9b9883-5959-4064-b72d-f3dd78378abd","year":2020},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.430116Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:b63ba60ac26baa59bb05310857529c7d14353362315baadd3055563c1832be9f","observation_id":"11fb5a86-2f53-4743-bf10-725701065649","resolution":{"observed_at":"2026-08-12T11:11:12.056024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.036635Z","title":"Approximate trace reconstruction via median string (in average-case)","venue":null,"work_id":"fb4eff6b-c6c9-4944-b61b-c59d604f36b7","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.435212Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:5e0750dcb3442d1753ef668dabdcf6f9ee779b9fc6e7720b42f360863e555d99","observation_id":"b8d9bb27-f246-4762-96b5-c096db81e628","resolution":{"observed_at":"2026-08-12T11:11:12.041522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.020704Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"71f5e034-67d4-4d9a-8af3-1be9d34b0f8b","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.440004Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:e9f2a725d4bb31e5d4b37efbcba7e1e2248cd8888955227c02a6df3abf0a7fd6","observation_id":"c7797e3b-319f-4921-a36a-7edb5d058c14","resolution":{"observed_at":"2026-08-12T11:11:12.025951Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:12.004983Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"785bfeee-bdc1-4267-baab-20ff5a2934ce","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.445279Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:9c10cf5baa62ac942d7419ad803d26b3907944c87375d87405fbcc5df6710924","observation_id":"d204127e-8b0a-4238-8138-180b3dd865dd","resolution":{"observed_at":"2026-08-12T11:11:12.009551Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.989613Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"3762169d-c070-4b94-89d0-596d2fdb377a","year":2022},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.450610Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:102ab10429037b190f8c3571e9e7889672ee1ffd23c49aa4b620bfe1fceb3709","observation_id":"aad11898-bbc2-40bd-b6bd-3e5067259117","resolution":{"observed_at":"2026-08-12T11:11:11.994655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.974224Z","title":"Servedio, and Sandip Sinha","venue":null,"work_id":"0dfdf9f5-085f-41fc-b231-c7e33c734276","year":2023},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.455633Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:bf2343404715c5a9c05e794fc834725c6b4aed9a515e7ee45d9ee0176325bf3d","observation_id":"f93c141e-430d-4a78-9208-380e2a3f5044","resolution":{"observed_at":"2026-08-12T11:11:11.978976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.959474Z","title":"Coded trace reconstruction","venue":null,"work_id":"56d92d91-7540-4f1b-bc27-02c048695d3e","year":2020},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.460526Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:7fa8dc849b4eca347c860622f5bc61edd3720c9a00be0af292808f61273b8a9a","observation_id":"663198c0-a607-47c3-9a2c-953931f3ddc8","resolution":{"observed_at":"2026-08-12T11:11:11.964073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.944815Z","title":"New lower bounds for trace reconstruction","venue":null,"work_id":"d39c7ba5-6019-46fc-90fe-e2fb7da04afa","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.465230Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:f762dea661abbc07ef671508534bb304ddd7b6c4efd31b40e60856e787447a47","observation_id":"3e076219-072b-481d-8c5e-a78324a570b9","resolution":{"observed_at":"2026-08-12T11:11:11.949857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.469845Z","title":"Separating words and trace reconstruction","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.469845Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:4a39610b69d90c701feb281137b8141f7c7e0831618ed775b23b4d9c2bbe72e7","observation_id":"8fd42171-0dd2-4c08-9a84-f2a4090ebc14","resolution":{"observed_at":"2026-08-12T11:11:11.469845Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06454","last_updated":"2021-07-14T02:21:35Z","snapshot_observed_at":"2026-08-13T07:15:31.117827Z","submitted_at":"2021-07-14T02:21:35Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06454","snapshot_observed_at":"2026-08-12T11:11:11.474788Z","title":"Approximate trace reconstruction of random strings from a constant number of traces","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.474788Z"},"links":{"cited_paper":"/paper/2107.06454","citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:3ea358c37d08c007dcbc5c3077f0a8107bfbdedf5ccd23ba1b013ff07107a3bf","observation_id":"cdd5e733-2cc1-4fde-83fe-4d27c2289cd1","resolution":{"observed_at":"2026-08-12T11:11:11.474788Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:11:11.922322Z","title":"Servedio","venue":null,"work_id":"45903936-a65f-4f02-8fc7-bc58383f548f","year":2019},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.479575Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:d37be50ec10de1da94ca8cbb0911f8546be573fbf78b2b9682d5cfa1329b43e7","observation_id":"7c5e5db7-1477-466f-bc36-9339a1e0a404","resolution":{"observed_at":"2026-08-12T11:11:11.926197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.908149Z","title":"Reconstructing trees from traces","venue":null,"work_id":"ca8dd172-ed2a-4199-abdb-878d094d26f3","year":2019},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.484016Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:71e4e23449c0d53e7403a8a662dec5c0228414b3a85d0184fd9de41cd8d3131c","observation_id":"0e01cd18-24b5-4553-9a21-c85ff18ce470","resolution":{"observed_at":"2026-08-12T11:11:11.912688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.893826Z","title":"R \\' a cz, Benjamin G","venue":null,"work_id":"1e5154a0-876a-4f89-b032-ee0e69d977ee","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.487919Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:5f50fabaf8e39c6c20413c1f6d016f5aeb3e724bc9acb1ccfded38ad1f9a2dc5","observation_id":"976365e2-f4bd-430e-a544-4942d84eca05","resolution":{"observed_at":"2026-08-12T11:11:11.898410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.879269Z","title":"Trace reconstruction with varying deletion probabilities","venue":null,"work_id":"b06f713e-c9e2-4db3-9576-822aabcb1d62","year":2018},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.492194Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:49a77b55fca3a2dfa644232eb1c0899659945d1ff5887ba0b0d60e7869a83ef9","observation_id":"6d2c8239-3286-4183-b480-4b0390deb5a1","resolution":{"observed_at":"2026-08-12T11:11:11.883766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.863925Z","title":"Lower bounds for trace reconstruction","venue":null,"work_id":"fa4fe09f-2968-48a8-9f81-513a012d629b","year":2020},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.496323Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:65f77315f6ffbe4289014b7c101c6336ce5f26e0d717920094c780940afab928","observation_id":"b02a7c21-f9b4-4c10-a04b-1b858b4d6150","resolution":{"observed_at":"2026-08-12T11:11:11.868947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.848959Z","title":"Trace reconstruction with constant deletion probability and related results","venue":null,"work_id":"d7b495f4-e93e-4931-b541-9b23e01c9b15","year":2008},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.500377Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:573d9ac07b6c928012e4192a44b56fb4b283cb8db309b8f80682997d9e484779","observation_id":"07ed5570-9205-443e-ad4e-503b423090f1","resolution":{"observed_at":"2026-08-12T11:11:11.854034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.833906Z","title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","venue":null,"work_id":"36e9445d-220d-4293-b329-8a87d865b777","year":2018},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.504460Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:c4300cdfd41d3b49e021253a13f89bfe2575348e1aae168ccfae985a8b9fbe35","observation_id":"aeb9c9a5-32af-4361-8da9-7589277ba6ee","resolution":{"observed_at":"2026-08-12T11:11:11.838612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.819615Z","title":"More on reconstructing strings from random traces: insertions and deletions","venue":null,"work_id":"a9a1f0e7-dc6b-4f73-abe6-949cf1fd5010","year":2005},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.509720Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:7edd87b4a6daa79d5f7ab6fc6ad02e5c6b0e802845c48c8b6b07bf50baf2addb","observation_id":"d24f7143-0b52-445a-aee8-0e9fc13b09dd","resolution":{"observed_at":"2026-08-12T11:11:11.824091Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.805899Z","title":"Trace reconstruction: Generalized and parameterized","venue":null,"work_id":"0fff19f3-e6b0-45e3-9224-2fe71b49567d","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.514222Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:94c757fb7cb53084b4e3f7d2246f39ec1954705f61f32cf4b88032681d3733d0","observation_id":"caf15692-8d44-4cd8-8a12-e1840c9b137b","resolution":{"observed_at":"2026-08-12T11:11:11.810069Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.792605Z","title":"Levenshtein","venue":null,"work_id":"c7ee24da-bad2-4254-89b2-36043f56fd75","year":2001},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.518763Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:66d45841050ffda28f0db6b887ce4ac25913a286350a367e7323db7a5b6833c4","observation_id":"d497c533-4552-4a11-8428-03332d80ecf7","resolution":{"observed_at":"2026-08-12T11:11:11.796600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.778363Z","title":"Levenshtein","venue":null,"work_id":"34a77e1f-6833-4122-ae2f-66883a30d249","year":2001},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.523032Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:4ec377f3d46348a30743e3ad1f6389a9e077dc0c7a40ae89e5ca0766e39ab457","observation_id":"7a0279b5-2d7e-4501-844a-9355c6b1a19c","resolution":{"observed_at":"2026-08-12T11:11:11.782767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.763215Z","title":"Trace reconstruction revisited","venue":null,"work_id":"ceff6b7e-b8fb-43ca-9ff9-9bac87be2b88","year":2014},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.527951Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:80fc64705061a03086ac1624bfc4f0de795b26714b25ddc3e2615f8160aecd3e","observation_id":"f89c991d-cbbd-4f8f-8100-80bb0e6db8fe","resolution":{"observed_at":"2026-08-12T11:11:11.767765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.748757Z","title":"Graph reconstruction from random subgraphs","venue":null,"work_id":"08494bd4-5fd2-44ea-a602-e4b613eae371","year":2022},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.533077Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:9b2e5b15912908714c34d6ca25e4b11bd3e6eb180dbf341ec34a1c1e85a627b4","observation_id":"b04b5bec-98ec-4c43-a6c4-707bd08438a8","resolution":{"observed_at":"2026-08-12T11:11:11.753341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.04261","last_updated":"2025-07-31T16:15:12Z","snapshot_observed_at":"2026-08-13T07:15:39.850502Z","submitted_at":"2024-05-07T12:21:42Z","title":"Graph Reconstruction from Noisy Random Subgraphs","version":2},"cited_work":{"arxiv_id":"2405.04261","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.04261","snapshot_observed_at":"2026-08-12T11:11:11.606319Z","title":"Graph Reconstruction from Noisy Random Subgraphs","venue":"cs.IT","work_id":"2f3c6359-79d3-43be-8414-f6371fbf7e34","year":2024},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.537583Z"},"links":{"cited_paper":"/paper/2405.04261","citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:86c9a6c7ec321873017163d9c52f21da168405e921f391596d3519b9e0086b0a","observation_id":"afb373e0-bc0e-463a-ac46-7447849ec69e","resolution":{"observed_at":"2026-08-12T11:11:11.613631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.732994Z","title":"Improved algorithms for population recovery from the deletion channel","venue":null,"work_id":"0c606ccf-c29e-445c-910f-ad688301c8d9","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.542308Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:02b340348ef7b1c9c6d80d7e51c70b053b4a873e9df5b970579e554fc8a50c25","observation_id":"4e46b0c2-029e-4cd6-94f0-d0e095c5203d","resolution":{"observed_at":"2026-08-12T11:11:11.738502Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.717150Z","title":"Trace reconstruction with exp(o(n\\( ^ 1/3 \\))) samples","venue":null,"work_id":"2debe911-af4f-4dd1-b150-8376d100aa87","year":2017},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.547599Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:ba27b447394e67907395daf61f2ffcf2ab8ce6f88854ab66eaf7dbe70987781e","observation_id":"caa52861-f7fb-4d7e-9a07-76fcee6022d2","resolution":{"observed_at":"2026-08-12T11:11:11.722715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.701313Z","title":"Circular trace reconstruction","venue":null,"work_id":"b37aa551-7d8b-4024-8e71-14aee879b069","year":2021},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.552231Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:2493621a1b29224e6cf07c4d62267d1d155e39f36a0d2a402b64f0b6aeee068f","observation_id":"de8cc298-7527-4f8d-bc19-438cd64b7292","resolution":{"observed_at":"2026-08-12T11:11:11.706023Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.686117Z","title":"Average-case reconstruction for the deletion channel: Subpolynomially many traces suffice","venue":null,"work_id":"bc739d9c-5cc4-4a85-9b91-18f2df457f31","year":2017},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.556721Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:1cac2408437469f753dd735776d11b0af8aa5d3ed0a5ea1292aa575ed707aa46","observation_id":"c0d3cd91-1698-4dcb-ae6c-717845902999","resolution":{"observed_at":"2026-08-12T11:11:11.691006Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.670947Z","title":"Average-case to (shifted) worst-case reduction for the trace reconstruction problem","venue":null,"work_id":"2bfcc62f-1fd8-4f56-adb9-6cb23020e758","year":2023},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.561253Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:6153590938d28105770c3559659da5d98090c71c2f6269f026800fc96152af63","observation_id":"741592d1-757d-41b4-af00-e4160c41f9e2","resolution":{"observed_at":"2026-08-12T11:11:11.675392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.656586Z","title":"The trace reconstruction problem for spider graphs","venue":null,"work_id":"a6914fd8-6229-4fec-a9b5-c916fefe0265","year":2023},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.566514Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:db2839b1da8460005e32215f4f5cc478b1463bc3c2e7f0627fe7e9813ade318d","observation_id":"973efa45-2688-4f15-9a36-6535ec933794","resolution":{"observed_at":"2026-08-12T11:11:11.661300Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T11:11:11.641931Z","title":"Improved string reconstruction over insertion-deletion channels","venue":null,"work_id":"17a150b7-449f-4370-a20c-ea9556f93908","year":2008},"citing_paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T11:11:11.570916Z"},"links":{"citing_paper":"/paper/2411.18765"},"observation_digest":"sha256:41b9be5a930880cd789d1df88f58b712d11c8f7dff9cbf1410bd0413f37e228d","observation_id":"ea3371d1-c172-4cef-aebd-e9b479fe8cde","resolution":{"observed_at":"2026-08-12T11:11:11.646701Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.18765","last_updated":"2024-11-27T21:41:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T10:52:32.481344Z","submitted_at":"2024-11-27T21:41:08Z","title":"Near-Optimal Trace Reconstruction for Mildly Separated Strings"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":31},"total_outbound_references":34},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2411.18765."}