{"as_of":"2026-08-18T06:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d4dda4d3f4435c0fc07c47d6640296e45377a086e7ff2d721486e90c854cc8f","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:37:11.466186Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/1908.08961/citation-record","integrity":"/paper/1908.08961/integrity","json":"/paper/1908.08961/citation-record.json","paper":"/paper/1908.08961"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.957141Z","title":null,"venue":null,"work_id":"a4b93707-b479-462e-932c-e4eadc860eb4","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.309989Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:de41326345e64deb2e6061a0726a924704a4c17e6bbad0c48a46e5b53c307bbd","observation_id":"38fbbbe5-abeb-4562-a83f-175125ffb08b","resolution":{"observed_at":"2026-08-14T11:37:11.960733Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.946561Z","title":"Pareto-optimal","venue":null,"work_id":"1f8101c8-36d2-478d-be36-560ebca6fe6a","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.315223Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:04a1d02c474fd33ee4402f76bf3ee27be9e55a2caf0bc91b810b371a28c03edc","observation_id":"dc91a0d1-237b-4983-a682-3a9432db4aad","resolution":{"observed_at":"2026-08-14T11:37:11.950367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.934759Z","title":null,"venue":null,"work_id":"af990d3b-6204-486d-856e-59e5cf6fa6ea","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.319315Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:d1002c2158c7cc78e0e3022115f910ac6765477be8b52d8bb60433e4f3ab8580","observation_id":"eb080827-3905-4867-b032-6f045283263e","resolution":{"observed_at":"2026-08-14T11:37:11.938973Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.923311Z","title":"While fine-grained binning has no effect on the entropy H(Y ) and negligible effect on I(W,Y ), it dramatically reduces the entropy of our data","venue":null,"work_id":"870c6dd1-2581-47f6-adcd-5b9da42e6976","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.323609Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:02c0311fb68e3b2bed8bfbf0dd974dd0304ffe594b98d2ece97943003d0906be","observation_id":"6313aa12-e2e9-4bcb-8f85-395dca981d5b","resolution":{"observed_at":"2026-08-14T11:37:11.927580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.911232Z","title":null,"venue":null,"work_id":"3d470967-51e0-4a9b-8ab1-663d1a9a06f5","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.327759Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:c1d39705a9c58ab499bed79b5095044dab547c8d8b9d8ff380b437a454cca3b4","observation_id":"27d83836-9b30-4bc3-beb9-6a7fdafcfd62","resolution":{"observed_at":"2026-08-14T11:37:11.915155Z","resolver_source":"raw_fallback","status":"parse_uncertain"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.900189Z","title":null,"venue":null,"work_id":"2f91fa37-543d-4003-844c-cdeef500e9ef","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.331962Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:3f61e71f33083ba31a3f910b8edb9c992c88cb51e0cb0c1aed50c078e8f45844","observation_id":"04e0571d-75d5-46f0-8e96-327236ced78a","resolution":{"observed_at":"2026-08-14T11:37:11.903873Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.888856Z","title":"horizontal","venue":null,"work_id":"082177a5-a305-4791-ab90-b303195f0982","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.336207Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:23d73a9d3726aaba33d21ffe23f3acff4d972fad36cd0ab6e8ed0550897a8965","observation_id":"ec74c28d-8ff0-4137-8c59-e09a6f58ed35","resolution":{"observed_at":"2026-08-14T11:37:11.892728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.877359Z","title":"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)","venue":null,"work_id":"7f2517c1-1543-46ad-9696-9efefbd44a7e","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.340395Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:ad01f4bbcd3a3238c3257e5ef8884d1ba51e487e2c4a874011e0731ad1041093","observation_id":"46fe6243-1bfa-42e2-b336-8ea7acb9bc42","resolution":{"observed_at":"2026-08-14T11:37:11.881348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.866153Z","title":"cat” and “dog","venue":null,"work_id":"8e3db02d-0198-4fc0-9faf-ee806222dd39","year":null},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.344197Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:5712ca5c89f220f448682973a182ee9656e88b201075dd4ace2188dd92a6605c","observation_id":"38378edb-c842-403c-b4c0-12c43ce6fbce","resolution":{"observed_at":"2026-08-14T11:37:11.869574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.348998Z","title":"Pearson, The London, Edinburgh, and Dublin Philo- sophical Magazine and Journal of Science 2, 559 (1901)","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.348998Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:91c47cb4db1c90e655c54706cc8b894d6f22ba46ce39b27a4f17fa1f8d4e1246","observation_id":"0882978c-b577-48af-8998-1d11824ddebe","resolution":{"observed_at":"2026-08-14T11:37:11.348998Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.848829Z","title":"Vincent, H","venue":null,"work_id":"10aa0d62-8391-41ba-8e17-3cb9df40a671","year":2008},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.352637Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:511bbf41b9b2c237f0a631a2dd0dc64c9be93fe5a912440b243dbf5f79c502fd","observation_id":"8b1687ae-0818-42e4-b4d4-2e42c89da9c1","resolution":{"observed_at":"2026-08-14T11:37:11.852766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.838265Z","title":"Goodfellow, J","venue":null,"work_id":"9e84eb2e-7d76-4eb0-b5a3-c0bde1a0a9f1","year":2014},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.356577Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:ac1f0149bf8f8da0ce9e2432396d7f05361f64fded61301b0ddc8e73171ea5d2","observation_id":"32f009d9-771f-45c1-871f-2b83f7c10485","resolution":{"observed_at":"2026-08-14T11:37:11.842205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.826846Z","title":"Hotelling, Biometrica 28, 321 (1936)","venue":null,"work_id":"369fa914-c44d-447d-aac2-20bdfd4401d7","year":1936},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.360456Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:471b3a648bdf23ce946f36b1b782b3a58477e8f4680ae66c4f25fea25dcec15f","observation_id":"210e17e8-73f8-41b3-9daa-8d8611345974","resolution":{"observed_at":"2026-08-14T11:37:11.830818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.816109Z","title":"Eckart and G","venue":null,"work_id":"5b0e033a-9209-49a6-9785-c25c75604cd1","year":1936},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.364458Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:fbb62ba66ab6897644c774265f830f76f1f051008389b82d9b63cc940eda92dd","observation_id":"a75feb88-374a-40f4-acfa-6058a37e0899","resolution":{"observed_at":"2026-08-14T11:37:11.819791Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-14T11:37:11.368271Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.368271Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:a61f0528e29db96f2bae3b696bf32d61bb9b2be8df489a46bdd1252261bca8bc","observation_id":"2e8b65d2-2852-4743-9360-c50f1d0047ba","resolution":{"observed_at":"2026-08-14T11:37:11.368271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.09944","last_updated":"2019-10-27T23:28:52Z","snapshot_observed_at":"2026-08-17T03:51:01.323473Z","submitted_at":"2019-05-23T21:47:56Z","title":"Unsupervised Discovery of Temporal Structure in Noisy Data with Dynamical Components Analysis","version":2},"cited_work":{"arxiv_id":"1905.09944","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.09944","snapshot_observed_at":"2026-08-14T11:37:11.585115Z","title":"Unsupervised Discovery of Temporal Structure in Noisy Data with Dynamical Components Analysis","venue":"cs.IT","work_id":"c030be11-f01b-4a00-886f-af9f480e211d","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.372802Z"},"links":{"cited_paper":"/paper/1905.09944","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:e399f1357cc69abd6eab647d0e2236350a17ecde1287fea0220164ae07962d3b","observation_id":"30e58bf4-2cc7-4d3f-ab32-9a97e21a923b","resolution":{"observed_at":"2026-08-14T11:37:11.588977Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.03364","last_updated":"2019-02-20T20:38:49Z","snapshot_observed_at":"2026-08-15T16:26:57.526968Z","submitted_at":"2019-02-09T03:14:39Z","title":"Latent Representations of Dynamical Systems: When Two is Better Than One","version":2},"cited_work":{"arxiv_id":"1902.03364","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.03364","snapshot_observed_at":"2026-08-14T11:37:11.569992Z","title":"Latent Representations of Dynamical Systems: When Two is Better Than One","venue":"physics.data-an","work_id":"8e72bb0e-d131-4b3d-bab0-1f86b9f875fc","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.376875Z"},"links":{"cited_paper":"/paper/1902.03364","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:4f4c0cd0098e7ffbe40ba1fe9c61a4145b5280f8ee3fc2d3b27b334e26548d40","observation_id":"189022de-06b5-40e7-b86a-57a62bd0b769","resolution":{"observed_at":"2026-08-14T11:37:11.574169Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.804862Z","title":null,"venue":null,"work_id":"dd4aee12-a684-4e9f-b89b-f2e808c2fb2e","year":2014},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.380890Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:0216c3feb6236c1cdf647df4f32d32482a2e8942c1c002f0700d2c62b2728611","observation_id":"18a0ce77-458d-47eb-b648-8998b87acd63","resolution":{"observed_at":"2026-08-14T11:37:11.809089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"physics/0004057","last_updated":"2000-04-24T15:22:30Z","snapshot_observed_at":"2026-08-16T09:10:10.815975Z","submitted_at":"2000-04-24T15:22:30Z","title":"The information bottleneck method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"physics/0004057","snapshot_observed_at":"2026-08-14T11:37:11.384611Z","title":"Tishby, F","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.384611Z"},"links":{"cited_paper":"/paper/physics/0004057","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:f1167501368afbbcbbf6fb79a96abf0d7d64c232d3e7321f6470a724834dd149","observation_id":"59509662-99a3-490d-885c-4679d9670240","resolution":{"observed_at":"2026-08-14T11:37:11.384611Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.794481Z","title":null,"venue":null,"work_id":"9662b03c-3d6f-4a37-9a57-387a2fcd9217","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.388667Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:9e5ebb11b20320be71252f43f2dd1400f589ecd5485842530971ee5ece5e8f4e","observation_id":"b3683d3b-f86d-49cf-a63b-455d64f82217","resolution":{"observed_at":"2026-08-14T11:37:11.798218Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.783256Z","title":"Strouse and D","venue":null,"work_id":"c29fbbb9-e42e-452a-98c5-2c0a958a6025","year":2017},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.392286Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:b66857490a51ddef35f6147fc9613aac230a11af7611ab045172364b50e37fba","observation_id":"bbe65587-c730-46a8-94b9-767802a77a56","resolution":{"observed_at":"2026-08-14T11:37:11.787224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.00410","last_updated":"2019-10-23T22:47:44Z","snapshot_observed_at":"2026-08-16T15:45:06.346529Z","submitted_at":"2016-12-01T20:12:40Z","title":"Deep Variational Information Bottleneck","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.00410","snapshot_observed_at":"2026-08-14T11:37:11.395652Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.395652Z"},"links":{"cited_paper":"/paper/1612.00410","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:d2d876a9c15f13f4a14655813f7babad5169a0a9219949561d13dc0f287f9823","observation_id":"e32028a3-7685-47d6-ba6c-b4495b7e59fd","resolution":{"observed_at":"2026-08-14T11:37:11.395652Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.772604Z","title":"Chalk, O","venue":null,"work_id":"34a1df84-94c6-4611-8d37-0aec12654f99","year":2016},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.399504Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:bc791799e6d0c0f89d55c451572ae6b2dba2e9cbce051fdbc3e854b34bb3d232","observation_id":"08d40677-14f9-41fb-b37c-3862c10611da","resolution":{"observed_at":"2026-08-14T11:37:11.776371Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.760940Z","title":"Fischer, The conditional entropy bottleneck (2018), URL openreview.net/forum?id=rkVOXhAqY7","venue":null,"work_id":"4c144815-cf51-4800-99f7-db25e61ddb61","year":2018},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.403760Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:f2e22d467ecbe6dded7411b2ee6d3da1af0d7609aca92ff371ec3e0d9e5d725d","observation_id":"7c449589-33ad-4015-893b-651370f5ad91","resolution":{"observed_at":"2026-08-14T11:37:11.765566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.748709Z","title":null,"venue":null,"work_id":"0025dc98-a505-4472-8b1d-1ab4abf76175","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.407149Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:dcac5267ea0f10d61c6cde8c8d2ece989b8b1719c4d1c80a8e885b99c48d191b","observation_id":"eebcaa25-a51c-417f-8ceb-456ef5a62327","resolution":{"observed_at":"2026-08-14T11:37:11.753050Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.736686Z","title":null,"venue":null,"work_id":"9900a6b7-9c73-45e9-8b10-e0025b277282","year":2005},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.410738Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:a4250845065eaacf38c7a753a80c03fd1cda0885013952ab6a21902d97fdb86d","observation_id":"1cc6e1c5-5433-4ad4-8cf7-f4e0cee88571","resolution":{"observed_at":"2026-08-14T11:37:11.740778Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.724594Z","title":"Krizhevsky, V","venue":null,"work_id":"7cb50910-b7c9-4044-97cf-f735973bb238","year":2014},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.414346Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:b62ad0cea3b203e44799535f8fa6af247e2b88fccd6668c1f2d6ceaddceaa9f1","observation_id":"558fae5b-f52c-4f3d-9696-a1b35edd45b3","resolution":{"observed_at":"2026-08-14T11:37:11.728552Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.712190Z","title":"LeCun, C","venue":null,"work_id":"84c4a944-a9e5-483f-b21d-f2e377dacc00","year":2010},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.418370Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:90124bb83bf698acb1c0c30cc28346e30e10d2306ae213bcb68c78eb9b350569","observation_id":"eeed6527-c4d4-4877-a313-6a241e387a0d","resolution":{"observed_at":"2026-08-14T11:37:11.716858Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1708.07747","last_updated":"2017-09-15T21:29:49Z","snapshot_observed_at":"2026-08-13T15:13:33.081929Z","submitted_at":"2017-08-25T14:01:29Z","title":"Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1708.07747","snapshot_observed_at":"2026-08-14T11:37:11.422040Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.422040Z"},"links":{"cited_paper":"/paper/1708.07747","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:9f9ea9dc5d74fb8f24d9e226c396112e01a6fc9120998fdae588a16e872921a3","observation_id":"32ea6d03-0c0a-4ee7-99e6-830449ae146e","resolution":{"observed_at":"2026-08-14T11:37:11.422040Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.700556Z","title":"Krizhevsky and G","venue":null,"work_id":"ef1ea6ed-f097-4fcb-bb52-0c521c363d00","year":2009},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.425568Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:9b8c229fa8f5e6cc8bb1c9126691e88b86351d06f760746c47b1ff4ca9d959fb","observation_id":"6cf7d575-bd44-4364-83b5-17af2b846f44","resolution":{"observed_at":"2026-08-14T11:37:11.704542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.688528Z","title":null,"venue":null,"work_id":"e0f6f460-5e3a-44f7-bfc2-f1f1c28cdddb","year":2016},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.429483Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:3ba9be082a524d735175147d8b0ec60f3cf6de4e62d44b9020b4b4f98afb3ab4","observation_id":"fcbd7edd-83b8-4ad5-8668-ee539383fa16","resolution":{"observed_at":"2026-08-14T11:37:11.692427Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.677267Z","title":"Strouse and D","venue":null,"work_id":"0becae1f-bb90-4a39-b49b-123d06a171de","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.433109Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:3b3e2c86cb155d9c9f46e2a5fc67a6cb4a1396b86dda429e0b36e1155bed3797","observation_id":"6978ab25-d0cb-4c1e-a88e-50c432e20a0b","resolution":{"observed_at":"2026-08-14T11:37:11.680887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.07331","last_updated":"2019-07-17T04:48:01Z","snapshot_observed_at":"2026-08-14T16:05:15.347133Z","submitted_at":"2019-07-17T04:48:01Z","title":"Learnability for the Information Bottleneck","version":1},"cited_work":{"arxiv_id":"1907.07331","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.07331","snapshot_observed_at":"2026-08-14T11:37:11.526099Z","title":"Learnability for the Information Bottleneck","venue":"cs.LG","work_id":"a1784db2-3986-4b64-90f7-e6494a359ad8","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.436810Z"},"links":{"cited_paper":"/paper/1907.07331","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:b64ed58a6163e91e12dafbb032bb6fd24f9048074e3bb4d15f94fe0b3c1094bf","observation_id":"3e7b895e-cd08-42a3-a63b-931b375ea196","resolution":{"observed_at":"2026-08-14T11:37:11.529986Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.664898Z","title":null,"venue":null,"work_id":"2e3010d3-ba07-4e0d-8d7c-65b9bbe30ac3","year":2019},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.440569Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:465f5f31b5034bb37e948e85cfb536c01415285373980b9b53a1dc6e40dd2bfa","observation_id":"90fa8ec3-7f24-4975-a643-d64469240080","resolution":{"observed_at":"2026-08-14T11:37:11.669464Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.653468Z","title":"Thompson, A","venue":null,"work_id":"0f0d29b0-244f-485b-9dd3-89492ac2f0a4","year":2018},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.444007Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:6d1d1023950317009f0c550b7d332e5000209c814137c62892df269cfb07b2e1","observation_id":"4eebc3ea-c3be-48d5-adf5-dea63323d292","resolution":{"observed_at":"2026-08-14T11:37:11.657073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.642289Z","title":"Blahut, IEEE transactions on Information Theory 18, 460 (1972)","venue":null,"work_id":"ca67a6e5-20c2-40df-a7e9-e9db069aa341","year":1972},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.448028Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:f5fdfaa0a75e6324935f8db4fdf098935a647790b47d95521819247bc2a745ac","observation_id":"9744f4e4-edeb-4ba8-bdba-515d05e4878f","resolution":{"observed_at":"2026-08-14T11:37:11.646255Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.630420Z","title":"Arimoto, IEEE Transactions on Information Theory 18, 14 (1972)","venue":null,"work_id":"ceff9b8e-23fa-431a-83f4-4ba4e06c36f5","year":1972},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.451625Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:eb87e276372c4ac83ef0347479e24f5f508be7b2f2d7ac7903996b9893685544","observation_id":"b9818b7d-d45a-42aa-9b65-50c190056c32","resolution":{"observed_at":"2026-08-14T11:37:11.634404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.619016Z","title":"Chechik, A","venue":null,"work_id":"f44b1a38-9f63-40de-8022-3638de87c680","year":2005},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.455262Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:930cba4318c1ffd8af71f5ac1b2b2c88fc7e5ae5fabacd084ed2fbbcaf0b59b5","observation_id":"f41b4128-7152-4571-a7e5-bd7e26ee9960","resolution":{"observed_at":"2026-08-14T11:37:11.623008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.00597","last_updated":"2018-10-01T09:53:41Z","snapshot_observed_at":"2026-08-14T18:21:15.774784Z","submitted_at":"2018-10-01T09:53:41Z","title":"Taming VAEs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.00597","snapshot_observed_at":"2026-08-14T11:37:11.458847Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.458847Z"},"links":{"cited_paper":"/paper/1810.00597","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:4469a0376bbe0766cb8bc31c836ae881f884140d34e59b27b7573ff3f50f4e64","observation_id":"c2b97526-10fe-4ffa-97a2-661777e3e967","resolution":{"observed_at":"2026-08-14T11:37:11.458847Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:37:11.607271Z","title":"Achille and S","venue":null,"work_id":"6a7ce63d-2868-44eb-8b09-a56034a0ea95","year":2018},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.462742Z"},"links":{"citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:a81781dcff0f4dad8ee69f9ac7183809201ec34b3c8ce55e1bf0ceb945f823fb","observation_id":"30afbe29-efc8-4402-b17c-fcd039a21249","resolution":{"observed_at":"2026-08-14T11:37:11.611579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.00612","last_updated":"2019-10-03T14:12:46Z","snapshot_observed_at":"2026-08-16T20:33:44.408621Z","submitted_at":"2017-04-29T21:35:26Z","title":"Thermodynamic cost and benefit of memory","version":3},"cited_work":{"arxiv_id":"1705.00612","doi":null,"metadata_source":"pith","pith_arxiv_id":"1705.00612","snapshot_observed_at":"2026-08-14T11:37:11.496328Z","title":"Thermodynamic cost and benefit of memory","venue":"cond-mat.stat-mech","work_id":"9ef58bcc-2ab7-409f-99df-561c23587114","year":2017},"citing_paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:37:11.466186Z"},"links":{"cited_paper":"/paper/1705.00612","citing_paper":"/paper/1908.08961"},"observation_digest":"sha256:83fca3eaa5a98effc311ce06721a3849872731ac74087c538c7070175ff1a19a","observation_id":"b2cb2c05-7c94-4964-bdb7-93fe310d284e","resolution":{"observed_at":"2026-08-14T11:37:11.502740Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.08961","last_updated":"2020-01-15T18:43:57Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T11:22:57.544581Z","submitted_at":"2019-08-23T18:00:40Z","title":"Pareto-optimal data compression for binary classification tasks"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":1,"unresolved":15,"verified_exact":2,"verified_fuzzy":21},"total_outbound_references":41},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"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."}