{"as_of":"2026-08-21T09:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bf89e710645381ca27ac44548c7854535896f6d36a66044fbc3a7e5e96c12ea9","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T16:22:07.805142Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2509.06314/citation-record","integrity":"/paper/2509.06314/integrity","json":"/paper/2509.06314/citation-record.json","paper":"/paper/2509.06314"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T16:22:07.749261Z","title":"beta-vae: Learning basic visual concepts with a constrained variational framework,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.749261Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:808f956a2c8d4b0db08afdbbfed708e7802379a4f5030b969cefa4dc3dd91ce8","observation_id":"8c0fd5fa-9783-44e9-9823-8c2f1e729a2d","resolution":{"observed_at":"2026-08-15T16:22:07.749261Z","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-15T16:22:07.971014Z","title":"Disentangling by factorising,","venue":null,"work_id":"d2f3208f-2e32-4424-b8c1-5b027f254a57","year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.752609Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:e15db7d2c14014e057a78c62077f65e62cefae3fa070817b89a16b01916665ce","observation_id":"3d95a2f3-0736-4ee0-ba95-3b0f9767708b","resolution":{"observed_at":"2026-08-15T16:22:07.974136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:22:07.961184Z","title":"Challenging common assumptions in the unsupervised learning of disentangled representations,","venue":null,"work_id":"fa75f808-8073-4945-a1c5-1d57dc859898","year":2019},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.755880Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:90fc76c230d3c30c220b55446b6592f57767318088c1a0e173c15c08d8fe0fb9","observation_id":"efa3a50c-0dd1-4c51-8dde-5da382b5efa0","resolution":{"observed_at":"2026-08-15T16:22:07.964492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:22:07.952264Z","title":"A framework for the quantitative eval- uation of disentangled representations,","venue":null,"work_id":"b93e4e17-f6a1-4ddc-ad51-4d957ac42a71","year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.758812Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:341b8ebd48d3d9280110cd9828060a036cd0ae9f7a06f2293d0a19dd70328b5a","observation_id":"a1434deb-193b-400e-a8de-f94e42f908b3","resolution":{"observed_at":"2026-08-15T16:22:07.955167Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:22:07.761604Z","title":"Mutual information neural estimation,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.761604Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:07373afab7872dbf2cf704921946a152c0e70555f00c3fb063b31abce77fb6d4","observation_id":"b19a9c7c-9c4e-44f3-bd08-3c9200dc9f51","resolution":{"observed_at":"2026-08-15T16:22:07.761604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1907.13625","last_updated":"2020-01-23T09:08:54Z","snapshot_observed_at":"2026-08-18T17:43:35.148821Z","submitted_at":"2019-07-31T17:50:51Z","title":"On Mutual Information Maximization for Representation Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.13625","snapshot_observed_at":"2026-08-15T16:22:07.765603Z","title":"On mutual information maximization for representation learning,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.765603Z"},"links":{"cited_paper":"/paper/1907.13625","citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:4142819f5bb8e2d5fe287e091560304ac400a05a67fff2cf6c072f2c7ea1dd29","observation_id":"1102b5f3-a31a-4aeb-8ebf-1b63062cd76a","resolution":{"observed_at":"2026-08-15T16:22:07.765603Z","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-15T16:22:07.936953Z","title":"Isolating sources of disentanglement in variational autoencoders,","venue":null,"work_id":"98acdf20-bc30-4cd3-b522-6ac333ea49e1","year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.769490Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:fc20586de4c56e988065e4eab63931664a8a45e9a107e12765b41805464c90fb","observation_id":"54635301-a00f-493b-951b-689867f7387b","resolution":{"observed_at":"2026-08-15T16:22:07.940280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:22:07.772489Z","title":"Measuring statistical dependence with hilbert-schmidt norms,","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.772489Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:977a5f3aaf6dfd10f8bd060ee9d9920283d49dd824d183e767e8784def9793ef","observation_id":"e0919a79-f081-4898-886d-05ec6284942b","resolution":{"observed_at":"2026-08-15T16:22:07.772489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12076","last_updated":"2018-05-30T16:50:28Z","snapshot_observed_at":"2026-08-18T17:29:13.286913Z","submitted_at":"2018-05-30T16:50:28Z","title":"Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1805.12076","snapshot_observed_at":"2026-08-15T16:22:07.775396Z","title":"Towards understanding the role of over-parametrization in generalization of neural networks,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.775396Z"},"links":{"cited_paper":"/paper/1805.12076","citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:26b92082ea0db9979e6c0a7d1537bc1bc0eb4d6d7da1f31fb1d93b75416dd53a","observation_id":"4ce36785-0e01-4092-8828-9bc4160afddd","resolution":{"observed_at":"2026-08-15T16:22:07.775396Z","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-15T16:22:07.778753Z","title":"Reconciling modern machine-learning practice and the classical bias–variance trade-off,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.778753Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:85c16c42e6c2bead2e71a88be0093b599627196e5afaa108d6a4151a3963d14d","observation_id":"a5f88478-ca2d-4722-8b8c-c279aff26502","resolution":{"observed_at":"2026-08-15T16:22:07.778753Z","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-15T16:22:07.914398Z","title":"Within-network ensemble for face attributes classification,","venue":null,"work_id":"52615ab7-5a7b-466e-8aea-594153740096","year":2019},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.781583Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:729871209cf7755deb11dad78900e367c5e34a41011f75295cb720f0c8f72ee8","observation_id":"03bb785b-1ce9-4aff-a0f4-dc7c33cbd910","resolution":{"observed_at":"2026-08-15T16:22:07.917507Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1605.08803","last_updated":"2017-02-27T23:21:10Z","snapshot_observed_at":"2026-08-10T10:35:06.780085Z","submitted_at":"2016-05-27T21:24:32Z","title":"Density estimation using Real NVP","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1605.08803","snapshot_observed_at":"2026-08-15T16:22:07.784246Z","title":"Density estimation using real nvp,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.784246Z"},"links":{"cited_paper":"/paper/1605.08803","citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:22a7e63a99f2451477ef8142c9beeec1b8e617affc33baa8e49a3806d681c8d9","observation_id":"52cc5e9b-c3eb-4a3f-b108-3d481891ed9a","resolution":{"observed_at":"2026-08-15T16:22:07.784246Z","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-15T16:22:07.787295Z","title":"Variational inference with normalizing flows,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.787295Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:520096500d234ab0686552c513fc5f7b21dddeb62df434845f5cf8c65039c4ab","observation_id":"76e02995-c3da-4601-9039-d77611abeda1","resolution":{"observed_at":"2026-08-15T16:22:07.787295Z","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-15T16:22:07.895079Z","title":"Random search for hyper-parameter opti- mization,","venue":null,"work_id":"15f1c98b-09c7-4c7b-8dd4-b4f069467558","year":2012},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.790348Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:ded872328817e1731d1fe022be9fc2dc4b9fe35a200f0ffa8343b8077e848786","observation_id":"4da85e1a-ed62-424d-92a6-c2081a6e7c63","resolution":{"observed_at":"2026-08-15T16:22:07.900373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-15T16:22:07.792898Z","title":"Algorithms for hyper- parameter optimization,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.792898Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:789d3b9e8aac29ea80891a86f6c177d23047996cc74cff54c8fa9026d5aef99d","observation_id":"8a729626-eaa8-4252-a59b-cc4a74a21ad0","resolution":{"observed_at":"2026-08-15T16:22:07.792898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.01644","last_updated":"2018-11-22T23:40:00Z","snapshot_observed_at":"2026-08-09T22:50:03.459615Z","submitted_at":"2016-10-05T20:59:01Z","title":"Understanding intermediate layers using linear classifier probes","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.01644","snapshot_observed_at":"2026-08-15T16:22:07.795817Z","title":"Understanding intermediate layers using linear classifier probes, 2018,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.795817Z"},"links":{"cited_paper":"/paper/1610.01644","citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:4822476a92f50d221a387d575da7083b27b57775c4216333fc74dafb241a4f21","observation_id":"be38cfb8-0332-48a8-889e-6c0e415459ae","resolution":{"observed_at":"2026-08-15T16:22:07.795817Z","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-15T16:22:07.799360Z","title":"Representation learning: A review and new perspectives,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.799360Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:12cd443071d7f6f428def34b365509a683048441f7c6f062503cccb117553370","observation_id":"16114e25-1816-48d5-a23c-9c62dd8c392b","resolution":{"observed_at":"2026-08-15T16:22:07.799360Z","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-15T16:22:07.802075Z","title":"An empirical evaluation of deep architectures on problems with many factors of variation,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.802075Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:f4eed44a0c95e323034d20753627bf44c2c3b5fa56bdf2cc71623c5b0fcc5edc","observation_id":"9af18964-0c5e-4c1a-93cd-f81613394c3c","resolution":{"observed_at":"2026-08-15T16:22:07.802075Z","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-15T16:22:07.805142Z","title":"Extract- ing and composing robust features with denoising autoencoders,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T16:22:07.805142Z"},"links":{"citing_paper":"/paper/2509.06314"},"observation_digest":"sha256:0ce39f0add8fc42c1caf29ba00b598d86242e8763e7c1c5dff12da59630dcbbd","observation_id":"3d9407a3-0afb-455d-899c-bb35e9a1e51f","resolution":{"observed_at":"2026-08-15T16:22:07.805142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.06314","last_updated":"2025-09-08T03:36:47Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T17:29:45.665585Z","submitted_at":"2025-09-08T03:36:47Z","title":"Evaluating the Efficiency of Latent Spaces via the Coupling-Matrix"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":6},"total_outbound_references":19},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2509.06314."}