Pith. sign in

Paper Citation Record · LEDGER

Optimal Online Discrepancy Minimization in Linear Time

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.04388 v1

Coverage vector

measured 32 of 32 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-11T19:32:06.887338Z

measured 34 of 34 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:18:05.857196Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-16T00:18:06.107214Z

Reference resolution

32 of 32 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved32
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation bde6597e-8916-44e3-b621-a72df2cba20c · outbound

This paper cites Optimal Online Discrepancy Minimization , booktitle =.

Optimal Online Discrepancy Minimization in Linear Time Optimal Online Discrepancy Minimization , booktitle =

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:f63a798f14669083bd2a362dad1ac6349861d7bb14ac86b56e0b67e5ef82cb5c

Observation 4cb9e9fd-50f2-409b-89eb-c93a04004f0e · outbound

This paper cites Decoupling via Affine Spectral-Independence:.

Optimal Online Discrepancy Minimization in Linear Time Decoupling via Affine Spectral-Independence:

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:6804dcae3d7c0273013c8d39ce47a9b6be724ca443a4d3976f7aac6084c7281b

Observation c238822c-76d6-43ba-9107-a46624548432 · outbound

This paper cites an unresolved cited work.

Optimal Online Discrepancy Minimization in Linear Time Unresolved cited work

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:23122fba01226103dc837a29032eafd29555376800e1fec6355d0a5326f1d1ea

Observation 97d56bd7-459b-4fae-bcfc-796ef938cf9e · outbound

This paper cites Liu and Mehtaab Sawhney , editor =.

Optimal Online Discrepancy Minimization in Linear Time Liu and Mehtaab Sawhney , editor =

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:12226a7a866a1b9fd3fdfd5ca3644b93b26df1a591b87ef73491d5f6c19f266d

Observation b0119c9d-9863-42c7-8cdf-5fec47524778 · outbound

This paper cites Liu and Ashwin Sah and Mehtaab Sawhney , editor =.

Optimal Online Discrepancy Minimization in Linear Time Liu and Ashwin Sah and Mehtaab Sawhney , editor =

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:f4cda36a101fac5b4ee0235d7e86dda08777a33145434cf89da0e0b2a1e02694

Observation 6e2b2ac9-fa17-4d32-b189-f383943a77ce · outbound

This paper cites Random Struct.

Optimal Online Discrepancy Minimization in Linear Time Random Struct

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:e7a5fa8ebfb1a82a31602a28a784144581d21de493bf518bbcb3d935c9ff31b8

Observation afe91e8e-ef5c-4c26-b11d-3674ce5605e0 · outbound

This paper cites Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method , booktitle =.

Optimal Online Discrepancy Minimization in Linear Time Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method , booktitle =

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:39f60651ce591f83d7b8d506e6c72b1d1cd2f1a84015014abe5ebb970544498a

Observation 52c49443-16bf-447a-b8e7-2570eb947d13 · outbound

This paper cites Theory Comput.

Optimal Online Discrepancy Minimization in Linear Time Theory Comput

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:7891230efdc9e140529d5756d576eab5bd7df67bd9421c40538de10af452eac5

Observation d8fee964-a880-4f2a-9204-d6c34b2b2675 · outbound

This paper cites an unresolved cited work.

Optimal Online Discrepancy Minimization in Linear Time Unresolved cited work

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:40e3bca5ed1ee9eef7cc460441aa37bf13ed32a5635522799d454be89edc3dbe

Observation 4c085cc7-5f8b-4404-90cb-95b9e4be60d5 · outbound

This paper cites Theory Comput.

Optimal Online Discrepancy Minimization in Linear Time Theory Comput

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:0ee4c785907bbdd00e32eee5f5e646cb5dcf0d890ca2bf1a5877d8cdd4d59a2b

Observation 672015b4-8642-4123-8d63-a97991cf5896 · outbound

This paper cites Vempala , editor =.

Optimal Online Discrepancy Minimization in Linear Time Vempala , editor =

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:7bded30987c8127c8b2ddbb080ebc622f6c247c302d2c1d3ebeb7990937cc45e

Observation 0e1185ec-3b17-4a97-bdf5-60fa14533128 · outbound

This paper cites Discrepancy Minimization via Regularization , booktitle =.

Optimal Online Discrepancy Minimization in Linear Time Discrepancy Minimization via Regularization , booktitle =

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:46a1fe0c81293543853d9e77816e41a36ba8365c3b4aaaeea20641aa69876c12

