{"as_of":"2026-08-07T21:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f98bc32b2250f045a0133716169b16f714f24379c1418f0d60de33327d2ba3fc","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T16:30:50.345393Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"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/2507.13994/citation-record","integrity":"/paper/2507.13994/integrity","json":"/paper/2507.13994/citation-record.json","paper":"/paper/2507.13994"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0020-0190(76)90071-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.455986Z","title":"An almost optimal algorithm for unbounded searching","venue":null,"work_id":"c983a8fb-eb12-47d1-8de4-e5916c12a59c","year":1976},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:45.859714Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:e92a083101af383c428e0e36464412056c6dcc05ff194e463dbe9d7815fc353f","observation_id":"840885aa-f22e-4ac6-8f9a-c8af4e0808c9","resolution":{"observed_at":"2026-08-06T16:30:52.458804Z","resolver_source":"doi","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":"10.1017/cbo9780511662041.009","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.447453Z","title":null,"venue":null,"work_id":"538f6b67-f173-4584-8942-9fcb835d228c","year":1992},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:45.922850Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:1ffbaf49d6e64501cc2aa30d06dfd2fdff0818f4d33e296a177437ad8bd22879","observation_id":"cd97cea7-7a94-4741-8a0e-434acc8581eb","resolution":{"observed_at":"2026-08-06T16:30:52.450219Z","resolver_source":"doi","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":"10.1007/978-1-4613-8369-7_1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.439032Z","title":null,"venue":null,"work_id":"d44611c7-4f67-457d-852d-f71d516f79ff","year":1993},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.036307Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:dab8432de4cbf55fefc58c8e0b534eb2370aa1ddf9440cefd03ffe04dbad294e","observation_id":"178f4424-986c-41e0-99b6-3952657dbbfd","resolution":{"observed_at":"2026-08-06T16:30:52.441728Z","resolver_source":"doi","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-06T16:30:46.222562Z","title":null,"venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.222562Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:b84727de468ee7c36efaaf38de2971807e9e73752e52e3e0c592525df3e1477f","observation_id":"ddb36408-86ca-4826-9e3f-ba481d3d2a39","resolution":{"observed_at":"2026-08-06T16:30:46.222562Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:46.444003Z","title":"Brightwell","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.444003Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:6fe1f79ad2e543ba5728e435040a1dcd21f48e949167af772e148f391f5fa2a6","observation_id":"cc5b4e66-03c2-4688-8d21-3be421ab7a5f","resolution":{"observed_at":"2026-08-06T16:30:46.444003Z","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":"2123.32212","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:53.096321Z","title":"Brown and Robert Endre Tarjan","venue":null,"work_id":"f68614c8-a3df-4dae-ab1a-acad1678cbb1","year":1979},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.550943Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:453cdbef207cedc77d98f51ca916cfe19448e07d8507b2b2f9cdc90e9620f6b8","observation_id":"3293bef4-89b3-4a63-b12f-36a3c28a1f4e","resolution":{"observed_at":"2026-08-06T16:30:53.101420Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-06T16:30:46.709201Z","title":"e l Joret, Rapha \\","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.709201Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:a3fd76bb6ad9ffeb86e2927b381fd0926add3a25c7a18d5e57a2b340f852779e","observation_id":"50883c60-f2a3-4d0a-bedd-220567fd159d","resolution":{"observed_at":"2026-08-06T16:30:46.709201Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s0304-3975(03)00221-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.419402Z","title":"Chandran, L","venue":null,"work_id":"12e312b5-71de-4b69-8987-b896d8db5721","year":2003},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:46.866888Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:55158e420952db25a997a4d48fe9556376087c0e7980a8a83b3e829d8b717630","observation_id":"1f6f1807-18bb-45df-9e0a-b20db3112c71","resolution":{"observed_at":"2026-08-06T16:30:52.422669Z","resolver_source":"doi","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":"10.1016/0095-8956(87)90007-4","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.410822Z","title":"A circuit set characterization of antimatroids","venue":null,"work_id":"3aad065c-af4e-48a8-b577-0f7967adc77d","year":1987},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.043210Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:3dd215e2ace5916c5b7f15179cf67adcb0a09543381686ab66c0dcf4dc53458d","observation_id":"026ffaaf-ad7e-4940-bc94-7097ad22fcf6","resolution":{"observed_at":"2026-08-06T16:30:52.413854Z","resolver_source":"doi","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":"10.1007/978-1-4899-3558-8_10","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.401536Z","title":null,"venue":null,"work_id":"81d2694a-4300-49df-aa9e-40ff93ab1959","year":1940},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.210848Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:85ed7101f6e08c490e4b43de016a9e6729424a7261b41823ded5bbbfd2a407d7","observation_id":"4b7aff71-11e5-483a-87ff-e0dcca5522a7","resolution":{"observed_at":"2026-08-06T16:30:52.405002Z","resolver_source":"doi","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":"10.1007/s11083-013-9289-1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.392465Z","title":"Antimatroids and balanced pairs","venue":null,"work_id":"de887ac2-6dc0-4611-a3d1-9c9b2ef91185","year":2014},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.389208Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:58f913d10bbf793b6e98dde751f2241fc33a43008e655640f9eee2b9f33cee60","observation_id":"0301b36c-5d65-4bf4-ad3f-8891cde50730","resolution":{"observed_at":"2026-08-06T16:30:52.395605Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[{"edge_observation":{"observed_at":"2026-08-06T18:20:20.625352+00:00","source":"paper_reference_links","state":"open"},"event_date":"2014-10-02","event_type":"correction","notice_doi":"10.1007/s11083-014-9335-7","provenance":{"observed_at":"2026-07-11T03:02:18.625612+00:00","source":"crossref","source_record_id":"10.1007/s11083-014-9335-7->10.1007/s11083-013-9289-1:correction"}}],"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-06T16:30:47.517119Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.517119Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:80aeb8d9d268461b1cf073e1903ee16af756465fca2a30c9d7468291abb7891d","observation_id":"ff4a416d-7cc4-4c89-9a08-b66c196edc55","resolution":{"observed_at":"2026-08-06T16:30:47.517119Z","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-06T16:30:53.136820Z","title":"The pairing heap: A new form of self-adjusting heap","venue":null,"work_id":"b06708de-5eb6-4b80-859b-ab908f9084ed","year":1986},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.652832Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:ae3a44761de4ab52b072e1c91ba86b427cf52a01350f5fec6cd9d4e86b7796f0","observation_id":"3ccdc177-9315-4573-8c72-4c0dbe117608","resolution":{"observed_at":"2026-08-06T16:30:53.139425Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:47.852547Z","title":"Fredman and Dan E","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:47.852547Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:550e05d8a2bdb66db9e17b4404440262270bdbb8995fe4673753019a8dbe8c89","observation_id":"e48170a5-fc08-4032-bb3f-3c2b99c27d3b","resolution":{"observed_at":"2026-08-06T16:30:47.852547Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977561.ch16","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.371822Z","title":"Nebel, Benjamin Smith, and Sebastian Wild","venue":null,"work_id":"298ce538-d485-4b47-8ab2-9317eed9de4b","year":2023},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.003360Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:36c6923c943ecb486faaea404a364515a2815d439823ec562cffbb597700efb3","observation_id":"90890a95-3279-4742-8163-f7b2f7638a84","resolution":{"observed_at":"2026-08-06T16:30:52.374969Z","resolver_source":"doi","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":{"arxiv_id":"2404.04552","last_updated":"2026-05-05T13:29:15Z","snapshot_observed_at":"2026-08-07T03:01:03.342224Z","submitted_at":"2024-04-06T08:29:44Z","title":"Fast and Simple Sorting Using Partial Information","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.04552","snapshot_observed_at":"2026-08-06T16:30:48.240055Z","title":"Fast and simple sorting using partial information, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.240055Z"},"links":{"cited_paper":"/paper/2404.04552","citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:d090383e8c9f133bac3d0fc315a8d8c959f8de2b3396587313f4ecda36e783bc","observation_id":"0b015d23-0477-4a38-8578-d18ec1973cbe","resolution":{"observed_at":"2026-08-06T16:30:48.240055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:48.348970Z","title":"Tarjan, and Jakub Tětek","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.348970Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:753f5b4a7360d133070b2d1168e2df8f243da4b2eccd4e6e467f884ae20268bc","observation_id":"960c31ed-7edf-4d4d-9876-db972d68e11f","resolution":{"observed_at":"2026-08-06T16:30:48.348970Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.jalgor.2003.09.001","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.270668Z","title":"D eterministic sorting in O(n n) time and linear space","venue":null,"work_id":"46470fd5-79c1-4c60-81b3-01c1cd231a3e","year":2004},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.432986Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:2fad17163aa65b1c72255fe10dd5634535a41b4370a3f551e8bd068c9bcab5c6","observation_id":"b536a9c3-853a-477c-a2b8-b9e481062196","resolution":{"observed_at":"2026-08-06T16:30:52.343259Z","resolver_source":"doi","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":{"arxiv_id":"2002.11818","last_updated":"2020-03-17T18:25:36Z","snapshot_observed_at":"2026-07-06T09:00:26.490403Z","submitted_at":"2020-02-26T22:04:43Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3","version":2},"cited_work":{"arxiv_id":"2002.11818","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.11818","snapshot_observed_at":"2026-08-06T16:30:52.789022Z","title":"Finding large matchings in 1-planar graphs of minimum degree 3","venue":"cs.CG","work_id":"8fbabc5b-b7b1-41ec-afd1-19b1b830c1fc","year":2020},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.517134Z"},"links":{"cited_paper":"/paper/2002.11818","citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:938a29873fc54629fb96df92d094f25e5b6f3edf610a4477354b40326a9273bc","observation_id":"925bea06-3b28-48b5-94d7-d7d233d09bd5","resolution":{"observed_at":"2026-08-06T16:30:52.837651Z","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":"10.1137/0201004","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.046105Z","title":"Hwang and Shen Lin","venue":null,"work_id":"61a9dfc7-3ed9-468d-931d-42c7be45110c","year":1972},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.626906Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:9ea78587f8bb3d13d7d9f4217b06eeb24693d7abc57719e8ef72d94badfe09f5","observation_id":"aeb95cec-0568-4156-8088-22e8d7895ebd","resolution":{"observed_at":"2026-08-06T16:30:52.128184Z","resolver_source":"doi","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-06T16:30:48.713633Z","title":null,"venue":null,"work_id":null,"year":1962},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.713633Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:ff9d18587eb11d6450782d7bb2c219d5b2e7d697d9160281f5fbb4b736dfb307","observation_id":"1b9344d2-0adf-4a19-a407-32048b95e6dc","resolution":{"observed_at":"2026-08-06T16:30:48.713633Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:48.804053Z","title":"Entropy and sorting","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.804053Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:7fd646ca9b0ce874719485a462dfb99333f67a6a3d0b82fa31e798ef0c228dc9","observation_id":"261d4610-46e1-4cc9-b1c0-cf3fb767dffb","resolution":{"observed_at":"2026-08-06T16:30:48.804053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:48.914823Z","title":"Kirkpatrick and Raimund Seidel","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:48.914823Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:5c4ee3ff357917d87f5724b77458fd7a4e28bf563c4d18930761422e9dcc98a0","observation_id":"60cbdcb5-7f8f-4aa1-9130-736c1fea5101","resolution":{"observed_at":"2026-08-06T16:30:48.914823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01111312","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:51.849057Z","title":null,"venue":null,"work_id":"6203fc7f-c0ff-4a31-b20c-993881e572f4","year":1968},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.002277Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:0379d837b5a66e9813da7886563caec9326c02c97c8163f119545c51a40106bf","observation_id":"5ef1571c-9929-4835-87b7-591ba7585c21","resolution":{"observed_at":"2026-08-06T16:30:51.990473Z","resolver_source":"doi","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-06T16:30:49.086526Z","title":"Finding and counting small induced subgraphs efficiently","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.086526Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:0b3991609690391eafaeab2b62bab7fef8ae2167dc2032128a4966fe67220817","observation_id":"09d9a3b8-94c2-489f-b55f-d5d0afd5ac56","resolution":{"observed_at":"2026-08-06T16:30:49.086526Z","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-06T16:30:53.128198Z","title":null,"venue":null,"work_id":"2db4ff3c-3702-4a7a-b573-d72907da7719","year":1968},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.183349Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:6ce59c8490fd014ec0e77de694d897799c8874c40057cef87237c3e70cb78d68","observation_id":"0b00796f-8ae5-482b-bff8-abc069a3aadd","resolution":{"observed_at":"2026-08-06T16:30:53.131561Z","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-06T16:30:53.118790Z","title":null,"venue":null,"work_id":"be8c34df-8f52-4ae2-aabb-1fe292883846","year":1973},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.271926Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:653625d8da8dfa3b62885a6133bc37bfdab5831db0368ca8f0fa2fbfe105d9a8","observation_id":"df905de5-9d89-477f-b174-ea1a084afb71","resolution":{"observed_at":"2026-08-06T16:30:53.122298Z","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":"10.1007/3-540-10854-8_22","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:51.665329Z","title":"Korte and L","venue":null,"work_id":"705750eb-497c-4f74-9507-2922976a1c36","year":1981},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.383340Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:e78036adabf51cfc9db9150ccfa26555c6c312306400469600c6509d9de699a6","observation_id":"48753692-4fd0-4c7f-b61b-97fcc14f61e1","resolution":{"observed_at":"2026-08-06T16:30:51.699089Z","resolver_source":"doi","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":"10.1016/b978-0-12-566780-7.50019-2","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:51.427763Z","title":"Greedoids - a structural framework for the greedy algorithm","venue":null,"work_id":"02537f50-2566-4382-abca-d298c1a84988","year":1984},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.474547Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:ac6e0b1b545ede267114bd0fce96247109fb4c52a528ae82bc96c14a7fda3a14","observation_id":"e0bcf78f-fef3-4463-af60-785cf042b16a","resolution":{"observed_at":"2026-08-06T16:30:51.542582Z","resolver_source":"doi","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":"10.1007/978-3-642-58191-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:51.211942Z","title":"Greedoids","venue":null,"work_id":"4ae0c79c-5757-48c7-bb36-52cdf9d48000","year":1991},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.566189Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:077f6a3e5de62e713d9d3fe27779429bdeef135876f3081083316727539fbc03","observation_id":"2602d3f9-7a59-4d45-98f6-b622028dc06a","resolution":{"observed_at":"2026-08-06T16:30:51.308615Z","resolver_source":"doi","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":"10.1016/j.tcs.2011.12.006","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:50.948376Z","title":"Soulignac, and Jayme Luiz Szwarcfiter","venue":null,"work_id":"f1cf6f0e-f82e-487c-8e7d-8465f0415557","year":2012},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.646216Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:c4cc78de8bb78f7d0c91a568d5beec1f47f17074f5c5e1aae41c7f1d9b0e1517","observation_id":"62cbb2dc-3abb-43bb-bbec-b55fc1495860","resolution":{"observed_at":"2026-08-06T16:30:51.087186Z","resolver_source":"doi","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-06T16:30:49.767507Z","title":"The information-theoretic bound is good for merging","venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.767507Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:1291f5eaa769961e13e33e15122e1972fd6950f5317a11e2f56f21a23d9479a7","observation_id":"57a63a25-0f70-49bb-8a2d-6142b605909c","resolution":{"observed_at":"2026-08-06T16:30:49.767507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11049-015-9297-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:50.710288Z","title":"OT grammars, beyond partial orders: ERC sets and antimatroids","venue":null,"work_id":"cf46cc8f-4655-412a-96e7-86b53b73fc8c","year":2015},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:49.866532Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:112a68f1476b62db26a5273690fc05c7e8c4c5ba901ea511ba7aa0c6434c2bd9","observation_id":"3c5b6a0d-95c6-4488-933c-a802303a363a","resolution":{"observed_at":"2026-08-06T16:30:50.797157Z","resolver_source":"doi","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":"10.1002/9780470756171.ch1","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:50.513138Z","title":"Optimality theory: Constraint interaction in generative grammar","venue":null,"work_id":"eb40741d-99c0-435f-9165-8d58607d0ebb","year":2004},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.040236Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:925b4cc062fee5967f6ee6fafc29f0adc9a60dd476e686c5882e39660a86ea30","observation_id":"d6273f1e-75c0-4c8d-9d64-ba038cfc65ea","resolution":{"observed_at":"2026-08-06T16:30:50.604905Z","resolver_source":"doi","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-06T16:30:50.106119Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.106119Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:9f20c8f169376a5ee92b43f0c0c3cdf05cb24b00fbf80925ba8d0baae053f88b","observation_id":"d6a712b4-c8b3-4f03-8437-32721289e68a","resolution":{"observed_at":"2026-08-06T16:30:50.106119Z","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":"2504.17327","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:52.514296Z","title":"Simple universally optimal dijkstra, 2025","venue":null,"work_id":"023d48af-698c-43c4-8b3a-83e5407aeca5","year":2025},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.197060Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:06c587ec18b6aa99d7385d4d1802fb53d94254b4e86a7e82ddfcded5fbea299e","observation_id":"0c397986-6fd2-45f9-be9b-1ce9c9c5620f","resolution":{"observed_at":"2026-08-06T16:30:52.585992Z","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-06T16:30:50.283483Z","title":"Simpler optimal sorting from a directed acyclic graph","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.283483Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:9308765fd8dd7b720cbab4b7c9c6474ebbeabba5bfdf361f4644c062087a75c1","observation_id":"a6cbddf7-8c39-4d78-acf0-630fe6bb3f35","resolution":{"observed_at":"2026-08-06T16:30:50.283483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T16:30:50.339414Z","title":"Tight bounds for sorting under partial information","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.339414Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:9825ae79eef05729bf3e9e1e0fee5577fc4a62f8ea0c3f8428e17b4de609e3e8","observation_id":"99afa880-3bae-493d-8d8b-d3f11d010aef","resolution":{"observed_at":"2026-08-06T16:30:50.339414Z","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-06T16:30:53.108688Z","title":null,"venue":null,"work_id":"47f73484-2e82-4e52-a320-a11dad125ea3","year":1964},"citing_paper":{"arxiv_id":"2507.13994","last_updated":"2025-07-18T15:02:46Z","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T16:30:50.345393Z"},"links":{"citing_paper":"/paper/2507.13994"},"observation_digest":"sha256:fc1ce849b9940fab3d95c877d42abcf4077d8a20cb429797df7e133867a0bed2","observation_id":"91d48d08-c3b3-4b3e-a18b-53fbdc6f0d47","resolution":{"observed_at":"2026-08-06T16:30:53.112169Z","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":"2507.13994","last_updated":"2025-07-18T15:02:46Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T16:09:27.928566Z","submitted_at":"2025-07-18T15:02:46Z","title":"Optimal antimatroid sorting"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":18,"verified_exact":19,"verified_fuzzy":1},"total_outbound_references":39},"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 7 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2507.13994."}