{"as_of":"2026-08-08T08:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bccb3af7373363f88d56f6966a156ebfe7d2485e60a49773910f742887e16c0f","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:04:03.579601Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.20141/citation-record","integrity":"/paper/2506.20141/integrity","json":"/paper/2506.20141/citation-record.json","paper":"/paper/2506.20141"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-06T23:04:03.487011Z","title":"Gpt-4 technical report","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.487011Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:4536104f9b1a06c6f7b344c8779810d9d4d54f80905dd707f752b7f18b226662","observation_id":"0d69026a-3218-418b-8421-3488bf207aa8","resolution":{"observed_at":"2026-08-06T23:04:03.487011Z","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-06T23:04:03.800119Z","title":"wsdm-conference.org/2024/call-for-papers/ ,","venue":null,"work_id":"cc5afb3e-a5e8-4c29-8a50-2a0b8b12f1ff","year":2024},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.521561Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:8ef3ba7baf76f87de087bbd78d80526f89cc6653c76f9eccd42b85988b6c6d37","observation_id":"0d15df94-341c-46fa-852a-8bce1ce29ae3","resolution":{"observed_at":"2026-08-06T23:04:03.804295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.788299Z","title":"thecvf.com/Conferences/2025/CVPRChanges,","venue":null,"work_id":"d979fea0-de32-44b6-b550-b22e073c8dd7","year":2025},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.526012Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:2f79146815bc5ed9348991a6caf946bc705ba7125c40da8651834d1f355b7e72","observation_id":"63b25c7a-8e88-45e2-9930-440117e28b37","resolution":{"observed_at":"2026-08-06T23:04:03.792226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.774692Z","title":"thecvf.com/Conferences/2025/AuthorGuidelines,","venue":null,"work_id":"596fb804-78c8-4b0c-a9b0-aa70709cc9be","year":2025},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.529703Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:4ff7e91fa29089b4c561c25dc901593508faac2b748cf650bf3a89883bce6a54","observation_id":"448ac8bc-3480-46d6-bb84-1270b3a5d5a3","resolution":{"observed_at":"2026-08-06T23:04:03.779051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.762107Z","title":null,"venue":null,"work_id":"0819521d-8d05-4e05-b555-7a394bfc5bec","year":2025},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.533489Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:0a762c1bbed5ba93c1a73c2b4a8e393d7930b13f29361881ede3f88edac69b1f","observation_id":"5237c117-b27d-4457-b91a-3ad5cdb97e21","resolution":{"observed_at":"2026-08-06T23:04:03.766422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.750691Z","title":"ijcai.org/call-for-papers-main-track/ ,","venue":null,"work_id":"a17acfa8-3989-4c6d-a684-b28d97c38230","year":2025},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.537563Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:5a907332774082b0e880602d6c0951d3454fe2522b3bc3a2017a9fe3c8489a8a","observation_id":"bfee2059-19fb-4ab9-9e59-339ce7c0bc17","resolution":{"observed_at":"2026-08-06T23:04:03.754828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.739785Z","title":"wsdm-conference.org/2025/call-for-papers/ ,","venue":null,"work_id":"ccc0d324-54db-4088-afe4-d057d60798cc","year":2025},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.541361Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:e57e52dcc86ba20a6c0260212199c688a127a989518541cf1d3aab790b312cce","observation_id":"b0d77f99-5985-4f7c-aa7c-39d811bfd34e","resolution":{"observed_at":"2026-08-06T23:04:03.743127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.06033","last_updated":"2022-11-11T07:09:31Z","snapshot_observed_at":"2026-07-06T14:17:04.086096Z","submitted_at":"2022-11-11T07:09:31Z","title":"A Faster Small Treewidth SDP Solver","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.06033","snapshot_observed_at":"2026-08-06T23:04:03.545746Z","title":"A faster small treewidth sdp solver","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.545746Z"},"links":{"cited_paper":"/paper/2211.06033","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:b347d9add4b546b9323ba5e45fe8631967adc031d0b626d265187ae970e0a8d6","observation_id":"66fd9998-7609-4a0e-adaa-e7f6a1c61cb3","resolution":{"observed_at":"2026-08-06T23:04:03.545746Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07418","last_updated":"2023-09-14T04:23:40Z","snapshot_observed_at":"2026-07-06T16:18:17.458740Z","submitted_at":"2023-09-14T04:23:40Z","title":"A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07418","snapshot_observed_at":"2026-08-06T23:04:03.550004Z","title":"A fast optimization view: Reformulating single layer attention in llm based on tensor and svm trick, and solving it in matrix multiplication time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.550004Z"},"links":{"cited_paper":"/paper/2309.07418","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:72a91467c24e7cc0f17805b389dcb384759e8ddddb20563159c9c07c9644ab42","observation_id":"44853712-05b8-401f-ade7-0b627ecb60f1","resolution":{"observed_at":"2026-08-06T23:04:03.550004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.07735","last_updated":"2025-02-11T21:37:03Z","snapshot_observed_at":"2026-08-03T14:47:19.992718Z","submitted_at":"2023-07-15T07:19:29Z","title":"Faster Algorithms for Structured Linear and Kernel Support Vector Machines","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.07735","snapshot_observed_at":"2026-08-06T23:04:03.553967Z","title":"A nearly-linear time algorithm for structured support vector machines","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.553967Z"},"links":{"cited_paper":"/paper/2307.07735","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:c929a91ee0a1adc07969c14adf78741bb3ada2c4053744f2452171187ac6357e","observation_id":"a77dc07a-61b9-4ba7-a628-4d64623a14c5","resolution":{"observed_at":"2026-08-06T23:04:03.553967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.11154","last_updated":"2023-02-06T19:49:08Z","snapshot_observed_at":"2026-07-06T13:34:17.317584Z","submitted_at":"2022-07-22T15:51:02Z","title":"A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework","version":2},"cited_work":{"arxiv_id":"2207.11154","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.11154","snapshot_observed_at":"2026-08-06T23:04:03.665062Z","title":"A Faster Quantum Algorithm for Semidefinite Programming via Robust IPM Framework","venue":"quant-ph","work_id":"23ac8c8c-52c6-4cbe-9f43-cdab24d2180b","year":2022},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.558174Z"},"links":{"cited_paper":"/paper/2207.11154","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:48cb3e4f2c83b94f853504808ce0d468f228757a6c472ac81eba2ec226eecdaf","observation_id":"1305cad6-9736-41fb-b9e5-99b4206a3984","resolution":{"observed_at":"2026-08-06T23:04:03.669336Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.728115Z","title":"Solv- ing sdp faster: A robust ipm framework and efficient implementation","venue":null,"work_id":"296d92ca-9077-42bc-96e5-fdb72bdd7e65","year":2022},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.562559Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:7a7848ac3e708737d119de2228ab9895f0e1818e04ef6757e371560a9de0088c","observation_id":"28fe584d-f18c-43a1-aead-68687974e86a","resolution":{"observed_at":"2026-08-06T23:04:03.732591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.05135","last_updated":"2023-09-10T21:07:19Z","snapshot_observed_at":"2026-08-04T11:53:04.986539Z","submitted_at":"2023-09-10T21:07:19Z","title":"Streaming Semidefinite Programs: $O(\\sqrt{n})$ Passes, Small Space and Fast Runtime","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.05135","snapshot_observed_at":"2026-08-06T23:04:03.579601Z","title":"Streaming semidefinite pro- grams: o(\\sqrt{n}) passes, small space and fast runtime","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.579601Z"},"links":{"cited_paper":"/paper/2309.05135","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:0d1508db26fa896b3816bd2188823a01e3ea8ff11cb4118adc221e5dd1487d3a","observation_id":"023ad3b2-f1f5-4378-a938-5dfeb1be31e5","resolution":{"observed_at":"2026-08-06T23:04:03.579601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6677","last_updated":"2015-03-05T19:51:27Z","snapshot_observed_at":"2026-07-06T03:31:42.501211Z","submitted_at":"2013-12-23T20:54:43Z","title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","version":3},"cited_work":{"arxiv_id":"1312.6677","doi":null,"metadata_source":"pith","pith_arxiv_id":"1312.6677","snapshot_observed_at":"2026-08-06T23:04:03.647100Z","title":"Path Finding I :Solving Linear Programs with \\~O(sqrt(rank)) Linear System Solves","venue":"cs.DS","work_id":"430d93fa-852c-499d-9ea1-ef8d8c967e5f","year":2013},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.566771Z"},"links":{"cited_paper":"/paper/1312.6677","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:c907045302efa6cddf39b73dcba775c80b8bd6d37151793cfeddaf4affa51a52","observation_id":"b33c3082-5d00-4edf-9034-b856dc4d1458","resolution":{"observed_at":"2026-08-06T23:04:03.651511Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.03209","last_updated":"2022-04-07T04:49:06Z","snapshot_observed_at":"2026-07-06T12:57:44.025473Z","submitted_at":"2022-04-07T04:49:06Z","title":"Speeding Up Sparsification using Inner Product Search Data Structures","version":1},"cited_work":{"arxiv_id":"2204.03209","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.03209","snapshot_observed_at":"2026-08-06T23:04:03.616326Z","title":"Speeding Up Sparsification using Inner Product Search Data Structures","venue":"cs.DS","work_id":"625a78c5-1a12-4422-8b6a-d5f2926510f2","year":2022},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.575716Z"},"links":{"cited_paper":"/paper/2204.03209","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:c47dd566802b0369ecc3ed9736473f44d5e66440b1eb0cc0a57a0f32c7637ba2","observation_id":"4254d3f1-40b6-48db-977b-75c05e17649f","resolution":{"observed_at":"2026-08-06T23:04:03.622497Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.876723Z","title":"Time to rethink the publication process in machine learning","venue":null,"work_id":"1e13b7fd-4947-48f0-9b4b-024a868a6680","year":2020},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.495729Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:887554435ac8562a5626dde589a136c22e952f2b405a00520c28ed13d8b2e1f4","observation_id":"ce094b44-ab04-4a6a-92a7-93e6048c0395","resolution":{"observed_at":"2026-08-06T23:04:03.880210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08033","last_updated":"2020-08-31T18:42:17Z","snapshot_observed_at":"2026-08-06T11:44:17.215568Z","submitted_at":"2019-10-17T16:59:29Z","title":"Solving Linear Programs with Sqrt(rank) Linear System Solves","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08033","snapshot_observed_at":"2026-08-06T23:04:03.571051Z","title":"Solving linear programs with sqrt (rank) linear system solves","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.571051Z"},"links":{"cited_paper":"/paper/1910.08033","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:8e55efa67fd1cc6a253ba040a95ebe30876228ee9a6530b6ade27e6c285d2957","observation_id":"ed08bff2-2413-4ddc-a482-7b456f9d553a","resolution":{"observed_at":"2026-08-06T23:04:03.571051Z","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-06T23:04:03.866020Z","title":"wsdm-conference.org/2020/call-for-papers.php ,","venue":null,"work_id":"75d6489a-f7c1-45fe-a028-1c27c89211a6","year":2020},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.500032Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:8256029cfdd230c4a2a1f80ca6cbb05ddb7f151bf1952c60e061b7211994c574","observation_id":"69db0dbe-db06-4f24-b8a8-84e4e7e92400","resolution":{"observed_at":"2026-08-06T23:04:03.869489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.851435Z","title":"wsdm-conference.org/2021/call-for-papers.php ,","venue":null,"work_id":"bd0e5566-cd7f-4ee6-bd3d-1b7f1bab7d5b","year":2021},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.504200Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:721df0fd1244d5c4e1a3afc7b4286c8abc0f55b73fb0aff6f73204775c3efa23","observation_id":"8932ab3f-4dfa-4566-9795-32a06b285102","resolution":{"observed_at":"2026-08-06T23:04:03.856643Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.837186Z","title":"wsdm-conference.org/2022/calls/,","venue":null,"work_id":"f5ecb407-1f26-4b4b-bbc7-eb42a9ed7ff9","year":2022},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.508606Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:c634f9a385447c65459fba53012aed6cb6275eaf85e8f0176ff5323fdec033b3","observation_id":"be6fa55c-c84a-491b-ad24-626862cb8938","resolution":{"observed_at":"2026-08-06T23:04:03.841410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.826312Z","title":"wsdm-conference.org/2023/calls/call-papers/,","venue":null,"work_id":"d50875e1-09a3-4568-8f64-7fddb89276c3","year":2023},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.512753Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:ce1e4a76c82da1a4d8477192e38c193de10acee707d379cc26bf1da51c0d301f","observation_id":"d4ad337b-0bc1-444b-8d99-e5ad45caaf97","resolution":{"observed_at":"2026-08-06T23:04:03.830190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T23:04:03.813499Z","title":"thecvf.com/Conferences/2024/AuthorGuidelines,","venue":null,"work_id":"2e60e217-78b2-428c-b18a-7c7c40438e88","year":2024},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.517114Z"},"links":{"citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:74fc8e8883872e20180b4fa876129038d561ea2761f15fda60ab16ebf1011e37","observation_id":"f518d916-7765-437c-930c-781034f43583","resolution":{"observed_at":"2026-08-06T23:04:03.818070Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02452","last_updated":"2024-01-08T12:37:58Z","snapshot_observed_at":"2026-07-06T17:11:46.822922Z","submitted_at":"2024-01-04T01:26:11Z","title":"The Compute Divide in Machine Learning: A Threat to Academic Contribution and Scrutiny?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02452","snapshot_observed_at":"2026-08-06T23:04:03.491075Z","title":"[BBM+24] Tamay Besiroglu, Sage Andrus Bergerson, Amelia Michael, Lennart Heim, Xueyun Luo, and Neil Thompson","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T23:04:03.491075Z"},"links":{"cited_paper":"/paper/2401.02452","citing_paper":"/paper/2506.20141"},"observation_digest":"sha256:15174a9dfe8e3316d1720788bf1aeda30e1de39d6877e954c9bc0e0334af80b9","observation_id":"e81e8f8a-19b5-413e-b5ea-f92de0408371","resolution":{"observed_at":"2026-08-06T23:04:03.491075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.20141","last_updated":"2025-06-25T05:23:44Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T22:53:13.816571Z","submitted_at":"2025-06-25T05:23:44Z","title":"Accept More, Reject Less: Reducing up to 19% Unnecessary Desk-Rejections over 11 Years of ICLR Data"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":12},"total_outbound_references":23},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2506.20141."}