Observation d3b165cd-a137-4175-8b5d-3bce6cab00ff · outbound

This paper cites Spencer , title =.

Optimal Online Discrepancy Minimization in Linear Time Spencer , title =

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:c4ccc81cf9238ce45d5670ae4f5057c82ff3bdf5cf54d133b5c77e4cde68244e

Observation 09a85842-da57-484d-b8a1-7020cc87cb8c · outbound

This paper cites Altschuler and Konstantin E.

Optimal Online Discrepancy Minimization in Linear Time Altschuler and Konstantin E

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:4cbe03802db8458eaf0d5b8bf21ddfb797c9fd3f057c6de435dfd72ada6947bf

Observation 689e90aa-0108-407e-acbe-3aa005dbee91 · outbound

This paper cites Online vector balancing and geometric discrepancy , booktitle =.

Optimal Online Discrepancy Minimization in Linear Time Online vector balancing and geometric discrepancy , booktitle =

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:3bb2b60226fdbfaa95aa6d19cdf22a0cfff904c212aed7901dc168f84144d65e

Observation 804e10e1-eeee-463c-a832-765c84a5d3a8 · outbound

This paper cites Online Discrepancy Minimization for Stochastic Arrivals , booktitle =.

Optimal Online Discrepancy Minimization in Linear Time Online Discrepancy Minimization for Stochastic Arrivals , booktitle =

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:0519527b57e8d16858d9a374b99ca91db3e5b631716204bd160e26c88e13f195

Observation dd414836-7986-49e1-808d-1e304a89b4e3 · outbound

This paper cites Liu, and Mehtaab Sawhney.

Optimal Online Discrepancy Minimization in Linear Time Liu, and Mehtaab Sawhney

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:766761c34f354089ce33f39b4865684de2d84a786b5cb27a88561ff93daa653a

Observation a15a6f3f-f6ef-4f8b-907d-3177c6e6517a · outbound

This paper cites Altschuler and Konstantin E.

Optimal Online Discrepancy Minimization in Linear Time Altschuler and Konstantin E

Reference 18

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:959324338c44e3a2f8501fdd3731c2513ef6222e7209a6e205db7ce11860df4e

Observation 8ee3b3a5-9c25-4a0c-8b24-7e9c4049cf90 · outbound

This paper cites Balancing vectors and Gaussian measures of n-dimensional convex bodies.

Optimal Online Discrepancy Minimization in Linear Time Balancing vectors and Gaussian measures of n-dimensional convex bodies

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:bcd37b1a822bb1ca6b0235d4016091a5f7043ea21597fa343f4c0452d07ee4c8

Observation a5a669d0-75d8-45e1-b28a-cd0a72f868b7 · outbound

This paper cites An algorithm for Koml \' o s conjecture matching Banaszczyk 's bound.

Optimal Online Discrepancy Minimization in Linear Time An algorithm for Koml \' o s conjecture matching Banaszczyk 's bound

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:a7cb8f3854a86420e74fde7c9e4e335cf9914e80b45ddf9a3e9d2fe80ff98f8e

Observation 3cf4bbfd-cd05-4d14-bfad-3623a1135679 · outbound

This paper cites The Gram-Schmidt walk: A cure for the Banaszczyk blues.

Optimal Online Discrepancy Minimization in Linear Time The Gram-Schmidt walk: A cure for the Banaszczyk blues

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:e6e5b66802d59728b3662341a27e63c01fa8c4fc2f283cb048c4813c4ea426c3

Observation 269a94e0-4b62-4260-8c89-6708bdec2a43 · outbound

This paper cites Decoupling via affine spectral-independence: Beck-Fiala and Koml \' o s bounds beyond Banaszczyk.

Optimal Online Discrepancy Minimization in Linear Time Decoupling via affine spectral-independence: Beck-Fiala and Koml \' o s bounds beyond Banaszczyk

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:e3650551abf5361b1b950dbeba677da538dcebbb871f06edb5f41dbbf81e02b3

Observation 94a11ca7-2c3b-40c0-9565-843f6823fd54 · outbound

This paper cites Online discrepancy minimization for stochastic arrivals.

Optimal Online Discrepancy Minimization in Linear Time Online discrepancy minimization for stochastic arrivals

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:4c7ecbb278ee3fabb840572cca94d05d3cf7a5bf919c9dd51ad0d4b23fdcd5c2

