{"as_of":"2026-08-19T13:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0989c23d9f3b8a25840d9df6341a934e8c674f36051b1f20f1722921f3a147d","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:38:05.978280Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2501.02012/citation-record","integrity":"/paper/2501.02012/integrity","json":"/paper/2501.02012/citation-record.json","paper":"/paper/2501.02012"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1808.06670","last_updated":"2019-02-22T18:38:15Z","snapshot_observed_at":"2026-08-14T18:39:08.324821Z","submitted_at":"2018-08-20T19:52:51Z","title":"Learning deep representations by mutual information estimation and maximization","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06670","snapshot_observed_at":"2026-08-10T22:38:05.924825Z","title":"Learning deep representations by mutual information estimation and maximization","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.924825Z"},"links":{"cited_paper":"/paper/1808.06670","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:a764fb6ef2fc0ce847862d553ba82fddc501d812997af6eb9070c08120c4f20c","observation_id":"1b809c4d-a0d3-4e60-b5b4-d9ca146f5626","resolution":{"observed_at":"2026-08-10T22:38:05.924825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.10930","last_updated":"2021-03-17T14:20:05Z","snapshot_observed_at":"2026-08-18T15:26:28.229922Z","submitted_at":"2020-07-21T16:46:05Z","title":"Towards Nonlinear Disentanglement in Natural Data with Temporal Sparse Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.10930","snapshot_observed_at":"2026-08-10T22:38:05.939042Z","title":"Towards nonlinear disentanglement in natural data with temporal sparse coding","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.939042Z"},"links":{"cited_paper":"/paper/2007.10930","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:229e348ac62ceec9bf755cb65bc93ae08f7729909e2ef1d998e1971a098b7971","observation_id":"7f614457-bace-4d3a-afcf-0aad5d4f5021","resolution":{"observed_at":"2026-08-10T22:38:05.939042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05428","last_updated":"2022-02-08T21:47:39Z","snapshot_observed_at":"2026-08-16T17:50:14.712464Z","submitted_at":"2021-10-11T17:16:19Z","title":"Learning Temporally Causal Latent Processes from General Temporal Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05428","snapshot_observed_at":"2026-08-10T22:38:05.964087Z","title":"Learning temporally causal latent processes from general temporal data","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.964087Z"},"links":{"cited_paper":"/paper/2110.05428","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:8c3dacd3c3a7f9a66c185b82edb8d22acef0fa3b7f5798062db7a564173fe712","observation_id":"6ea966d6-5edb-4b13-acb0-25a02ace5af8","resolution":{"observed_at":"2026-08-10T22:38:05.964087Z","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-10T22:38:06.245675Z","title":"Learning bias-invariant representation by cross- sample mutual information minimization","venue":null,"work_id":"f0143948-6bc5-4ffc-ba62-996c5d3b2196","year":2022},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.978280Z"},"links":{"citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:4ebbabc025aff6fd740a2630001dcc18954e94d0dd264cf6db177a6000a608fb","observation_id":"ed3c0ba3-9b42-4b9b-b9b5-96db2f8d5f72","resolution":{"observed_at":"2026-08-10T22:38:06.251435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-10T22:38:05.932041Z","title":"Auto-encoding variational bayes","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.932041Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:ae0389a100171b1402e2927e2d263008eb8a10bc5f491ca16f579f06e607e873","observation_id":"1c5799e6-00dc-4abb-b6d0-35af46226ee8","resolution":{"observed_at":"2026-08-10T22:38:05.932041Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1511.00830","last_updated":"2017-08-10T03:07:31Z","snapshot_observed_at":"2026-08-14T22:25:06.246618Z","submitted_at":"2015-11-03T09:27:49Z","title":"The Variational Fair Autoencoder","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1511.00830","snapshot_observed_at":"2026-08-10T22:38:05.945074Z","title":"The variational fair autoencoder","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.945074Z"},"links":{"cited_paper":"/paper/1511.00830","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:4d48817ba68e49dfa00c9975ddf360b4a78a5d871d409c0f6febef6a754769e8","observation_id":"d7daf160-d16d-46a6-a38c-cc73d0bfcc4b","resolution":{"observed_at":"2026-08-10T22:38:05.945074Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.04062","last_updated":"2021-08-14T18:35:05Z","snapshot_observed_at":"2026-08-14T19:55:44.931753Z","submitted_at":"2018-01-12T05:42:58Z","title":"MINE: Mutual Information Neural Estimation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.04062","snapshot_observed_at":"2026-08-10T22:38:05.919002Z","title":"Mine: Mutual information neural estimation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.919002Z"},"links":{"cited_paper":"/paper/1801.04062","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:2a3ff4c8e7eb87ce2351ff50216353ed31dc6ab281c24b60f56d1e9a8f05eb02","observation_id":"a45da6e0-6575-4a43-bae0-31738abdd59a","resolution":{"observed_at":"2026-08-10T22:38:05.919002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.03135","last_updated":"2021-02-28T20:50:46Z","snapshot_observed_at":"2026-08-18T17:55:28.040883Z","submitted_at":"2020-10-07T03:34:01Z","title":"Representation Learning for Sequence Data with Deep Autoencoding Predictive Components","version":2},"cited_work":{"arxiv_id":"2010.03135","doi":null,"metadata_source":"pith","pith_arxiv_id":"2010.03135","snapshot_observed_at":"2026-08-10T22:38:06.224290Z","title":"Representation Learning for Sequence Data with Deep Autoencoding Predictive Components","venue":"cs.LG","work_id":"c10c5012-10de-4ddd-ab5f-d806c6b77fff","year":2020},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.906817Z"},"links":{"cited_paper":"/paper/2010.03135","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:d75035dcb87e7a9c8f041e766723ab82311af462ca1aca6b7e5a1c13b61c8e20","observation_id":"05c7dffd-307a-4039-8d58-7f74f853e6a7","resolution":{"observed_at":"2026-08-10T22:38:06.232441Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.02866","last_updated":"2022-06-28T03:42:49Z","snapshot_observed_at":"2026-08-16T18:19:28.052056Z","submitted_at":"2021-06-05T10:51:26Z","title":"Conditional Contrastive Learning for Improving Fairness in Self-Supervised Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.02866","snapshot_observed_at":"2026-08-10T22:38:05.951755Z","title":"Conditional Con- trastive Learning for Improving Fairness in Self-Supervised Learning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.951755Z"},"links":{"cited_paper":"/paper/2106.02866","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:18e9ce5c09b12922100975da506f610957407154a3dfb3a033effe828cf31b10","observation_id":"df3e1478-b494-415d-9815-0201655ce149","resolution":{"observed_at":"2026-08-10T22:38:05.951755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.02051","last_updated":"2022-03-03T22:47:58Z","snapshot_observed_at":"2026-08-16T17:17:04.981561Z","submitted_at":"2022-03-03T22:47:58Z","title":"Compressed Predictive Information Coding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.02051","snapshot_observed_at":"2026-08-10T22:38:05.958092Z","title":"Compressed predictive information coding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.958092Z"},"links":{"cited_paper":"/paper/2203.02051","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:86cf0759c1c69b32d62662fd56e405ceef98ad181205a11ef84878d96bb395b8","observation_id":"f1a85f64-1cd7-4465-899e-c4edbf7b4b51","resolution":{"observed_at":"2026-08-10T22:38:05.958092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.10125","last_updated":"2024-04-08T15:38:59Z","snapshot_observed_at":"2026-08-16T15:23:14.812057Z","submitted_at":"2023-06-16T18:23:10Z","title":"Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.10125","snapshot_observed_at":"2026-08-10T22:38:05.971679Z","title":"Self-Supervised Learning for Time Series Analysis: Taxonomy, Progress, and Prospects","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.971679Z"},"links":{"cited_paper":"/paper/2306.10125","citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:af7ba6b32013bfd384a84d14366c1e4e27a75e4ac31d999f83719d839667cd03","observation_id":"4da67f5d-d746-4459-b1d2-d0b6cdd0313e","resolution":{"observed_at":"2026-08-10T22:38:05.971679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:38:05.913232Z","title":"Adult. UCI machine learning repository (1996)","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T22:38:05.913232Z"},"links":{"citing_paper":"/paper/2501.02012"},"observation_digest":"sha256:e5287a350d28f3a0c713e388209199909b38d5b794fabe17f36a726a4b5f8a17","observation_id":"1626bfde-2ef7-455e-88e4-cc4d57213122","resolution":{"observed_at":"2026-08-10T22:38:05.913232Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.02012","last_updated":"2025-01-02T13:10:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T03:32:06.230442Z","submitted_at":"2025-01-02T13:10:31Z","title":"Information Subtraction: Learning Representations for Conditional Entropy"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":10,"verified_exact":1,"verified_fuzzy":1},"total_outbound_references":12},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2501.02012."}