Paper Citation Record · LEDGER

Pareto-optimal data compression for binary classification tasks

As of 18 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:1908.08961.

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

pith.paper-citation-record.v1
1908.08961 v2

Coverage vector

measured 41 of 41 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T11:37:11.466186Z

measured 41 of 41 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

41 of 41 outbound references displayed

verified exact2
verified fuzzy21
unresolved15
parse uncertain1
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 38fbbbe5-abeb-4562-a83f-175125ffb08b · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 1

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.960733Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation dc91a0d1-237b-4983-a682-3a9432db4aad · outbound

This paper cites Pareto-optimal.

Pareto-optimal data compression for binary classification tasks Pareto-optimal

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.950367Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation eb080827-3905-4867-b032-6f045283263e · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 3

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.938973Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6313aa12-e2e9-4bcb-8f85-395dca981d5b · outbound

This paper cites While ﬁne-grained binning has no eﬀect on the entropy H(Y ) and negligible eﬀect on I(W,Y ), it dramatically reduces the entropy of our data.

Pareto-optimal data compression for binary classification tasks While ﬁne-grained binning has no eﬀect on the entropy H(Y ) and negligible eﬀect on I(W,Y ), it dramatically reduces the entropy of our data

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.927580Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 27d83836-9b30-4bc3-beb9-6a7fdafcfd62 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 5

Resolution: parse uncertain; raw_fallback, observed 2026-08-14T11:37:11.915155Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 04e0571d-75d5-46f0-8e96-327236ced78a · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.903873Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation ec74c28d-8ff0-4137-8c59-e09a6f58ed35 · outbound

This paper cites horizontal.

Pareto-optimal data compression for binary classification tasks horizontal

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.892728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 46fe6243-1bfa-42e2-b336-8ea7acb9bc42 · outbound

This paper cites For practical exam- ples where this is not the case, we can instead train a neural network to implement a function ˆw(X) that ap- proximatesP (Y =1|X).

Pareto-optimal data compression for binary classification tasks For practical exam- ples where this is not the case, we can instead train a neural network to implement a function ˆw(X) that ap- proximatesP (Y =1|X)

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.881348Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 38378edb-c842-403c-b4c0-12c43ce6fbce · outbound

This paper cites cat” and “dog.

Pareto-optimal data compression for binary classification tasks cat” and “dog

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.869574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 0882978c-b577-48af-8998-1d11824ddebe · outbound

This paper cites Pearson, The London, Edinburgh, and Dublin Philo- sophical Magazine and Journal of Science 2, 559 (1901).

Pareto-optimal data compression for binary classification tasks Pearson, The London, Edinburgh, and Dublin Philo- sophical Magazine and Journal of Science 2, 559 (1901)

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.348998Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b1687ae-0818-42e4-b4d4-2e42c89da9c1 · outbound

This paper cites Vincent, H.

Pareto-optimal data compression for binary classification tasks Vincent, H

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.852766Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 32f009d9-771f-45c1-871f-2b83f7c10485 · outbound

This paper cites Goodfellow, J.

Pareto-optimal data compression for binary classification tasks Goodfellow, J

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.842205Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 210e17e8-73f8-41b3-9daa-8d8611345974 · outbound

This paper cites Hotelling, Biometrica 28, 321 (1936).

Pareto-optimal data compression for binary classification tasks Hotelling, Biometrica 28, 321 (1936)

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.830818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a75feb88-374a-40f4-acfa-6058a37e0899 · outbound

This paper cites Eckart and G.

Pareto-optimal data compression for binary classification tasks Eckart and G

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.819791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2e8b65d2-2852-4743-9360-c50f1d0047ba · outbound

This paper cites Representation Learning with Contrastive Predictive Coding.

Pareto-optimal data compression for binary classification tasks Representation Learning with Contrastive Predictive Coding

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.368271Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30e58bf4-2cc7-4d3f-ab32-9a97e21a923b · outbound

This paper cites Unsupervised Discovery of Temporal Structure in Noisy Data with Dynamical Components Analysis.

Pareto-optimal data compression for binary classification tasks Unsupervised Discovery of Temporal Structure in Noisy Data with Dynamical Components Analysis

Reference 16

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:37:11.588977Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 189022de-06b5-40e7-b86a-57a62bd0b769 · outbound

This paper cites Latent Representations of Dynamical Systems: When Two is Better Than One.

Pareto-optimal data compression for binary classification tasks Latent Representations of Dynamical Systems: When Two is Better Than One

Reference 17

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T11:37:11.574169Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 18a0ce77-458d-47eb-b648-8998b87acd63 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 18

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.809089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 59509662-99a3-490d-885c-4679d9670240 · outbound

This paper cites The information bottleneck method.