Observation 2a246cc7-e14b-4438-9cb9-bc705c2fdc52 · outbound

This paper cites Online vector balancing and geometric discrepancy.

Optimal Online Discrepancy Minimization in Linear Time Online vector balancing and geometric discrepancy

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:2e4291590d373cbcfe64211a16b7dd2de3d6ea1c5ca53b7f39a78ede417ca464

Observation c488e903-93b4-4d63-9567-448ba53e7f44 · outbound

This paper cites an unresolved cited work.

Optimal Online Discrepancy Minimization in Linear Time Unresolved cited work

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:daa468411455e0d148d6df7b4ef6527fc930698eef311aae6dff17a9d87f30bf

Observation 49607f88-2396-4514-bcea-8e9c13b01db9 · outbound

This paper cites an unresolved cited work.

Optimal Online Discrepancy Minimization in Linear Time Unresolved cited work

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:da495de3c4aa91558c6fb5397284feeab0c4a78b043c6daa02d0d166c98eff7e

Observation e83a9b78-3c5e-4d43-a7d9-a3ee2cfd44df · outbound

This paper cites Towards a constructive version of Banaszczyk 's vector balancing theorem.

Optimal Online Discrepancy Minimization in Linear Time Towards a constructive version of Banaszczyk 's vector balancing theorem

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:cccfc654cdcdbaef40c3a666a52a6b3cb6881a019ab3cba83c0814ed5d459fd8

Observation ca1bf754-f97e-41a9-9eff-56573e01f89c · outbound

This paper cites Optimal online discrepancy minimization.

Optimal Online Discrepancy Minimization in Linear Time Optimal online discrepancy minimization

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:7bc3d0453ab8ff2dd548d90a31ef974338750a6703151851c51063c02153351c

Observation 764301a3-149e-4bb2-bfed-a85173ea359f · outbound

This paper cites Deterministic discrepancy minimization via the multiplicative weight update method.

Optimal Online Discrepancy Minimization in Linear Time Deterministic discrepancy minimization via the multiplicative weight update method

Reference 29

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:e175fa770cb077ccd08fcde1735855e44d6b556bffcd5094831fb6d5a43beada

Observation 7141c8ac-06f0-42a4-9032-57418307e9fa · outbound

This paper cites Liu, Ashwin Sah, and Mehtaab Sawhney.

Optimal Online Discrepancy Minimization in Linear Time Liu, Ashwin Sah, and Mehtaab Sawhney

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:b0e4d43c426f5d0d4d0107612ebf5bb6e989bf622d9e470b04c2bd614b4834c7

Observation ef9b17cc-70c1-4738-b027-91648268de3e · outbound

This paper cites Discrepancy minimization via regularization.

Optimal Online Discrepancy Minimization in Linear Time Discrepancy minimization via regularization

Reference 31

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:c7a04e61982d5ed3963b8119430be7e7509e6d194d15aed73f6beafd098e13c0

Observation 45d0679b-e75d-4ea6-af6b-35c806729b7c · outbound

This paper cites Balancing games.

Optimal Online Discrepancy Minimization in Linear Time Balancing games

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-11T19:32:06.887338Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-11T19:32:06.887338Z digest=sha256:a5982c9c597c90f8fff7a3b028eac84fe0941b29b22a6904571009a07c6f748b

Pith citing papers

Observation 6e47e8da-6c6a-4bd0-8a47-8225c8c7fead · inbound

Online Beck--Fiala Down to Logarithmic Sparsity cites this paper.

Online Beck--Fiala Down to Logarithmic Sparsity Optimal Online Discrepancy Minimization in Linear Time

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-02T02:55:26.131602Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-02T02:55:26.131602Z digest=sha256:68233a4e94744f52970340f9efbe4420e33dc896df462251b27ea8d336a8dded

Observation df4ec9c4-813f-43d8-870d-58117b735417 · inbound

Online balancing of vectors with small coordinates cites this paper.

Online balancing of vectors with small coordinates Optimal Online Discrepancy Minimization in Linear Time

Reference 1

Resolution
verified exact
local_arxiv, observed 2026-08-16T00:18:06.112442Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

source=pdf_text observed=2026-08-16T00:18:05.857196Z digest=sha256:7cea4972743d2af85c3e6106a450a5ef90bde3c60a0e659c14e7e994f6a875af