{"as_of":"2026-08-07T18:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8598b1377b52bbecc878654f8b1d30ad0cdd66ced45b02fab2ce9c19f54e85f","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:16:55.731433Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.11511/citation-record","integrity":"/paper/2506.11511/integrity","json":"/paper/2506.11511/citation-record.json","paper":"/paper/2506.11511"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:16:55.416164Z","title":"Reinforcement learning: Theory and algorithms","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.416164Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:9126e45a27ef0b5ccb5cd728274f3314cd2bf96c873f2102075c06b48ba5cc97","observation_id":"bf7e6fbc-77f8-47f2-ab16-798a618d312f","resolution":{"observed_at":"2026-08-07T04:16:55.416164Z","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-07T04:16:56.729911Z","title":"Learning markov state abstractions for deep reinforcement learning","venue":null,"work_id":"6b76842d-6c72-4758-aeb1-0ca67514cea0","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.422318Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:3ea50aa9c36cc21d56eece45f3d08b5c3f15e1fccaf40e518259fc4959ecdc92","observation_id":"3ebbff07-4692-4666-a436-75573f05b67d","resolution":{"observed_at":"2026-08-07T04:16:56.735189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","submitted_at":"2019-07-05T15:26:26Z","title":"Invariant Risk Minimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.02893","snapshot_observed_at":"2026-08-07T04:16:55.427129Z","title":"Invariant risk minimization, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.427129Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:31aca1d720ac2667a1c592843790804ec58bed20994faffbb4ce7ce6953d0f05","observation_id":"d35d9e0d-98ba-44db-9593-9138bf0e3a24","resolution":{"observed_at":"2026-08-07T04:16:55.427129Z","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-07T04:16:56.712905Z","title":"Uniform deviation bounds for k-means clustering","venue":null,"work_id":"85bcdea8-501b-4fc6-9cc9-d449beb42833","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.433614Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:d8ad3fdc6c7576a15953ee2776d983c0fbf16b9dd27c8537a7710730e0c5eafe","observation_id":"ed211e92-5d92-43d8-af03-9c2a6effafa4","resolution":{"observed_at":"2026-08-07T04:16:56.718179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.695642Z","title":"Recognition in terra incognita","venue":null,"work_id":"1d94c697-8a6e-4f94-8d9d-ecce98381c46","year":2018},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.440472Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:99c7c37f429f1192a13952958518995966535437b79493398aa01c029cffb3d4","observation_id":"3777c9d3-e49c-4513-87aa-b8b4cf52145f","resolution":{"observed_at":"2026-08-07T04:16:56.700967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.678435Z","title":"Swad: Domain generalization by seeking flat minima","venue":null,"work_id":"8e1bbd98-2f4f-4238-b61d-afdebbae7197","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.446422Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:e8b5b307a027079e28f1120deace1f699272966e8f870c1ba7833cf8e7167592","observation_id":"ada4ab60-5183-45cf-b94a-570f4d9b65ec","resolution":{"observed_at":"2026-08-07T04:16:56.684845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.02136","last_updated":"2017-03-02T06:28:13Z","snapshot_observed_at":"2026-07-06T05:21:41.572083Z","submitted_at":"2016-12-07T07:45:38Z","title":"Mode Regularized Generative Adversarial Networks","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1612.02136","snapshot_observed_at":"2026-08-07T04:16:55.452913Z","title":"Mode regularized generative adversarial networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.452913Z"},"links":{"cited_paper":"/paper/1612.02136","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:eee050d3c00318735e6c6a28e78824f18788bf569b3e455a79c4c7e870e05c73","observation_id":"186036ca-026e-4dfa-8db1-81d74aa15072","resolution":{"observed_at":"2026-08-07T04:16:55.452913Z","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-07T04:16:55.458366Z","title":"A simple framework for contrastive learning of visual representations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.458366Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:52f697fc951885cd5991fcd05728cecad6561344c9113ecb3832b25855597acd","observation_id":"83321dcd-c73d-42a8-8325-3beef1be9a49","resolution":{"observed_at":"2026-08-07T04:16:55.458366Z","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-07T04:16:56.653111Z","title":"Exploring simple siamese representation learning","venue":null,"work_id":"0746dcd0-7560-4d46-bbaa-b88603125566","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.463132Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:4a1ddc342123d2aa5b92121617d5d3d8b0f51705de3f69ef8eb62dc98b9d1580","observation_id":"d7a916e4-313e-4958-ab4b-1990487e8e4e","resolution":{"observed_at":"2026-08-07T04:16:56.658095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.00341","last_updated":"2020-04-30T09:02:45Z","snapshot_observed_at":"2026-08-06T03:57:57.420510Z","submitted_at":"2020-04-30T09:02:45Z","title":"Jukebox: A Generative Model for Music","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.00341","snapshot_observed_at":"2026-08-07T04:16:55.467728Z","title":"Jukebox: A generative model for music","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.467728Z"},"links":{"cited_paper":"/paper/2005.00341","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:cf58bd4ff24856c081a7981246cea415a9c681898c95b1260a3a9df39ed95643","observation_id":"fdc96c11-7674-441c-9b0d-40bf8b35d407","resolution":{"observed_at":"2026-08-07T04:16:55.467728Z","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-07T04:16:56.637319Z","title":"Taming transformers for high-resolution image synthesis","venue":null,"work_id":"63a65ec2-069b-4461-ab8a-200448e3adf5","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.472404Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:7fedadeec849308d809a07999f3f3814c76945f3647f368e99b5a6ea1f8d4ef2","observation_id":"a0364ea1-e672-4497-9735-ef5ee261aec3","resolution":{"observed_at":"2026-08-07T04:16:56.642676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.622396Z","title":"Domain-adversarial training of neural networks","venue":null,"work_id":"26760ce3-c2d0-4085-82a9-3e8e414ce5a1","year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.477022Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:5686be137103124a43563156cccd1e1ddab8aa8b681e00f316c5872c4d71b405","observation_id":"7494cb5e-239f-434b-86f6-165487390d29","resolution":{"observed_at":"2026-08-07T04:16:56.626978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.607139Z","title":"Domain adaptation with conditional transferable components","venue":null,"work_id":"f9c372e8-a8fa-41ca-84f3-a5919bb3bb79","year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.481830Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:1e10e5cdc49267919e28e02119351cf4fb4f162d0f734ded83f4d5d1bbdba103","observation_id":"169c7ed6-8225-4815-8093-e6364ed3965e","resolution":{"observed_at":"2026-08-07T04:16:56.611786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:55.487890Z","title":"Generative adversarial nets","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.487890Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:2511fbb7b86f837a2d927a48181d47f30fda0fcaf47775e69daf50f9f160449a","observation_id":"ae7f0c89-438f-4939-a2b3-30f02c5c74e1","resolution":{"observed_at":"2026-08-07T04:16:55.487890Z","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-07T04:16:56.576541Z","title":"In search of lost domain generalization","venue":null,"work_id":"8859f324-b65f-44aa-9d5b-88cb39facabb","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.492631Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:8bec40d2b43e670c899ddc6519eb668f6c3efb16ca7c2187f8c6d763e3d8a1f3","observation_id":"95318ad9-ae30-4c76-b6b4-fed036efa422","resolution":{"observed_at":"2026-08-07T04:16:56.581545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02193","last_updated":"2022-02-12T20:01:53Z","snapshot_observed_at":"2026-08-02T12:02:13.904371Z","submitted_at":"2020-10-05T17:52:14Z","title":"Mastering Atari with Discrete World Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02193","snapshot_observed_at":"2026-08-07T04:16:55.497378Z","title":"Mastering atari with discrete world models","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.497378Z"},"links":{"cited_paper":"/paper/2010.02193","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:a2fc5f7816bd1852700932d02c4bde0687223a10764b887b977a60378056bb88","observation_id":"4374a91c-a127-42e1-9ddc-d60a3fe51b41","resolution":{"observed_at":"2026-08-07T04:16:55.497378Z","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-07T04:16:56.560177Z","title":"A spectral algorithm for learning hidden markov models","venue":null,"work_id":"ba577e4f-0996-40be-9d31-ea46a5fff10a","year":2012},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.502582Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:eb04fadfed893418f73d140efc387bf3124acf97b40025d117b05aab5b29f05f","observation_id":"dd874173-3d2d-45ec-bb7e-df7252b5d4e6","resolution":{"observed_at":"2026-08-07T04:16:56.564887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.545635Z","title":"Learning discrete representations via information maximizing self-augmented training","venue":null,"work_id":"48bf38a1-39ae-4c93-b9df-fd6e329a4abf","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.507660Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:587c181bdf00d185fdc4aa4eae057849c718921efea8af032ab38e80d0558d44","observation_id":"07e8ef00-1bf1-49f6-82ad-db632b2a4df7","resolution":{"observed_at":"2026-08-07T04:16:56.550105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.13835","last_updated":"2023-05-31T03:14:34Z","snapshot_observed_at":"2026-07-06T14:35:29.422252Z","submitted_at":"2022-12-28T14:38:12Z","title":"Representation Learning in Deep RL via Discrete Information Bottleneck","version":2},"cited_work":{"arxiv_id":"2212.13835","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.13835","snapshot_observed_at":"2026-08-07T04:16:55.966675Z","title":"Representation Learning in Deep RL via Discrete Information Bottleneck","venue":"cs.LG","work_id":"fb5689d4-ff83-4489-9c53-6fc6b967e6d5","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.515291Z"},"links":{"cited_paper":"/paper/2212.13835","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:6c7fa8fec9364cefba6f252e036114f86a895b7fc55c9fa3bdd4fabb31e3d72d","observation_id":"32467d2c-1282-4db9-9f16-4cb9aca0f119","resolution":{"observed_at":"2026-08-07T04:16:55.971785Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.530643Z","title":"Video pixel networks","venue":null,"work_id":"b640c7ae-521b-4d8c-81e4-4d2e5e3b5705","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.521132Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:fe3827e07b1da1d032027fd0b4d8546e7820025c3e2871a6a4ec241f3b66dd42","observation_id":"c9271a0f-5f12-4c40-9781-b25d12ab5c25","resolution":{"observed_at":"2026-08-07T04:16:56.534841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.515692Z","title":"On a problem of monge","venue":null,"work_id":"3c57a67e-d749-4ec9-83a6-41d9f8c70e42","year":2006},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.525709Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:37c3d1988a2230c2ec34f311f8fdb67b1d988d021c8fbf36b6cd6c75acc1999a","observation_id":"4da693ad-5af5-4588-9cf5-1525dc651ba2","resolution":{"observed_at":"2026-08-07T04:16:56.520315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.499143Z","title":"L-verse: Bidirectional generation between image and text","venue":null,"work_id":"e2723e9b-5598-4762-ac5d-7b0bf428d760","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.530880Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:52ccd82421a86269d4d2455ba58d88fb350267412362ee4caf0d87b29be916bf","observation_id":"b420abe5-5766-4f16-9302-2c3f69ecbbfa","resolution":{"observed_at":"2026-08-07T04:16:56.504110Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-06T02:11:23.670680Z","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-07T04:16:55.536178Z","title":"Auto-encoding variational bayes","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.536178Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:1b7b3d72c7be0d39fb29675462a2eaff587e956d43e1e321935fd94d7716dc21","observation_id":"0131f316-e33f-416a-8f19-a2ee15e94722","resolution":{"observed_at":"2026-08-07T04:16:55.536178Z","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-07T04:16:55.541230Z","title":"Improved variational inference with inverse autoregressive flow","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.541230Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:19637953b60b696dcdf9b717d869b07d592f14a6f167032b549d7433a74bb28e","observation_id":"56a40232-8e9f-4b24-883f-012bfcb08e71","resolution":{"observed_at":"2026-08-07T04:16:55.541230Z","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-07T04:16:56.468001Z","title":"Out-of-distribution generalization via risk extrapolation (rex)","venue":null,"work_id":"41b72422-74d7-489e-a814-91ce2fe4f76f","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.545606Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:92ce2d8df3db38617c6fa87fa5eb47c1beb1c450c00f3d9a8d27e2828e5c28dd","observation_id":"7668cbfe-5eb5-4f93-a10b-7eb038c61979","resolution":{"observed_at":"2026-08-07T04:16:56.472482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.452707Z","title":"Deeper, broader and artier domain generalization","venue":null,"work_id":"d13a2592-bb9d-4b0a-af64-dfcebc2e08f9","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.550846Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:8e431797dc6b153df157481d9848a4a315a2a9672ba03d31d2010927d2bdad0a","observation_id":"dd77904d-e4d9-4b05-866c-5111bba60395","resolution":{"observed_at":"2026-08-07T04:16:56.457325Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.436248Z","title":"Domain generalization with adversarial feature learning","venue":null,"work_id":"803e7b5b-faaf-4269-9060-59edbec9b9cd","year":2018},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.556130Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:83c1ec62f06e8f4dfe22c14c87b9f6835be5cc8c045d473d1c8137c2fda98c35","observation_id":"9146aa5c-b569-4014-b051-83d6d03a5809","resolution":{"observed_at":"2026-08-07T04:16:56.440932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.420158Z","title":"Domain generalization via conditional invariant representations","venue":null,"work_id":"a65830b9-5840-4a39-9373-7075be3768be","year":2018},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.562344Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:c4981c352703a49c94619ab48d8f425a7902b2c07e40f94e3fead2c9ab2766f7","observation_id":"fec347be-474d-4eda-b1ef-30946c1b7bd2","resolution":{"observed_at":"2026-08-07T04:16:56.425140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.401773Z","title":"Deep domain generalization via conditional invariant adversarial networks","venue":null,"work_id":"31dc7e9c-8fe4-4f0a-b164-7eaf5f12a120","year":2018},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.567682Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:0f2fb1f18ad7baaa5a675571066f490f4dee800396d4e47c73ad9efe0f421d8c","observation_id":"fefd0f75-fc83-42e5-9609-6bbf68bdfcc8","resolution":{"observed_at":"2026-08-07T04:16:56.406467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.382428Z","title":"Frequency-aware self-supervised long-tailed learning","venue":null,"work_id":"601f6af7-be40-4c9f-a44f-49f01b43e993","year":2023},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.572178Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:4dd050315e4c25787ed83e352654660657149c8a0aa41a8b5bc01fe30bb5d9a1","observation_id":"2119cc4a-206e-4a95-af16-2a8b46bf505f","resolution":{"observed_at":"2026-08-07T04:16:56.388003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.01334","last_updated":"2022-02-02T23:54:26Z","snapshot_observed_at":"2026-07-06T12:33:56.572349Z","submitted_at":"2022-02-02T23:54:26Z","title":"Adaptive Discrete Communication Bottlenecks with Dynamic Vector Quantization","version":1},"cited_work":{"arxiv_id":"2202.01334","doi":null,"metadata_source":"pith","pith_arxiv_id":"2202.01334","snapshot_observed_at":"2026-08-07T04:16:55.922552Z","title":"Adaptive Discrete Communication Bottlenecks with Dynamic Vector Quantization","venue":"cs.LG","work_id":"d80deacc-8c7b-417e-9910-c8a8dbe5500a","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.577608Z"},"links":{"cited_paper":"/paper/2202.01334","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:0e9cd296b1755ab85f8158021e94b3178a9058e686eef4451a446c0b1fd8addf","observation_id":"d554e622-1f46-4a6a-8652-b0e35b8dd456","resolution":{"observed_at":"2026-08-07T04:16:55.928074Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.10667","last_updated":"2018-12-29T16:43:57Z","snapshot_observed_at":"2026-08-07T07:23:17.596290Z","submitted_at":"2017-05-26T00:50:36Z","title":"Conditional Adversarial Domain Adaptation","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.10667","snapshot_observed_at":"2026-08-07T04:16:55.584054Z","title":"Conditional adversarial domain adaptation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.584054Z"},"links":{"cited_paper":"/paper/1705.10667","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:d99863d6acb6a07e0153599faec854eb86156551d6eee6677c713a4b63d40b5b","observation_id":"f68572c2-a912-40f2-91fb-f6e2b33c8d73","resolution":{"observed_at":"2026-08-07T04:16:55.584054Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.04450","last_updated":"2023-04-15T07:25:57Z","snapshot_observed_at":"2026-08-06T07:20:56.224263Z","submitted_at":"2022-03-08T23:44:01Z","title":"How to Exploit Hyperspherical Embeddings for Out-of-Distribution Detection?","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.04450","snapshot_observed_at":"2026-08-07T04:16:55.589750Z","title":"How to exploit hyperspherical embeddings for out-of-distribution detection? arXiv preprint arXiv:2203.04450, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.589750Z"},"links":{"cited_paper":"/paper/2203.04450","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:45452d771acef1389893ae3ebc96ee6f09677766baf058266698a637ff003f15","observation_id":"62e33b4b-98f1-4d24-a83f-8f7c93a47687","resolution":{"observed_at":"2026-08-07T04:16:55.589750Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.07922","last_updated":"2020-10-15T17:53:37Z","snapshot_observed_at":"2026-08-07T00:33:09.278430Z","submitted_at":"2020-10-15T17:53:37Z","title":"Representation Learning via Invariant Causal Mechanisms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.07922","snapshot_observed_at":"2026-08-07T04:16:55.595643Z","title":"Representation learning via invariant causal mechanisms","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.595643Z"},"links":{"cited_paper":"/paper/2010.07922","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:133c91e3b666adc99522608f5ba5214cde61d7c0137a37bfc5febb2d2fec4762","observation_id":"0530cba2-dce6-4c83-8a9e-9a77c5a9efda","resolution":{"observed_at":"2026-08-07T04:16:55.595643Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1609.03499","last_updated":"2016-09-19T18:04:35Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2016-09-12T17:29:40Z","title":"WaveNet: A Generative Model for Raw Audio","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.03499","snapshot_observed_at":"2026-08-07T04:16:55.601765Z","title":"Wavenet: A generative model for raw audio","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.601765Z"},"links":{"cited_paper":"/paper/1609.03499","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:dd87f2f3a072bae8d2daa38666540a4c3f0acde6cc2af439242802a40021df3c","observation_id":"21597782-0144-4f88-b344-e6aeb01d186f","resolution":{"observed_at":"2026-08-07T04:16:55.601765Z","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-07T04:16:56.358861Z","title":"Vector quantized models for planning","venue":null,"work_id":"70afe999-3cc5-46b9-8747-31f22fefb7eb","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.608731Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:3fb575c326b12065587d109375656a51a90bf115f11a85fefa454c635ab63668","observation_id":"72ab97fe-258d-45b3-8126-f492b5332a4d","resolution":{"observed_at":"2026-08-07T04:16:56.366278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.340121Z","title":"Context encoders: Feature learning by inpainting","venue":null,"work_id":"ed7824c6-a0de-4146-b51a-d35a781f4cca","year":2016},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.614104Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:2e5170ea58ae92613d977d4a39711384409698b5bc71119eb1c45e0e87495b0e","observation_id":"26a45c6f-83e2-436e-980a-4f6125e6327c","resolution":{"observed_at":"2026-08-07T04:16:56.345224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.320925Z","title":"Moment matching for multi-source domain adaptation","venue":null,"work_id":"684a2ab5-1d49-469b-b06d-10c7a1d71991","year":2019},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.619082Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:1be9ff8f0386f5fa699cd60216defff44ed33345f304c306c27543a8a4ead227","observation_id":"26d6b101-08e1-4022-930b-9080c3f9049c","resolution":{"observed_at":"2026-08-07T04:16:56.326588Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:55.624556Z","title":"Zero-shot text-to-image generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.624556Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:e6be1c77de2e2faef4744aab13db7af005f44f138a7a915f15831499ba62468b","observation_id":"0a8c21b7-c83c-45f4-ac82-b64bdd1e3903","resolution":{"observed_at":"2026-08-07T04:16:55.624556Z","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-07T04:16:55.629326Z","title":"Generating diverse high-fidelity images with vq-vae-2","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.629326Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:040010a482d3f8ac0a02829404275b2f66dc72f28a9461d47744aea7a93443aa","observation_id":"b1fb4747-5811-4450-b089-b3397ad58613","resolution":{"observed_at":"2026-08-07T04:16:55.629326Z","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-07T04:16:56.281367Z","title":"Parallel multiscale autoregressive density estimation","venue":null,"work_id":"26caa9a5-ffd9-4e93-bdfd-f6d198428404","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.636437Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:d46c813cb365d204ae257ddefca21b5bbac4c4d4d17ea65018bdad941638e11a","observation_id":"62a3b4f9-e4b9-4f07-b253-add1241ef9c9","resolution":{"observed_at":"2026-08-07T04:16:56.286710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:55.641649Z","title":"High-resolution image synthesis with latent diffusion models","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.641649Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:5eabff1161563955580223bf616aab19e2283b1f58a5d759a68c9f59384eb1e3","observation_id":"467674bd-4aed-4e2f-837a-2337c1968e7e","resolution":{"observed_at":"2026-08-07T04:16:55.641649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.11063","last_updated":"2018-07-20T06:55:09Z","snapshot_observed_at":"2026-07-06T06:41:39.213867Z","submitted_at":"2018-05-28T17:16:20Z","title":"Theory and Experiments on Vector Quantized Autoencoders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.11063","snapshot_observed_at":"2026-08-07T04:16:55.646680Z","title":"Theory and experiments on vector quantized autoencoders","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.646680Z"},"links":{"cited_paper":"/paper/1805.11063","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:a32d78a56b79d41cab7edcfb7ea1fe3b27804f73f30c39c1d28d6a175e36b366","observation_id":"6cd9262f-2c11-414b-8cdb-485922540fc0","resolution":{"observed_at":"2026-08-07T04:16:55.646680Z","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-07T04:16:55.652176Z","title":"Optimal transport for applied mathematicians","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.652176Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:3a32b4e319d4b1ff43ad7c87c18b70c7f5ce5091303ef9bf5e0c43c9d9e745a6","observation_id":"ac82ff1d-a16d-4b1c-845e-d765a59f696f","resolution":{"observed_at":"2026-08-07T04:16:55.652176Z","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-07T04:16:56.242623Z","title":"Domain adaptation with conditional distribution matching and generalized label shift","venue":null,"work_id":"5de4a975-55ba-48a1-81f1-e612b84db27d","year":2020},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.657999Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:61d2a551cc585ced97f64c46f9e5d7cd3090c4203fd2990145b09a1ec2337c2f","observation_id":"c37d83a7-5e41-4a0a-870b-e1bfa00d7412","resolution":{"observed_at":"2026-08-07T04:16:56.247189Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.224070Z","title":"SQ - VAE : Variational B ayes on discrete representation with self-annealed stochastic quantization","venue":null,"work_id":"78e26200-dfb6-494c-a22e-63470ef7a6d7","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.662742Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:b72d22304899e71c4ac36c01450409c24699f87c86d02bc8b064e7fd95aef4ee","observation_id":"1339415e-e983-4c32-829c-c3465be652d5","resolution":{"observed_at":"2026-08-07T04:16:56.231836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.207219Z","title":"Moment-based uniform deviation bounds for k -means and friends","venue":null,"work_id":"b2a01e84-97ee-4802-8c06-815b10fb3ad0","year":2013},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.667448Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:be5c09166cd69f8635009524083526823f20ed2feb606ad0fd5c6be211f3d9f9","observation_id":"5d3f238c-f603-43c8-a5da-8824b99b5cd0","resolution":{"observed_at":"2026-08-07T04:16:56.212804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.189344Z","title":"Unbiased look at dataset bias","venue":null,"work_id":"e9dfed24-010f-4512-b3ba-b0e491a0bc4d","year":2011},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.671941Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:e8f3bb8250920e57b206c0a1e722030b51373b9d63bf5afcb7eb8983b5f55682","observation_id":"9713b1d1-1457-40b0-9ccd-1be64f21bf69","resolution":{"observed_at":"2026-08-07T04:16:56.194324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:55.677473Z","title":"Neural discrete representation learning","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.677473Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:4926e2b3a93568126595a6640a405f24783fdd4fe0c678b785e18bf6f6ef84ef","observation_id":"c53a241d-ba4d-4963-9958-8a8e94355d60","resolution":{"observed_at":"2026-08-07T04:16:55.677473Z","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-07T04:16:56.161716Z","title":"Deep hashing network for unsupervised domain adaptation","venue":null,"work_id":"f5f5e215-609e-4e4c-aeea-c44f8c647f70","year":2017},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.682003Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:f0da5ac979fdef68279d12b364e4bfdd5b8afa38bcd5dc8b45045eaa21a0836f","observation_id":"0fb9735d-3240-4dba-bbff-81482b72c43d","resolution":{"observed_at":"2026-08-07T04:16:56.166389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.05917","last_updated":"2023-06-17T06:52:21Z","snapshot_observed_at":"2026-07-31T10:44:33.984401Z","submitted_at":"2023-02-12T13:51:36Z","title":"Vector Quantized Wasserstein Auto-Encoder","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.05917","snapshot_observed_at":"2026-08-07T04:16:55.686695Z","title":"Vector quantized wasserstein auto-encoder","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.686695Z"},"links":{"cited_paper":"/paper/2302.05917","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:b5ce25bfaa9f76a2192c9369140c668f699ed7118a9ebe844f2f615a74414b72","observation_id":"147ccab7-7070-48d5-8c24-1629c8a0ea36","resolution":{"observed_at":"2026-08-07T04:16:55.686695Z","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-07T04:16:56.145556Z","title":"Out-of-distribution generalization with causal invariant transformations","venue":null,"work_id":"4a9b4c6a-7f15-4e8b-8a0c-9c282021ef26","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.693169Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:2f8e4ef4432ce8777689a76f38fa38767fd4904fba15478a01942289dfed0005","observation_id":"c01d4149-336c-4917-8e4b-41c8ea3c88d9","resolution":{"observed_at":"2026-08-07T04:16:56.150774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.128916Z","title":"Hierarchical quantized autoencoders","venue":null,"work_id":"f9bf820e-84b8-42ee-b5c7-b1ea1364c9b3","year":2020},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.697674Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:7bba8ac2a117a5115761f86904ba55e6aba5d54e396f94b8c473a9f60d40b26d","observation_id":"72a7602f-836c-4837-8d1c-dd2b13984e21","resolution":{"observed_at":"2026-08-07T04:16:56.133796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.114053Z","title":"Pcl: Proxy-based contrastive learning for domain generalization","venue":null,"work_id":"ddadd41f-89fc-42a2-944a-b1c686621d4a","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.702447Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:3a78ea3a7226182e36a3eac7038354715684dbbbe117dbcc1560ee6214ea8d42","observation_id":"d83d4797-641c-461c-b609-7cd487f9e88a","resolution":{"observed_at":"2026-08-07T04:16:56.118772Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.098738Z","title":"Reinforcement learning with prototypical representations","venue":null,"work_id":"b07c9a48-7a26-46a9-99ab-40d7cfc9cea6","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.707023Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:a07923a95893ac37be34d7103171f8545a397375358e04220a1ed94d3ff6e462","observation_id":"f03331e0-ed71-46a2-8e27-333ea83beeb3","resolution":{"observed_at":"2026-08-07T04:16:56.103402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.05364","last_updated":"2024-07-15T08:37:49Z","snapshot_observed_at":"2026-07-06T18:42:34.958119Z","submitted_at":"2024-07-07T13:32:03Z","title":"PTaRL: Prototype-based Tabular Representation Learning via Space Calibration","version":2},"cited_work":{"arxiv_id":"2407.05364","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.05364","snapshot_observed_at":"2026-08-07T04:16:55.786915Z","title":"PTaRL: Prototype-based Tabular Representation Learning via Space Calibration","venue":"cs.LG","work_id":"0204266f-0fc3-4999-b81f-f74d1d71c992","year":2024},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.711502Z"},"links":{"cited_paper":"/paper/2407.05364","citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:9cce9176d2f92e012687f91c5c97a06a6fbb4b7dc915d8811d70ec0974c75afc","observation_id":"afa99b79-c254-4b84-afbb-4c697f331b65","resolution":{"observed_at":"2026-08-07T04:16:55.795624Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.082294Z","title":"Vector-quantized image modeling with improved vqgan","venue":null,"work_id":"fa480712-cb27-4002-8cef-d24fea1c8877","year":2021},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.716672Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:a4398e3922b6e42f58942baf2deb8bc7c5e9ab15ba42c543b9173bf357300608","observation_id":"3599ef7d-902c-4339-ac62-364310e3b039","resolution":{"observed_at":"2026-08-07T04:16:56.087007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:56.065090Z","title":"Movq: Modulating quantized vectors for high-fidelity image generation","venue":null,"work_id":"b4e3ea8a-6189-4b80-b3fd-a0a743754511","year":2022},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.721738Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:81ea49beb4ee120406f8cf67f234bfb4e1e5ab9e5efbc9ecb254d32f5c8a62f5","observation_id":"b1576ecf-5c98-42a5-855f-b39be9260e94","resolution":{"observed_at":"2026-08-07T04:16:56.070476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T04:16:55.731433Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T04:16:55.731433Z"},"links":{"citing_paper":"/paper/2506.11511"},"observation_digest":"sha256:4ff70f48b50ac4a1f8a28b5b018ce1539715da963dc215270baeac2713e53f01","observation_id":"3d6b8100-06eb-43a2-b68b-84787b1d2ae0","resolution":{"observed_at":"2026-08-07T04:16:55.731433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.11511","last_updated":"2025-06-13T07:12:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T04:02:02.719527Z","submitted_at":"2025-06-13T07:12:49Z","title":"Task-Driven Discrete Representation Learning"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":3,"verified_fuzzy":35},"total_outbound_references":59},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2506.11511."}