{"as_of":"2026-08-10T22:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:957764a023c17564b3f26be245baac54a03f9e92c444669f010272ca19b50828","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-10T06:31:04.303077+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:2c648d0e19a2c3d06d88bf22a53c4e20441f756f7484e97efbe9afaea3dd2276","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:fdfc5e0625f454767d98309a80beaf49677d6b48f66f75ec10f6c7d9b8a21430","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:b461caf96abb578d873cea12bc47221cbf90fd1c97df0c7a25be50e3a47d18e2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:8c7c39f5d263efe8778ab49a617a6a9469a9758670801781eadcc6f56e9a38ba","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:a8629aeeb9d26b5713979971b2c7468c5621586fceb7796e0cc75f059b77aadc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:4e9057b579bae7879871aae78a82bd70d676eed6eb0f82b5f7e03720453517a9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:bbb5fb5c1dfee22ced49d43952b3c6e8997846387ca51f9a91356be5b68ce347","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:93803350482c22c027f56970a03180b41a82271725c4d61b9bb533ebd5b6caf3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:cb84fa03cb051226a395b90d23daab66be455096255a85d053db6ad421097d9c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:d4b56a88be4b478f385b31cdd2dd724cf9ae2da521ffed90611bafb8a9687f42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:be96c732f39c314b4ce01c247b32aef88da81d4c8faa9c75750fd681d6a6d811","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:08f719c5b82641bf99a875895a997845aea1c4131cddf52d4de6048e85f979d3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:783d17901059a015a6a4839771c823a6026dedb926770f780bde109d16389a85","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:9f7e1037dbb4aea4032b0f8e4b7331bf0c068cc2ae4c7ae471b968ea8aa4a445","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:712051c943d2e53828128c9aae06573adf55c0a860d6664c911b541b5d3b61d9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:a924ab61a67ee44e45e93d09afd192b000d1b99b985879798c57078ce5c85dc8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:79df4fd1676dc73cf45c947d1682048b414b24b873d5f8d4e8a1aaf9406cfba1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:ecb9b8a0bb3b3eb88857d375f498fb152c4b053e2fdf266f6ff8005209ba9a90","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:4bdb9010090985e90ab8db18ee3c146a773d34ea927d18ef83873ee752c59f29","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:75c5197a0a5901d4f11cc0b7c29679d1de218463b4470756acf606f654901412","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:8a115022248ca52b67bd9102c94f5d18c5b189a7e1295b10b031cb4a2ae2b044","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:2751b8f52c6b20853e08e69b47d414f91c07f8127e45c01beb908d767e18993d","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:f88b51c9c6d2d2a10ae661ca8ba5c7b289917a32ae3523b9f28f3ba8f4ead4e1","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:63cb2922cd51de9a456286361621f7a0b0d7fa1ba384a372632c29f0344c067f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:945a0bcbbfd892a854c2488c6a8769f125868122df222751bc1b31329459fa11","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:a7a3fada1b98eea1814dff5d1d75ae7c78546f60f4f0a2f53daf26e2c43df984","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:82315376780f3ad6ab5b70bf66a5701ee0f107a2c387a440f425356036ec587e","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:912e555fa60cefd1cccbec3d8a5fb2ba8220bbd2c77f756cda66e9ad23ee5dbc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:65541943e6053442cec42f522c541f899b326a4c699b0d9127eeeb917be69871","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:6cfe448324115fb9097db077c563e9f99943f23581f5b057b95ba0a930d0f354","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:22f9ee7d3e0f9e31607d16c3f57d1f61d3f16d6429e6d83acd2e37f0cb8738dd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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:d4247927decfef1e58ab718e5075ad27357dac9cbce31ffde5fb1ce0e1454090","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2508.19785."}