{"as_of":"2026-08-18T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af7c01be750ec89fef1b0c5a9e1302c2d161ffbca586e01aa92d7c7da32653f7","coverage":[{"denominator":6,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T22:57:36.607842Z","state":"measured"},{"denominator":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2602.15438/citation-record","integrity":"/paper/2602.15438/integrity","json":"/paper/2602.15438/citation-record.json","paper":"/paper/2602.15438"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.14860","last_updated":"2025-02-27T03:03:59Z","snapshot_observed_at":"2026-08-18T08:28:54.917862Z","submitted_at":"2024-05-23T17:59:04Z","title":"Not All Language Model Features Are One-Dimensionally Linear","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14860","snapshot_observed_at":"2026-08-02T22:57:36.025860Z","title":"Shortcuts and identifiability in concept-based models from a neuro-symbolic lens","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.025860Z"},"links":{"cited_paper":"/paper/2405.14860","citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:58344afdd80a6d2dec9944989fa49f235e094084f9ae89dd65d7811a923e88ba","observation_id":"caee3fe2-910b-4c01-a668-51ceeffa284f","resolution":{"observed_at":"2026-08-02T22:57:36.025860Z","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-02T22:57:36.282843Z","title":"Linguistic regularities in continuous space word repre- sentations","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.282843Z"},"links":{"citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:21989bd64566ad24ffa7fb4d1d3cdb00641d86090dd54fe82ea0fd3b5d6f72ac","observation_id":"37902e96-76fc-479d-bc37-68417aae7913","resolution":{"observed_at":"2026-08-02T22:57:36.282843Z","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-02T22:57:36.607842Z","title":"⇐= ”: Assume dlogit(p, p′) = 0. Since dlogit is a metric between probability distributions, this gives usp=p ′. Therefore, Thm. 3.6 gives usd rep((f,g),(f ′,g ′)) = 0. “ =⇒","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.607842Z"},"links":{"citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:8ec8004f25a8f54c8ca6b79ab149643ef0418a9a61f67633fbaed83370c68467","observation_id":"0d6994bf-92f7-4159-b6da-12ee7cdb969b","resolution":{"observed_at":"2026-08-02T22:57:36.607842Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.09124","last_updated":"2024-02-15T19:12:10Z","snapshot_observed_at":"2026-08-17T20:21:20.854895Z","submitted_at":"2023-08-17T17:59:19Z","title":"Linearity of Relation Decoding in Transformer Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.09124","snapshot_observed_at":"2026-08-02T22:57:36.138275Z","title":"Does localization inform editing? surprising differences in causality-based localization vs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.138275Z"},"links":{"cited_paper":"/paper/2308.09124","citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:c46399630b322aa08598927dd03959935739aaacae6b97368528c3cc68467dd5","observation_id":"c52d7fcc-c5cd-4818-9db7-575c554e6ac0","resolution":{"observed_at":"2026-08-02T22:57:36.138275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.00492","last_updated":"2022-07-22T09:57:09Z","snapshot_observed_at":"2026-08-18T16:09:47.203466Z","submitted_at":"2022-04-01T14:51:38Z","title":"Provable concept learning for interpretable predictions using variational autoencoders","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.00492","snapshot_observed_at":"2026-08-02T22:57:36.466023Z","title":"Provable concept learning for interpretable predictions using variational autoencoders.arXiv preprint arXiv:2204.00492, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.466023Z"},"links":{"cited_paper":"/paper/2204.00492","citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:212cef41336c09d827d5c9e43e818aa43d9c1629026eff2bb4f052fad540467e","observation_id":"8f4b7879-c0b9-491b-861f-c15188893c97","resolution":{"observed_at":"2026-08-02T22:57:36.466023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.03748","last_updated":"2019-01-22T18:47:12Z","snapshot_observed_at":"2026-08-14T18:53:38.574749Z","submitted_at":"2018-07-10T16:52:11Z","title":"Representation Learning with Contrastive Predictive Coding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.03748","snapshot_observed_at":"2026-08-02T22:57:36.367831Z","title":"Representation learning with contrastive predictive coding","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T22:57:36.367831Z"},"links":{"cited_paper":"/paper/1807.03748","citing_paper":"/paper/2602.15438"},"observation_digest":"sha256:5a11e80551f916155f6b03ed3ea9412abbb419e2883905f6320f821f48838af9","observation_id":"64da09ac-fe14-4445-b07b-d438a41fb013","resolution":{"observed_at":"2026-08-02T22:57:36.367831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.15438","last_updated":"2026-06-24T10:39:19Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T20:23:59.253782Z","submitted_at":"2026-02-17T09:00:56Z","title":"Logit Distance Bounds Representational Similarity"},"reference_resolution":{"displayed":6,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":6},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 6 of 6 outbound references and 0 inbound Pith citation observations for arXiv:2602.15438."}