{"as_of":"2026-08-09T04:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7350cf7a42ee500e0646f398e3b611d461437ec15a50b3cd331fac844e916031","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T21:57:05.771091Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"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/2607.04062/citation-record","integrity":"/paper/2607.04062/integrity","json":"/paper/2607.04062/citation-record.json","paper":"/paper/2607.04062"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"More asymmetry yields faster matrix multiplication","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:59f05c8be7c3245e9fd72c5defe9e85499fa0a4f4693c70608e53f7b67d82d5b","observation_id":"46d5a913-22a8-4467-beb3-e4fdc0d11a76","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Stochastic bias- reduced gradient methods.Advances in Neural Information Processing Systems, 34:10810–10822, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:a115234bf8af6e35574ff0e5ac32ff72f324eba731484d06a5f4e7897cf32f12","observation_id":"f61b7b6a-029e-41b4-b53a-696432834c8e","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Stochastic bias- reduced gradient methods","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:e9e9cd88390130be020145f97a5ecac0c046a40b44c48f3ea0ee015b197f35db","observation_id":"98146fa2-e7e1-48d0-b0eb-cf94e07ad1e3","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A cutting plane algorithm for convex programming that uses analytic centers.Mathematical Programming, 69(1-3):1–43, 1995","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:0c6301a9888c4a1ba670478694eca05f5e1eb0b358ba0c2a6b9210aa7b3f3f26","observation_id":"4be3dbd8-f7fb-4f88-b8e2-eef24cf5d8ee","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Self-concordant analysis for logistic regression.Electronic Journal of Statistics, 4:384–414, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:93284a3506bb55d1910df64809ab74a1072cb393206c60e84d6180c337a691e7","observation_id":"2e5fd083-9b41-4e43-9188-a190140b0b41","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Mirror descent and nonlinear projected subgradient methods for convex optimization.Operations Research Letters, 31(3):167–175, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:72d98b8eb0901c9b36251472dd1ac1418ecf9a094274fad4acf971909c52ddc4","observation_id":"53215491-7c28-49fc-82e0-902fc9ae046f","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Curran Associates Inc., Red Hook, NY, USA, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:231259f6a0772042e7a9bceb413d6adf512594e9f6c9913db91e2b8e99b6b704","observation_id":"e9889177-d6cd-4e06-862e-1d494224a399","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.13225","last_updated":"2022-03-24T17:31:43Z","snapshot_observed_at":"2026-07-06T12:52:05.424523Z","submitted_at":"2022-03-24T17:31:43Z","title":"Distributionally Robust Optimization via Ball Oracle Acceleration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.13225","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Distributionally robust optimization via ball oracle acceleration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/2203.13225","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:36384ded5110c4dabad7e2b0e610c9d69417a4344b74218739623a9f856081f2","observation_id":"7233d868-2674-4f74-8061-3df513099f96","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Variance reduction for matrix games","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:1b309b0910ab29f8302daf8fdd7895bceb78b270e888c7d8d12095c3ce59a389","observation_id":"69ccea7b-27e8-4b15-b7c9-4186e9523844","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Acceleration with a ball optimization oracle","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:c99beb1333380d2bd8153de503836cf83bb016eaa554504a0b8c1c695ac88e7e","observation_id":"59f39002-5f48-4dbe-b54f-5c8532e1cae9","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Coordinate methods for matrix games","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:4b8b84567c920a4cf49981a645359a9d85c598a53e9a7cacd2afc160a443f15d","observation_id":"46a35de2-34b1-4f8d-a405-f218176fdf8e","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Thinking inside the ball: Near-optimal minimization of the maximal loss","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:498ca405a8e1478edcd6f1fc18619f5ff043c00526f7e3c964e1d8f044022d8f","observation_id":"c2734c81-66d0-4de8-aad5-8e48a17f7660","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Optimal and adaptive monteiro-svaiter acceleration","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:7563c445486d635975b17902c6067167b6528f674c5a2e57038b3d03d1eee9a2","observation_id":"06cd865a-6e8b-4854-a381-4f3008f888c0","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Resqueing parallel and private stochastic convex optimization","venue":null,"work_id":null,"year":2031},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:834cc6342c1d4a62ccc8683c507eb739a79835859f06aca020e0741adbe5ee80","observation_id":"d54ac781-f6e4-43b3-8499-74c7d042bfee","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A whole new ball game: A primal accelerated method for matrix games and minimizing the maximum of smooth functions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:035796ab151bdb046beb3992a26c2048206414bad8e58d03d2c5a28541ddc4ee","observation_id":"1cdb4f31-6695-4039-96cf-d508d869e879","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02949","last_updated":"2024-12-04T01:33:01Z","snapshot_observed_at":"2026-07-06T20:01:19.215540Z","submitted_at":"2024-12-04T01:33:01Z","title":"Extracting Dual Solutions via Primal Optimizers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02949","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Extracting dual solutions via primal optimizers.arXiv preprint arXiv:2412.02949, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/2412.02949","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:e484b0672e67fb2b508361029a22aeef2481d224abecb70a1624cfe95778f63f","observation_id":"a6bfd56e-32ed-4829-bd2e-8f8bf93322b8","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08773","last_updated":"2025-04-28T20:23:39Z","snapshot_observed_at":"2026-07-06T19:49:52.926290Z","submitted_at":"2024-11-13T16:58:51Z","title":"Optimal Oblivious Subspace Embeddings with Near-optimal Sparsity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.08773","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Optimal oblivious subspace embeddings with near-optimal sparsity.arXiv preprint arXiv:2411.08773, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/2411.08773","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:d1d3b6f361e000d862f20310d21a974386de30985f12f544b58130b8a24b1f2f","observation_id":"63e62678-b50d-49a1-afae-0a208567b94a","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Optimal em- bedding dimension for sparse subspace embeddings","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:1b648256820ca745a3cf5e132b48fd54c16d7a2fca6a3ccbbe24232c456d131a","observation_id":"49d73cad-0568-4bb6-8376-99120b541e13","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Low-rank approximation and regression in input sparsity time.Journal of the ACM (JACM), 63(6):1–45, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:a2d4d616a9b2e6eade5bd6fc255a1a96da66ae2c54c061af81f360aa45373b16","observation_id":"56006c40-2c7f-4e4c-97e7-2a18628f0047","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Sublinear optimization for machine learning","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:f9a06b1a062d5ef67c7bae8b9375756b552cf4ff812c7b4bb071cc09b87a16e7","observation_id":"ce3eaff9-7b67-4bfe-a1f8-718570b38de5","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Nearly tight oblivious subspace embeddings by trace inequalities","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:963f13034011704c4986c5b4072e8da1f6de16388749889abd1dc7973e116443","observation_id":"f51bffae-6d6d-43ca-a6a2-fe7a8fc4040f","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.02268","last_updated":"2016-03-02T12:58:32Z","snapshot_observed_at":"2026-07-06T04:23:14.183048Z","submitted_at":"2015-07-08T19:45:21Z","title":"Optimal approximate matrix product in terms of stable rank","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1507.02268","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Optimal approximate matrix product in terms of stable rank.arXiv preprint arXiv:1507.02268, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/1507.02268","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:ca5c96ba59073a8d1a75409c80dacb561a7ffd8e71f9311f10f1f71e149095f2","observation_id":"e4f8d5dc-8505-4521-b39d-3a10ed73d5d8","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Solving directed laplacian systems in nearly-linear time through sparse lu factorizations","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:d60b939c8fb4d94e73f07ebfc7a48d2379deb6a5af76921a1721bd4a6a587807","observation_id":"2c84cd1c-4723-4c4d-bcca-025cb5c808b1","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Solving linear programs in the current matrix multiplication time.Journal of the ACM (JACM), 68(1):1–39, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:fd90ea8591caac80317c6b9d3e90a7b784178545ced4b18493f6249abac9dffe","observation_id":"448aa743-3bd0-4cff-82d7-e10d9659b962","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Conn, Nicholas I","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:f6a07755dc259d071eafd590a4cbcb8d6592bbb122a329554303184d865c35b4","observation_id":"16582044-3321-4561-96e0-dd3fed520e2d","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Approaching optimality for solving dense linear systems with low-rank structure","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:5306a89cc05efd4ee23934cc14105638cac30c90ba1606e8853e3d60a251bdd3","observation_id":"6efbe688-a184-4f8f-b3a9-1c668549ab0b","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Faster linear systems and matrix norm approximation via multi-level sketched preconditioning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:20b48b8e350cc983eb626de1f55885963ec802cd3c1edce7fca5edac5d2f1aea","observation_id":"43cf05bd-a656-4da5-be3c-350ea18ec41a","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Minimizing quasi-self-concordant functions by gradient regularization of newton method, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:1adc95a060d1362af304bda96df18223224dc1566af7be7f08ac1d6146efb028","observation_id":"b9eb5279-52da-4e98-8c3e-83cd41641e22","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Randomized smoothing for stochastic optimization.SIAM Journal on Optimization, 22(2):674–701, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:7dd67fa49f38f041ccf0004f92e5e4890be707865a5f42e5cb93e0dc7cdbd910","observation_id":"120f35e0-1151-4a2c-b12c-fa2fd8be5d85","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:8aa63d0726449533804ffa639d9047b74df3f9f0d268a3c03cd2b54f11e87203","observation_id":"4acdc231-6fee-4fe7-a2e6-bbb0fa3dfa9e","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"The convergence of inexact chebyshev and richardson iterative methods for solving linear systems.Numerische Mathematik, 53(5):571–593, 1988","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:6d0aa5a815912c6e8b2d25fba1be408d09e378e3c7db104bdf41038102dab7ee","observation_id":"e0ef66aa-bc88-4afe-b5ab-d238e557a3fc","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:8cf332315b4b472b8a4e9e3018f29db688e8d8c5053f49509308e32f022a5534","observation_id":"aaddd103-da9d-4629-8232-5df1b2d84be9","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A sublinear-time randomized approximation algorithm for matrix games","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:46aa4c46fff986218c8295aa4a84205cc206b14c12da3be1916da7308dec283a","observation_id":"f68d6156-abf1-4ddf-9cb6-e1b6112e8187","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Liu, and Aaron Sidford","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:2291dcbcf816367a77234d3775b7bb750939202a11530746e693d8199348a9fa","observation_id":"d766655d-5387-487a-85c8-8ba6c72cf7b1","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Closing the computational-query depth gap in parallel stochastic convex optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:53ddaf723a1cbf288e871082a34f17e34f254dda01d2c84d1a2e591f1ec924b5","observation_id":"218a873c-b608-4e09-baf9-0d5187597f54","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Closing the computational-query depth gap in parallel stochastic convex optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:c59852f71f5d67ebde339758d952bac94c664082789002030ff455226ed9e1ae","observation_id":"529e92f5-df12-46d2-a539-0ac52734502e","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"An improved cutting plane method for convex optimization, convex-concave games, and its applications","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:83ca88a3eda74ffe1bf77ee8d80ea5df477129e0af9499769bc7daa3352e487b","observation_id":"4c38bcf1-5066-4516-be66-81b109428907","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Reusing samples in variance reduction","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:355e09ef998fffd5f3ba31cd08f247cfa23a679ddf3fffad13f0da083f0b1ff3","observation_id":"02876337-bef9-4c8c-98db-a8d5d15bf89f","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Accelerating stochastic gradient descent using predictive variance reduction.Advances in neural information processing systems, 26, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:b66001c525db74462067bcefcda4b558dea161844394672d977c2d07b6c10275","observation_id":"8448545c-ffa0-400a-b2fd-7dc9f7bb0d65","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00413","last_updated":"2018-06-01T15:58:54Z","snapshot_observed_at":"2026-08-06T07:57:03.090179Z","submitted_at":"2018-06-01T15:58:54Z","title":"Global linear convergence of Newton's method without strong-convexity or Lipschitz gradients","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00413","snapshot_observed_at":"2026-07-11T21:57:05.771091Z","title":"Stich, and Martin Jaggi","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"cited_paper":"/paper/1806.00413","citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:bb6b738b854a6a470458d1fcb049621320bdf3b7d1fe33dc44a777fc6d8cd12d","observation_id":"ca777e1f-2dd9-4c03-a569-4e2510559cef","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Solving zero-sum games with fewer matrix-vector products","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:8b905babbc35d5b10a2a8751c336dcb9169211e5561a67342aae06e7f1887f9e","observation_id":"b1259ee9-0e73-4736-86f0-f22bd650cea1","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Solving matrix games with near-optimal matvec complexity.58th Annual ACM Symposium on Theory of Computing (STOC), pages arXiv–2601, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:3f976bbf4c1bb1bb63c820823aa0aae6f2d2a5db06b24ef00509d8bbca994871","observation_id":"d16873bd-3978-449a-a453-89cb5c971346","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:668e8036f5b34f598f59d2bd3413391fd635b82a527f5bba2e3ce1e86f4fe6ba","observation_id":"24e2f766-1390-40e5-9a6f-5a539aa31c12","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"The oracle complexity of simplex-based matrix games: Linear separability and nash equilibria","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:35817a3976a5b633c3379c39cbd19b97a501cd08efea9a6ea9cbd8a96d7927fb","observation_id":"9eb5edd2-db41-4d13-8928-430f2215f3a5","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A faster cutting plane method and its implications for combinatorial and convex optimization","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:dbdadf9b0c2c72d44fde9bd06ca05ad17340f453879877785bf66f0e7781f75c","observation_id":"33335280-37aa-4af9-bbbd-d6e9cd12b5b4","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A universal catalyst for first-order optimiza- tion.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:f4f4815f2de7f3f4dce83f094c804a7b1e387ea90595fc57ed185ab579e77689","observation_id":"bde1c4fe-e935-4c90-832a-f6e8137d9a71","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"A logical calculus of the ideas immanent in nervous activity","venue":null,"work_id":null,"year":1943},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:9b168e171d9d2a66a610beb4f3c28373fd8f573a01025ed5983cecbf0761d46d","observation_id":"0ad05e4e-06aa-4a3e-8a5a-42dda1e2aee4","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Kernel-based svm","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:acbf24774b5dc41cd95f5244f7f9b59b28bce3916c5eaac13a13e1e490bfca98","observation_id":"f5c7e0a8-9a9d-4774-b4f3-cb3004b6626a","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Osnap: Faster numerical linear algebra algorithms via sparser subspace embeddings","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:0bd4ced04c7c96c6629fc0a8fbaa39a4b3c0dedd1c9f66d14c03f3e45cb3470d","observation_id":"cca7df0b-4a0e-49a5-b1e8-73486563457e","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"On parallel complexity of nonsmooth convex optimization.Journal of Complexity, 10(4):451–463, 1994","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:57d4cd6ffcf5f81b09357d95d01f8876bd2b28123e3b43d00a8fd6910acbec1e","observation_id":"8c38eee6-7290-4037-80fe-3547c99ff070","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators and smooth convex-concave saddle point problems","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:25a3c7071a4b1eb70e9b17eec3a2ef89b789493bd4da490627144ec6d929fe5f","observation_id":"4c267d02-6b40-4400-9881-a965a2148232","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Problem complexity and method efficiency in optimization","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:61dee5af0ffa879e3514154f092c80e48b658df1d48d9655c53c0a12738def39","observation_id":"f672c49c-066c-4ba1-b48e-c6198e9194e6","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Smooth minimization of non-smooth functions","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:887b7ee3093e6460edfa08fae49634c8922e554d448fa3d2b5651a9bb398dca6","observation_id":"b0d5efe2-0b19-4318-9126-077a63a8e443","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Dual extrapolation and its applications to solving variational inequalities and related problems.Mathematical Programming, 109(2):319–344, Mar 2007","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:cc2824907d450d30c2da1252ce9a86a0065ca5a4df67d71af9d6445ce8166ec5","observation_id":"d6e88438-bde7-4914-8a4b-b39c248f7b26","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Stochastic variance reduction methods for saddle-point problems","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:18198f2c3558c78702acc3d4aa59bda12956cf7df6c907976d1bc616473d1d72","observation_id":"5a71f365-20cc-418b-bc2f-6b999daf66dd","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:dde65943402de0d46aa349ddd2715a4b89921df20135fb2d921c59d03a4c0840","observation_id":"7d088d3a-bcc5-4f6f-b8bf-992252477c0a","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Pan and John H","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:5d1c680113967f576593b61abc9010648140b57a3b95da77d6aceb2fda02b1d8","observation_id":"ab5ef228-ce3a-4aaf-a8b0-81d9fa43a9b5","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Rakhlin and K","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:af0b10012f3d025488e2bbb1343efb739a9e0f9cca6b88588b3c614fa29dd1db","observation_id":"3728011b-1163-499c-81d3-d30eac27ced7","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"The perceptron: a probabilistic model for information storage and organiza- tion in the brain","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:d928d573cb41f28b8b0917f0ec77b4bedf774d8775a2b1abfafc0554c4b1ab55","observation_id":"ecbe3f70-668f-44bb-969a-2927d6cf79c6","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Improved approximation algorithms for large matrices via random projections","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:9332a9aae6ababe514aa205ccdcfcd837db4a3c7c6896cdde882d07a88fe116b","observation_id":"d501129d-b335-4dc6-8f90-98752539f787","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Quantum speedups for stochastic optimization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:93a12ed160dc9bc3f8ce497e629d8eb484c7791337df69f216e8f12d0f2d52a1","observation_id":"1880107e-55c7-43a9-9530-7b54306f72ce","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Generalized self-concordant functions: a recipe for newton- type methods.Mathematical Programming, 178(1-2):145–213, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:2f42731f470b30525c6552462923e28b1b82da75f58c8eea688433fa1efbdf31","observation_id":"760b7b77-1679-4a60-afea-6cfef5f575d2","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:459cfdd521a5ea313c1bc0a159d183aa199e67d2d57779b3d4e0ea00862c3dd8","observation_id":"8e0c569d-0ddc-4d4e-8c77-1b55b55fc1f9","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","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-07-11T21:57:05.771091Z","title":"Minimum cost flows, mdps, and l1-regression in nearly linear time for dense instances","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-07-11T21:57:05.771091Z"},"links":{"citing_paper":"/paper/2607.04062"},"observation_digest":"sha256:a0f7b8caa73cef2e0ecca9fbcf45f9f1a02aa770219066dc9204ac126884f564","observation_id":"bce2db1f-5eea-482d-83af-e6aa33373930","resolution":{"observed_at":"2026-07-11T21:57:05.771091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04062","last_updated":"2026-07-05T00:18:56Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T20:05:11.587008Z","submitted_at":"2026-07-05T00:18:56Z","title":"Fast, Parallel, Query-Efficient Binary Classification"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":64,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":64},"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 9 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2607.04062."}