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:325d2c18a50fb8535157add205e2b238b590d5c0fe8fecb40a7d12f473c744dd

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:2440d94f42ae574c80ff0cec0e4d8737561d9acbe12e7ca4891d344777c39603

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:5b1c854df7fe89b5462d6518854ac17f24dc614665b29f4bd697c86ece9cde8b

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:9f1bbcb2f6021e919d48d710a99a84b6b950ae724a3e3e8e7eb0ae3640be5118

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:ff35cc5938349df2e9eb55c256c0483d26b2ef47b79eca8878ed7bc69467da11

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:2103ae5a664e07155f93283f9bdf844d82714554e32d271dfa0ca02875291a0c

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:2ecb4dc5bd79a8746a5d0e02ab7d2588f43a4ce5b73eeb0a942a4a8a4ee4c04f

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:e112c41bfb85a47a021fd996e111be417899588a3f9a92bb82f46f755fa7e8fd

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:2c8f53d780d982b11aef18d5b6ba8a055132e1477ce37bf969405c8e1b4baaa8

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:73b21405fa904d5dfbe0daf7c5ca1fcdc379ba5bd003c3205b9ac05b7d70f715

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:83806a5201a56a314ad6e78b5f8dc61f1c53a17b609902a02f7bd94382b5471c

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:a0293872d257fea4ab56a8e807e60a9ce4293cc49d489226e5bacd4110eb831d

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:94861154358692021c0645f742032b22f1e27bdb150a9dc1bb07636177fe4f9d

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:8873a80db41d7363c2e2eb8e92b1c2b7ef905a6f3c67f6a1d7cc3c7d2ff3a803

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:baba1a3a73b593b53b122279b4d4beac287c89aeacd924bf8ff1de63731c60df

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:a1138ad568c47e45127dbfc8f382efe59719fc95f7b429f6119534168f7d9d0e

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:1478ad48a103531551ce33b43dd2b109273d17e8f875f0b87debf2708ddfc1f3

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:33527d9911fae070c52fafabeb52f4408d0e241aa8dfec3e1adb91a6986c9b18

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:54198267fd96d46178a9b3bda7771c66d9a87adf143b1b4262096b0f4832c55b

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:1c045795ce63b962576fe4b67644ece6b9a03b48191d7689d201b0b63a2d5d00

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:54fec8959890ad4ffd347726604c3e338928f70d9e11596bf159f1fd246e63a3

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:d337747fea88ad1be93593268b1628520156cf666a6e3bb57d4204a98fe8f4a9

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:b357c3ae9e79f2ee7a28a28bcc34d31b703a51775a3d540bdce3f8f308412a77

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:b635b519f448032961d977c4550ed1e609ebdfeb92ca4b67c95881cf5c97b572

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:43f1f299aac412b4f05b74f5969ed11463ee84e564ad06aed29af85e22eeb01a

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:297233a15a4c29fa797ed8bdea9dad81a9b027793a0e6cfc18277260cdc9fc35

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:c616de1da4955b6e84019dd7120ec9b6bbbbf37b3b9673344ad9f51672dc5d2c

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:6c9c1c0417227dc414248c88cdab6863a637064a462feb8a72756b4082588b67

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:0d87a438dcc85c4973580a38fe615d41481309d5e5bca15b9242c8109ec4d7c2

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:87e2cf6c2d1d9ecc9bd2505de4ef5611bf3f550a3354016156468a71ef41728a

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:a34f8f07e541c00b39fb6098e7077d2524478d27467685b16741f6d9b855f71b

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:3bdf51836d9800a5f72ee6a0fb3b325c55b315782dc18f862a4b1539733cc240

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:0083ee79e5ffbc34948bed629df7a1f011e30028c0067b9a3be66c9379fc918f

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:20433e8d099150353a180d01ccf61d409948592a72200883fa10c25a498ae361