{"as_of":"2026-08-20T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a2768af13728bfbddb50ab7d2418a29809f732dc5a190a980cbe4eb25bf091f6","coverage":[{"denominator":32,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":32,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T19:32:06.887338Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T00:18:05.857196Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T00:18:06.107214Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.04388","snapshot_observed_at":"2026-08-02T02:55:26.131602Z","title":"Aden-Ali,Optimal online discrepancy minimization in linear time, arXiv:2607.04388, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.14238","last_updated":"2026-07-15T18:01:43Z","snapshot_observed_at":"2026-08-20T06:27:26.917711Z","submitted_at":"2026-07-15T18:01:43Z","title":"Online Beck--Fiala Down to Logarithmic Sparsity","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T02:55:26.131602Z"},"links":{"cited_paper":"/paper/2607.04388","citing_paper":"/paper/2607.14238"},"observation_digest":"sha256:0083ee79e5ffbc34948bed629df7a1f011e30028c0067b9a3be66c9379fc918f","observation_id":"6e47e8da-6c6a-4bd0-8a47-8225c8c7fead","resolution":{"observed_at":"2026-08-02T02:55:26.131602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"cited_work":{"arxiv_id":"2607.04388","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.04388","snapshot_observed_at":"2026-08-16T00:18:06.107214Z","title":"Optimal Online Discrepancy Minimization in Linear Time","venue":"cs.DS","work_id":"abf64bcd-7971-4b25-aa7c-0230af25460d","year":2026},"citing_paper":{"arxiv_id":"2608.12490","last_updated":"2026-08-12T18:10:45Z","snapshot_observed_at":"2026-08-19T11:35:32.091779Z","submitted_at":"2026-08-12T18:10:45Z","title":"Online balancing of vectors with small coordinates","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T00:18:05.857196Z"},"links":{"cited_paper":"/paper/2607.04388","citing_paper":"/paper/2608.12490"},"observation_digest":"sha256:20433e8d099150353a180d01ccf61d409948592a72200883fa10c25a498ae361","observation_id":"df4ec9c4-813f-43d8-870d-58117b735417","resolution":{"observed_at":"2026-08-16T00:18:06.112442Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2607.04388/citation-record","integrity":"/paper/2607.04388/integrity","json":"/paper/2607.04388/citation-record.json","paper":"/paper/2607.04388"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T19:32:06.887338Z","title":"Optimal Online Discrepancy Minimization , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:325d2c18a50fb8535157add205e2b238b590d5c0fe8fecb40a7d12f473c744dd","observation_id":"bde6597e-8916-44e3-b621-a72df2cba20c","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Decoupling via Affine Spectral-Independence:","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:2440d94f42ae574c80ff0cec0e4d8737561d9acbe12e7ca4891d344777c39603","observation_id":"4cb9e9fd-50f2-409b-89eb-c93a04004f0e","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:5b1c854df7fe89b5462d6518854ac17f24dc614665b29f4bd697c86ece9cde8b","observation_id":"c238822c-76d6-43ba-9107-a46624548432","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Liu and Mehtaab Sawhney , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:9f1bbcb2f6021e919d48d710a99a84b6b950ae724a3e3e8e7eb0ae3640be5118","observation_id":"97d56bd7-459b-4fae-bcfc-796ef938cf9e","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Liu and Ashwin Sah and Mehtaab Sawhney , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:ff35cc5938349df2e9eb55c256c0483d26b2ef47b79eca8878ed7bc69467da11","observation_id":"b0119c9d-9863-42c7-8cdf-5fec47524778","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Random Struct","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:2103ae5a664e07155f93283f9bdf844d82714554e32d271dfa0ca02875291a0c","observation_id":"6e2b2ac9-fa17-4d32-b189-f383943a77ce","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:2ecb4dc5bd79a8746a5d0e02ab7d2588f43a4ce5b73eeb0a942a4a8a4ee4c04f","observation_id":"afe91e8e-ef5c-4c26-b11d-3674ce5605e0","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Theory Comput","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:e112c41bfb85a47a021fd996e111be417899588a3f9a92bb82f46f755fa7e8fd","observation_id":"52c49443-16bf-447a-b8e7-2570eb947d13","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:2c8f53d780d982b11aef18d5b6ba8a055132e1477ce37bf969405c8e1b4baaa8","observation_id":"d8fee964-a880-4f2a-9204-d6c34b2b2675","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Theory Comput","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:73b21405fa904d5dfbe0daf7c5ca1fcdc379ba5bd003c3205b9ac05b7d70f715","observation_id":"4c085cc7-5f8b-4404-90cb-95b9e4be60d5","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Vempala , editor =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:83806a5201a56a314ad6e78b5f8dc61f1c53a17b609902a02f7bd94382b5471c","observation_id":"672015b4-8642-4123-8d63-a97991cf5896","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Discrepancy Minimization via Regularization , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:a0293872d257fea4ab56a8e807e60a9ce4293cc49d489226e5bacd4110eb831d","observation_id":"0e1185ec-3b17-4a97-bdf5-60fa14533128","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Spencer , title =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:94861154358692021c0645f742032b22f1e27bdb150a9dc1bb07636177fe4f9d","observation_id":"d3b165cd-a137-4175-8b5d-3bce6cab00ff","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Altschuler and Konstantin E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:8873a80db41d7363c2e2eb8e92b1c2b7ef905a6f3c67f6a1d7cc3c7d2ff3a803","observation_id":"09a85842-da57-484d-b8a1-7020cc87cb8c","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Online vector balancing and geometric discrepancy , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:baba1a3a73b593b53b122279b4d4beac287c89aeacd924bf8ff1de63731c60df","observation_id":"689e90aa-0108-407e-acbe-3aa005dbee91","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Online Discrepancy Minimization for Stochastic Arrivals , booktitle =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:a1138ad568c47e45127dbfc8f382efe59719fc95f7b429f6119534168f7d9d0e","observation_id":"804e10e1-eeee-463c-a832-765c84a5d3a8","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Liu, and Mehtaab Sawhney","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:1478ad48a103531551ce33b43dd2b109273d17e8f875f0b87debf2708ddfc1f3","observation_id":"dd414836-7986-49e1-808d-1e304a89b4e3","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Altschuler and Konstantin E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:33527d9911fae070c52fafabeb52f4408d0e241aa8dfec3e1adb91a6986c9b18","observation_id":"a15a6f3f-f6ef-4f8b-907d-3177c6e6517a","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Balancing vectors and Gaussian measures of n-dimensional convex bodies","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:54198267fd96d46178a9b3bda7771c66d9a87adf143b1b4262096b0f4832c55b","observation_id":"8ee3b3a5-9c25-4a0c-8b24-7e9c4049cf90","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"An algorithm for Koml \\' o s conjecture matching Banaszczyk 's bound","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:1c045795ce63b962576fe4b67644ece6b9a03b48191d7689d201b0b63a2d5d00","observation_id":"a5a669d0-75d8-45e1-b28a-cd0a72f868b7","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"The Gram-Schmidt walk: A cure for the Banaszczyk blues","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:54fec8959890ad4ffd347726604c3e338928f70d9e11596bf159f1fd246e63a3","observation_id":"3cf4bbfd-cd05-4d14-bfad-3623a1135679","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Decoupling via affine spectral-independence: Beck-Fiala and Koml \\' o s bounds beyond Banaszczyk","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:d337747fea88ad1be93593268b1628520156cf666a6e3bb57d4204a98fe8f4a9","observation_id":"269a94e0-4b62-4260-8c89-6708bdec2a43","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Online discrepancy minimization for stochastic arrivals","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:b357c3ae9e79f2ee7a28a28bcc34d31b703a51775a3d540bdce3f8f308412a77","observation_id":"94a11ca7-2c3b-40c0-9565-843f6823fd54","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Online vector balancing and geometric discrepancy","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:b635b519f448032961d977c4550ed1e609ebdfeb92ca4b67c95881cf5c97b572","observation_id":"2a246cc7-e14b-4438-9cb9-bc705c2fdc52","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:43f1f299aac412b4f05b74f5969ed11463ee84e564ad06aed29af85e22eeb01a","observation_id":"c488e903-93b4-4d63-9567-448ba53e7f44","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:297233a15a4c29fa797ed8bdea9dad81a9b027793a0e6cfc18277260cdc9fc35","observation_id":"49607f88-2396-4514-bcea-8e9c13b01db9","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Towards a constructive version of Banaszczyk 's vector balancing theorem","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:c616de1da4955b6e84019dd7120ec9b6bbbbf37b3b9673344ad9f51672dc5d2c","observation_id":"e83a9b78-3c5e-4d43-a7d9-a3ee2cfd44df","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Optimal online discrepancy minimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:6c9c1c0417227dc414248c88cdab6863a637064a462feb8a72756b4082588b67","observation_id":"ca1bf754-f97e-41a9-9eff-56573e01f89c","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Deterministic discrepancy minimization via the multiplicative weight update method","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:0d87a438dcc85c4973580a38fe615d41481309d5e5bca15b9242c8109ec4d7c2","observation_id":"764301a3-149e-4bb2-bfed-a85173ea359f","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Liu, Ashwin Sah, and Mehtaab Sawhney","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:87e2cf6c2d1d9ecc9bd2505de4ef5611bf3f550a3354016156468a71ef41728a","observation_id":"7141c8ac-06f0-42a4-9032-57418307e9fa","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Discrepancy minimization via regularization","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:a34f8f07e541c00b39fb6098e7077d2524478d27467685b16741f6d9b855f71b","observation_id":"ef9b17cc-70c1-4738-b027-91648268de3e","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","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-11T19:32:06.887338Z","title":"Balancing games","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-11T19:32:06.887338Z"},"links":{"citing_paper":"/paper/2607.04388"},"observation_digest":"sha256:3bdf51836d9800a5f72ee6a0fb3b325c55b315782dc18f862a4b1539733cc240","observation_id":"45d0679b-e75d-4ea6-af6b-35c806729b7c","resolution":{"observed_at":"2026-07-11T19:32:06.887338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.04388","last_updated":"2026-07-05T16:31:42Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T11:00:11.422245Z","submitted_at":"2026-07-05T16:31:42Z","title":"Optimal Online Discrepancy Minimization in Linear Time"},"reference_resolution":{"displayed":32,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":32},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 32 of 32 outbound references and 2 inbound Pith citation observations for arXiv:2607.04388."}