Pareto-optimal data compression for binary classification tasks The information bottleneck method

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.384611Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3683d3b-f86d-49cf-a63b-455d64f82217 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 20

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.798218Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation bbe65587-c730-46a8-94b9-767802a77a56 · outbound

This paper cites Strouse and D.

Pareto-optimal data compression for binary classification tasks Strouse and D

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.787224Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e32028a3-7685-47d6-ba6c-b4495b7e59fd · outbound

This paper cites Deep Variational Information Bottleneck.

Pareto-optimal data compression for binary classification tasks Deep Variational Information Bottleneck

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.395652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 08d40677-14f9-41fb-b37c-3862c10611da · outbound

This paper cites Chalk, O.

Pareto-optimal data compression for binary classification tasks Chalk, O

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.776371Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7c449589-33ad-4015-893b-651370f5ad91 · outbound

This paper cites Fischer, The conditional entropy bottleneck (2018), URL openreview.net/forum?id=rkVOXhAqY7.

Pareto-optimal data compression for binary classification tasks Fischer, The conditional entropy bottleneck (2018), URL openreview.net/forum?id=rkVOXhAqY7

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.765566Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation eebcaa25-a51c-417f-8ceb-456ef5a62327 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 25

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.753050Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1cc6e1c5-5433-4ad4-8cf7-f4e0cee88571 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 26

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.740778Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 558fae5b-f52c-4f3d-9696-a1b35edd45b3 · outbound

This paper cites Krizhevsky, V.

Pareto-optimal data compression for binary classification tasks Krizhevsky, V

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.728552Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation eeed6527-c4d4-4877-a313-6a241e387a0d · outbound

This paper cites LeCun, C.

Pareto-optimal data compression for binary classification tasks LeCun, C

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.716858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 32ea6d03-0c0a-4ee7-99e6-830449ae146e · outbound

This paper cites Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms.

Pareto-optimal data compression for binary classification tasks Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.422040Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6cf7d575-bd44-4364-83b5-17af2b846f44 · outbound

This paper cites Krizhevsky and G.

Pareto-optimal data compression for binary classification tasks Krizhevsky and G

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.704542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation fcbd7edd-83b8-4ad5-8668-ee539383fa16 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 31

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.692427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6978ab25-d0cb-4c1e-a88e-50c432e20a0b · outbound

This paper cites Strouse and D.

Pareto-optimal data compression for binary classification tasks Strouse and D

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.680887Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3e7b895e-cd08-42a3-a63b-931b375ea196 · outbound

This paper cites Learnability for the Information Bottleneck.

Pareto-optimal data compression for binary classification tasks Learnability for the Information Bottleneck

Reference 33

Resolution: verified exact; local_arxiv, observed 2026-08-14T11:37:11.529986Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 90fa8ec3-7f24-4975-a643-d64469240080 · outbound

This paper cites an unresolved cited work.

Pareto-optimal data compression for binary classification tasks Unresolved cited work

Reference 34

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:37:11.669464Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 4eebc3ea-c3be-48d5-adf5-dea63323d292 · outbound

This paper cites Thompson, A.

Pareto-optimal data compression for binary classification tasks Thompson, A

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.657073Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9744f4e4-edeb-4ba8-bdba-515d05e4878f · outbound

This paper cites Blahut, IEEE transactions on Information Theory 18, 460 (1972).

Pareto-optimal data compression for binary classification tasks Blahut, IEEE transactions on Information Theory 18, 460 (1972)

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.646255Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b9818b7d-d45a-42aa-9b65-50c190056c32 · outbound

This paper cites Arimoto, IEEE Transactions on Information Theory 18, 14 (1972).

Pareto-optimal data compression for binary classification tasks Arimoto, IEEE Transactions on Information Theory 18, 14 (1972)

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.634404Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f41b4128-7152-4571-a7e5-bd7e26ee9960 · outbound

This paper cites Chechik, A.

Pareto-optimal data compression for binary classification tasks Chechik, A

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.623008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c2b97526-10fe-4ffa-97a2-661777e3e967 · outbound

This paper cites Taming VAEs.

Pareto-optimal data compression for binary classification tasks Taming VAEs

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-14T11:37:11.458847Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30afbe29-efc8-4402-b17c-fcd039a21249 · outbound

This paper cites Achille and S.

Pareto-optimal data compression for binary classification tasks Achille and S

Reference 40

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:37:11.611579Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b2cb2c05-7c94-4964-bdb7-93fe310d284e · outbound

This paper cites Thermodynamic cost and benefit of memory.

Pareto-optimal data compression for binary classification tasks Thermodynamic cost and benefit of memory

Reference 41

Resolution: metadata mismatch; local_arxiv, observed 2026-08-14T11:37:11.502740Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Pith citing papers

No inbound Pith citation observations are available.