{"as_of":"2026-08-08T00:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:402a2fd5293e093a03eb0c44cbfa640389f82af90cdfedd933e51d9ad2a02ff1","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-05T15:39:02.301927Z","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-07T06:34:17.273281+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/2508.19785/citation-record","integrity":"/paper/2508.19785/integrity","json":"/paper/2508.19785/citation-record.json","paper":"/paper/2508.19785"},"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-05T15:39:02.713817Z","title":null,"venue":null,"work_id":"ecf9bfce-1b34-498a-8f95-75af40000d48","year":2021},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.207781Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:4eb701c6b90631d7d4eb0721a4a52efaf9c77b077ea538891b7a83cbd206b394","observation_id":"3f5cfa7b-1917-43db-8cc5-a84ab0953d69","resolution":{"observed_at":"2026-08-05T15:39:02.716361Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.706873Z","title":null,"venue":null,"work_id":"414f3660-dbdb-472e-9266-be20b45fc6de","year":2008},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.211493Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:ff39dbb8adb50e890ce2282dd4a470825708a8e6d6c897e2e17bd50b9c0c09b8","observation_id":"727aed97-9613-4d1e-999a-b7d79d16b36c","resolution":{"observed_at":"2026-08-05T15:39:02.709220Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.699720Z","title":null,"venue":null,"work_id":"9ae0e42a-af0d-48ca-99b0-4e3cd6b89f2b","year":2016},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.214485Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:aaed85a18664f23f04509370ed7f318126f36e7dcdd8e97b328fe4de4b459ae0","observation_id":"03d8ae4c-1763-4536-bcfc-733413e489f2","resolution":{"observed_at":"2026-08-05T15:39:02.702136Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.693190Z","title":null,"venue":null,"work_id":"f1f7713d-857a-47f7-b8e3-2618a7974c74","year":2006},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.218286Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:861b8594ee407a62a86533da0d39582a505d269080e0e091fc9397eaf0f6c227","observation_id":"90524bbd-f261-48bc-b771-da525952715f","resolution":{"observed_at":"2026-08-05T15:39:02.695618Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.686970Z","title":null,"venue":null,"work_id":"e564e43f-a06c-47d1-a44c-0ad06059abde","year":2009},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.221591Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:a11cec5a921af603c04cdce5862b2b961d74b8d4f92e51a558703e2b932abd22","observation_id":"4619fb43-c3bd-44e0-bdd2-65f2400a9173","resolution":{"observed_at":"2026-08-05T15:39:02.689119Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.678909Z","title":null,"venue":null,"work_id":"026aa22d-a772-4ef1-b3a8-964956715133","year":2008},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.224390Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:a25c2cd210383a096990db34537c68dbce7d74eb7328d4c1bcb1df624fb20652","observation_id":"db1e4ed1-acad-4fde-a6fb-4b628990e035","resolution":{"observed_at":"2026-08-05T15:39:02.682324Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.668611Z","title":null,"venue":null,"work_id":"0b53f10a-039f-4605-81d9-a4aad0ee83aa","year":2023},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.227370Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:02073433a210e9ea394cc22badfe757ac37a616cad97a15e8f705f5884967dba","observation_id":"de92f22b-3fe9-4b0d-8284-8273c71c6927","resolution":{"observed_at":"2026-08-05T15:39:02.673096Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.660240Z","title":null,"venue":null,"work_id":"a0f2a5a4-c067-483c-acd2-77b3c9ed71bd","year":2021},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.230757Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:d1291d744ba93d73b14506776a5725a3103ed750a9d47dfc3a067fa9baefb9c6","observation_id":"f05231ea-a60d-4559-a77c-e3896f05c244","resolution":{"observed_at":"2026-08-05T15:39:02.662643Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.652164Z","title":"Matthew Weinberg","venue":null,"work_id":"08ecf3df-f116-4510-8522-33dfa1c6cf0d","year":2016},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.233132Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:7dd53d0395aeef510c3eadab4e24d58a6b167dd8d2f400fac16e2c1cf060b234","observation_id":"986e5fd9-bc06-49b5-a6c4-489ddfcfb6f8","resolution":{"observed_at":"2026-08-05T15:39:02.654990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.643628Z","title":null,"venue":null,"work_id":"3e50cb9b-37e9-4164-8474-c72b9908c08f","year":2008},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.235538Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:c59225f6f1f666a68e530650a78cc468ea7482bd9b107ebb33df1e707ed3e026","observation_id":"01f41b54-ae21-49d8-8d82-e9f62b00454a","resolution":{"observed_at":"2026-08-05T15:39:02.646976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.636427Z","title":null,"venue":null,"work_id":"d4c421ed-b2f3-4804-a466-dd2272cd3bf0","year":2011},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.237928Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:4b24e1038a43c1c3a62e347ad4759c96ccd9d223b16cf4d3efbb1d84527a8881","observation_id":"ad966d77-a78d-40e7-be07-b8de43d6346b","resolution":{"observed_at":"2026-08-05T15:39:02.639167Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.629197Z","title":null,"venue":null,"work_id":"e40e3ea7-bfc7-4c32-849e-f806e522794a","year":2007},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.240292Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:2709b2f05833dc761d981186fac68c2d5bb54dda2a35762eac9ad98d8bfca803","observation_id":"1c647938-f3df-43bc-ad1c-fdb555f515be","resolution":{"observed_at":"2026-08-05T15:39:02.631897Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.621127Z","title":null,"venue":null,"work_id":"e47b718b-fa88-4382-9ac0-51f71d91c1d4","year":2013},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.243011Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:c240051e7d41260c086be629b2f35965054b1e12e42da8ee9fb557db7894f3a1","observation_id":"d037af20-49a5-49c4-a0d7-ac29ab66273d","resolution":{"observed_at":"2026-08-05T15:39:02.624301Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.613400Z","title":null,"venue":null,"work_id":"c638d546-307a-4fbf-b21e-1842ee7789e8","year":2016},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.245367Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:0583ee5ce250bc33c5c07648a3791128315e7df0f293718c9409a3828ccfb855","observation_id":"6f6ebdc8-5992-4d16-a2f1-c1ea6bd47e22","resolution":{"observed_at":"2026-08-05T15:39:02.616407Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.606107Z","title":null,"venue":null,"work_id":"fab1c410-eb9d-4de5-a180-b64661a591e2","year":1994},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.248683Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:19dc17e3e0231c994f886f53690cc6651df4f3463f1cb1072da96814fe2c31fb","observation_id":"e9176505-f3e5-4100-8bf2-91a6487f0a41","resolution":{"observed_at":"2026-08-05T15:39:02.608828Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.597033Z","title":null,"venue":null,"work_id":"a8d13f15-5a5c-4948-b358-dd01d71cf7a9","year":1957},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.251407Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:d73fad4e7739e781c965753d9213a791b25ee56a7a6b3f962cf6cf8c54355543","observation_id":"c7d66407-6b27-44dc-8a37-70a728336eef","resolution":{"observed_at":"2026-08-05T15:39:02.599891Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.588832Z","title":null,"venue":null,"work_id":"3236cbf8-bcac-4f73-89b6-0116c94430e1","year":2017},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.253799Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:200bac36da3bad8c4c22ca2556b16773323cc27ada3cb26a56535e7e41ca5c3a","observation_id":"8280c8fe-e229-462c-a743-4a25e11aae0b","resolution":{"observed_at":"2026-08-05T15:39:02.591588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.581409Z","title":null,"venue":null,"work_id":"5d57acb8-2fe9-4457-bf63-11c8dc5544b0","year":2019},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.256998Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:a26521cea14dec5edb9df414d2b239d946b10624b9e8aa26ebd526d5a1016530","observation_id":"651fff9a-0bab-4732-858f-addb00306fee","resolution":{"observed_at":"2026-08-05T15:39:02.583880Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.574342Z","title":null,"venue":null,"work_id":"b73c443d-1efb-4c07-96f9-fc5dd0770586","year":2020},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.260025Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:7b1bb034ad933c033481e183b4a7bbfd5a7cbe8ee8665c199b74e86f76d88331","observation_id":"4927767c-104e-4a8f-9075-1524efe912d8","resolution":{"observed_at":"2026-08-05T15:39:02.576858Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.567077Z","title":null,"venue":null,"work_id":"6099aa61-eed8-4f5e-b03b-0e3c5a0594c7","year":2023},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.262478Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:627dce0f2a295b4ee4b53ca589b0b0459aeb8f206ac9bb999a1f8b1af5623c07","observation_id":"63de8833-2f58-4139-ac11-7d3b752912ef","resolution":{"observed_at":"2026-08-05T15:39:02.569750Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.559906Z","title":null,"venue":null,"work_id":"0c20a1b7-83db-4eca-8a68-3065ee56dc43","year":2020},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.265498Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:0731b5512c263da85d46dc6c8490ef5c5a8a6c23d24a70860f973a4c7d478a26","observation_id":"4228728f-fa4b-4f4e-9930-d86ff2c5ac52","resolution":{"observed_at":"2026-08-05T15:39:02.562257Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.552786Z","title":null,"venue":null,"work_id":"bbd1aa21-b1a4-4cb3-87fa-acdf5a7675ac","year":2007},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.268838Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:313b78ad6cae1c27523dfc42badf105b876320f6700b5553ab459dcca17b0543","observation_id":"bdcd1fac-3702-48c6-88a7-12f68469f39e","resolution":{"observed_at":"2026-08-05T15:39:02.555248Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.545342Z","title":"Woodruff","venue":null,"work_id":"6ca2203f-94ec-441d-92c8-b87cd320a0ed","year":2011},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.271524Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:c382302b5b3fc7fa0405703ea5716365cf5e1a51fcc08b730c66e38a59ffaf86","observation_id":"f86f4459-21aa-4e6f-a316-6c1332bde726","resolution":{"observed_at":"2026-08-05T15:39:02.548100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"oclc/3128984","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T15:39:02.475540Z","title":null,"venue":null,"work_id":"8b7c82b0-8e5d-49ca-8e72-eb0b3f342482","year":1998},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.274313Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:1100b96fba2c96a4a5a44623ac5a41cb84fce9262b08ea033e4132906a6b343f","observation_id":"86f11eaf-d355-4cb9-8c7c-82346a03bfe2","resolution":{"observed_at":"2026-08-05T15:39:02.479162Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.277129Z","title":"Spielman, Alexander S","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.277129Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:d3ef960464b2102fb83aafb3f4af8cd83b09cf3c881427203ef0e173b192834d","observation_id":"a8bbde07-1314-4edc-ac74-a16fb87671a7","resolution":{"observed_at":"2026-08-05T15:39:02.277129Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.16597","last_updated":"2024-07-23T15:59:52Z","snapshot_observed_at":"2026-07-06T18:50:48.181248Z","submitted_at":"2024-07-23T15:59:52Z","title":"Inference of rankings planted in random tournaments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.16597","snapshot_observed_at":"2026-08-05T15:39:02.279525Z","title":"Spielman, and Xifan Yu","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.279525Z"},"links":{"cited_paper":"/paper/2407.16597","citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:78a934c8d93625db06896dd9380b1e17f2efe09d6779a336479818d05f887008","observation_id":"dc55b2c4-1f46-4ec3-ba4b-77bdc6c969a5","resolution":{"observed_at":"2026-08-05T15:39:02.279525Z","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-05T15:39:02.537167Z","title":null,"venue":null,"work_id":"fc7481c2-74c2-4ee7-8f98-ff333219b6d3","year":2002},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.282352Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:a9e92baf224338a84388413cc0ffdb844447d37fe46cdde9bd375e5cec3ca1be","observation_id":"ca2b9210-561e-43ee-b925-ef83b3ae1f26","resolution":{"observed_at":"2026-08-05T15:39:02.540028Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.528868Z","title":null,"venue":null,"work_id":"c9a25c36-45a0-4977-b309-6d7ba24182ec","year":1961},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.284582Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:7c2b6c96bcfb052a9cde607dedfc823cc1098c3b93a07472ad67acf76a9a7ba6","observation_id":"7fc6ced7-50b6-479f-b9fa-ba6c70d1c18c","resolution":{"observed_at":"2026-08-05T15:39:02.531449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.519043Z","title":"Rivest, Albert R","venue":null,"work_id":"8e06c80a-62ef-44a7-bcb1-6bfa064f1559","year":1980},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.287124Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:68388689ef3f4e2484aeb278dd0a8690093aab2bdaca39e2f941ebe82b5fcf5f","observation_id":"5f44bf8d-0302-4563-8925-58302c1d5f7e","resolution":{"observed_at":"2026-08-05T15:39:02.521707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.5939","last_updated":"2013-11-23T00:46:49Z","snapshot_observed_at":"2026-07-06T03:29:01.255297Z","submitted_at":"2013-11-23T00:46:49Z","title":"Hypergeometric tail inequalities: ending the insanity","version":1},"cited_work":{"arxiv_id":"1311.5939","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.5939","snapshot_observed_at":"2026-08-05T15:39:02.328815Z","title":"Hypergeometric tail inequalities: ending the insanity","venue":"math.PR","work_id":"e3493698-3c2d-423c-9a29-6f2ad7a7bcd2","year":2013},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.289568Z"},"links":{"cited_paper":"/paper/1311.5939","citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:a27465bc432efeda36ae2dc87144679bed6f0d96b417d076a8a3ad04b9476d4f","observation_id":"2d4a7fe2-67d0-4c0f-a0e8-70a49e7e7cbf","resolution":{"observed_at":"2026-08-05T15:39:02.333326Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.511101Z","title":null,"venue":null,"work_id":"7c833743-db2c-436c-bedc-6026d0875efe","year":1976},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.292161Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:240c3de8b1e90dea65ac434dcabb8938129af23843ffa82e1598fc2b182876bb","observation_id":"f6e20bdc-5d03-43b3-94c3-db01966ca344","resolution":{"observed_at":"2026-08-05T15:39:02.513640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.501792Z","title":"Otherwise, when𝐵 contains at leastℎ elements, the algorithm returns a subset of sizeℎ that is recursively sampled from𝐵 (notice that it might be |𝐵| =ℎ)","venue":null,"work_id":"aaa28163-71ca-4c26-9e4b-5e3f278432bb","year":null},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.295202Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:ebec6ff3b8b2e1cd7136c8b058c98eec9572cb2eb6d4467c670821edce7d0987","observation_id":"bf3fe7f9-f2f0-459c-9ce1-d03021cac227","resolution":{"observed_at":"2026-08-05T15:39:02.505018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.494000Z","title":"Hence, with probability at least 1− 22 √ 𝑁 log𝑁 , there are at most log𝑁 such groups and the size of𝐴′ in the first call of the𝑖-th such group is at most( 1 2)𝑖−1( √ 𝑁+ 1)","venue":null,"work_id":"b799d585-f6e5-40d2-bef9-db8a7c51fe28","year":null},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.298947Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:68f324db8329ab64f2a48fb2e34f324147722135d9873afb7888762b007b9fe3","observation_id":"983a3178-b799-4fca-a6e9-b66abc818fec","resolution":{"observed_at":"2026-08-05T15:39:02.496793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-05T15:39:02.485295Z","title":null,"venue":null,"work_id":"12482793-62cb-4b39-9653-95363461ce56","year":null},"citing_paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T15:39:02.301927Z"},"links":{"citing_paper":"/paper/2508.19785"},"observation_digest":"sha256:b9582dfab40f65ee61fe068eae9bfb30ca019644d1f53b88d08db8ca7c717321","observation_id":"a423a8be-f23e-43a8-a963-9b8826c35ecc","resolution":{"observed_at":"2026-08-05T15:39:02.487932Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.19785","last_updated":"2025-08-27T11:06:36Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-05T15:39:00.718125Z","submitted_at":"2025-08-27T11:06:36Z","title":"An Optimal Sorting Algorithm for Persistent Random Comparison Faults"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":2,"verified_fuzzy":5},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2508.19785."}