{"as_of":"2026-08-20T15:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8e844a1ae1b4b4f62c0f389e23d6a6f2155243a6bb4df580eb9b041c532c8413","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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-20T06:33:59.587034+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:38:22.305478Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T09:59:44.785580Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-08-09T11:04:17.021682Z","title":"and Titov, I","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.02820","last_updated":"2025-02-05T01:42:44Z","snapshot_observed_at":"2026-08-18T09:50:19.537785Z","submitted_at":"2025-02-05T01:42:44Z","title":"Slowing Learning by Erasing Simple Features","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T11:04:17.021682Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2502.02820"},"observation_digest":"sha256:662afab7334f8aaefc2a3e39a8119fb950c3c7d2706c9f9e0beee0a858eba1ff","observation_id":"b4b29c54-fb7a-4840-8c54-82f1fd556d34","resolution":{"observed_at":"2026-08-09T11:04:17.021682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-08-16T11:38:22.305478Z","title":"Information-theoretic probing with minimum description length","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.15208","last_updated":"2025-04-21T16:26:56Z","snapshot_observed_at":"2026-08-17T12:40:20.917045Z","submitted_at":"2025-04-21T16:26:56Z","title":"Compute-Optimal LLMs Provably Generalize Better With Scale","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-16T11:38:22.305478Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2504.15208"},"observation_digest":"sha256:6c238321587cfd1c4a87e34fea5e7bfa12006f4708afcf31796684c9e40a3d60","observation_id":"05b4d2b1-a120-4fca-a0f1-c81580b8f8cc","resolution":{"observed_at":"2026-08-16T11:38:22.305478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":"2003.12298","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-07-04T09:59:44.785580Z","title":"arXiv preprint arXiv:2003.12298 , year=","venue":null,"work_id":"23e96840-ee64-4c34-9adf-18336acbb4ed","year":2003},"citing_paper":{"arxiv_id":"2605.05741","last_updated":"2026-05-07T06:32:57Z","snapshot_observed_at":"2026-08-17T19:38:48.914653Z","submitted_at":"2026-05-07T06:32:57Z","title":"HyperLens: Quantifying Cognitive Effort in LLMs with Fine-grained Confidence Trajectory","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-08T11:38:49.630171Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2605.05741"},"observation_digest":"sha256:042b73b266a544bfcc8bdc2b9d3f89bd206d94ce630a3c1fff0365e3beced419","observation_id":"71415de6-66c1-4278-a789-8e1643d42fd2","resolution":{"observed_at":"2026-05-11T19:36:09.745617Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":"2003.12298","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-07-04T09:59:44.785580Z","title":"arXiv preprint arXiv:2003.12298 , year=","venue":null,"work_id":"23e96840-ee64-4c34-9adf-18336acbb4ed","year":2003},"citing_paper":{"arxiv_id":"2606.11375","last_updated":"2026-06-09T19:00:23Z","snapshot_observed_at":"2026-08-13T06:45:19.506134Z","submitted_at":"2026-06-09T19:00:23Z","title":"When Probing Accuracy Saturates, Fragility Resolves: A Complementary Metric for LLM Pre-Training Analysis","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-27T13:25:03.893949Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2606.11375"},"observation_digest":"sha256:f2b722507d6e7fed7e2f035d277ca5b2c408111a9d476d5b02cbc889071ac3d4","observation_id":"c08f30f5-86e8-44aa-b15e-3e9a699f6b09","resolution":{"observed_at":"2026-07-03T05:07:39.041718Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":"2003.12298","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-07-04T09:59:44.785580Z","title":"arXiv preprint arXiv:2003.12298 , year=","venue":null,"work_id":"23e96840-ee64-4c34-9adf-18336acbb4ed","year":2003},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-12T17:43:10.201466Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":2},"reference_index":200,"source":"arxiv_source","source_observed_at":"2026-06-26T09:19:50.623741Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:7ad4f5dfc2a4916908ce5f173a4d0974fa7f591e433a6c6b3ac0e015b67a9225","observation_id":"a2a38c52-f918-413d-9a33-3291e05c426b","resolution":{"observed_at":"2026-07-04T09:59:44.787286Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length","version":1},"cited_work":{"arxiv_id":"2003.12298","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2003.12298","snapshot_observed_at":"2026-07-04T09:59:44.785580Z","title":"arXiv preprint arXiv:2003.12298 , year=","venue":null,"work_id":"23e96840-ee64-4c34-9adf-18336acbb4ed","year":2003},"citing_paper":{"arxiv_id":"2606.22873","last_updated":"2026-06-25T18:44:01Z","snapshot_observed_at":"2026-08-12T17:43:10.201466Z","submitted_at":"2026-06-22T05:37:43Z","title":"SingGuard: A Policy-Adaptive Multimodal LLM Guardrail with Dynamic Reasoning","version":3},"reference_index":199,"source":"arxiv_source","source_observed_at":"2026-06-29T01:18:19.195007Z"},"links":{"cited_paper":"/paper/2003.12298","citing_paper":"/paper/2606.22873"},"observation_digest":"sha256:e0267b7901e417fb0aa020a82f018f01aab5e63717c376a253551ddb9ba9fa71","observation_id":"3132d6a2-515b-4943-ae8e-a45dc6aaf1b4","resolution":{"observed_at":"2026-07-01T18:55:59.727398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2003.12298/citation-record","integrity":"/paper/2003.12298/integrity","json":"/paper/2003.12298/citation-record.json","paper":"/paper/2003.12298"},"outbound":[],"paper":{"arxiv_id":"2003.12298","last_updated":"2020-03-27T09:35:38Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-20T12:24:16.061241Z","submitted_at":"2020-03-27T09:35:38Z","title":"Information-Theoretic Probing with Minimum Description Length"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2003.12298."}