{"as_of":"2026-08-07T17:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c6b0f375fc235b161bc8f06e19e0ccb582b63d75c0390d72f2dda41a242519d1","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:42:10.760023Z","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-03T20:38:55.849757Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-08-07T14:42:10.760023Z","title":"A complexity- based theory of compositionality","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.17998","last_updated":"2025-05-23T15:03:51Z","snapshot_observed_at":"2026-08-07T14:34:42.149071Z","submitted_at":"2025-05-23T15:03:51Z","title":"TRACE for Tracking the Emergence of Semantic Representations in Transformers","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:42:10.760023Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2505.17998"},"observation_digest":"sha256:a12ac3b2e1097c00be7f76820e9dd2b79c7f543dcd903c2c264be07e4697762e","observation_id":"23f784e0-5248-430b-8c29-cf48d0cb68f6","resolution":{"observed_at":"2026-08-07T14:42:10.760023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-08-06T18:55:54.849787Z","title":"A complexity-based theory of compositionality","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07102","last_updated":"2025-07-09T17:59:03Z","snapshot_observed_at":"2026-08-07T13:20:21.764212Z","submitted_at":"2025-07-09T17:59:03Z","title":"Does Data Scaling Lead to Visual Compositional Generalization?","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T18:55:54.849787Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2507.07102"},"observation_digest":"sha256:f55e1f64e20336951b64c1ac65497bd69e1ff035f066a870dfecdb151b2f1e36","observation_id":"2b941d20-e85a-485d-ba21-4db673f28fe8","resolution":{"observed_at":"2026-08-06T18:55:54.849787Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-08-06T18:41:32.771098Z","title":"emnlp-main.427/","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.07544","last_updated":"2025-07-10T08:38:47Z","snapshot_observed_at":"2026-08-07T04:40:37.652382Z","submitted_at":"2025-07-10T08:38:47Z","title":"Position: We Need An Algorithmic Understanding of Generative AI","version":1},"reference_index":427,"source":"pdf_text","source_observed_at":"2026-08-06T18:41:32.771098Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2507.07544"},"observation_digest":"sha256:b3697c8bf0a844b22939e4b82f61e73af13d084ef454b5e28562956e2811832b","observation_id":"39f41ec0-7c6b-4287-9134-4895a461a6d0","resolution":{"observed_at":"2026-08-06T18:41:32.771098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":"2410.14817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-07-03T20:38:55.849757Z","title":"arXiv preprint arXiv:2410.14817 , year=","venue":null,"work_id":"64e70af5-a7b0-4520-9620-1ccb452c0bcb","year":2025},"citing_paper":{"arxiv_id":"2604.18237","last_updated":"2026-04-20T13:22:58Z","snapshot_observed_at":"2026-07-30T05:38:58.837546Z","submitted_at":"2026-04-20T13:22:58Z","title":"Semantic-based Distributed Learning for Diverse and Discriminative Representations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T05:07:23.465515Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2604.18237"},"observation_digest":"sha256:1a02124d979f603b2dac042c7499452d893f542b2aa56fe311461d8d158b57e3","observation_id":"6f247949-eb6a-409f-8da8-a392d9207ede","resolution":{"observed_at":"2026-05-10T09:48:48.013465Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":"2410.14817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-07-03T20:38:55.849757Z","title":"arXiv preprint arXiv:2410.14817 , year=","venue":null,"work_id":"64e70af5-a7b0-4520-9620-1ccb452c0bcb","year":2025},"citing_paper":{"arxiv_id":"2604.18907","last_updated":"2026-04-20T23:14:48Z","snapshot_observed_at":"2026-08-02T07:41:12.503888Z","submitted_at":"2026-04-20T23:14:48Z","title":"Gradient-Based Program Synthesis with Neurally Interpreted Languages","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-10T04:29:33.858344Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2604.18907"},"observation_digest":"sha256:e039a7a531afa86d2196fd3434855d6caa92bc4d76e2c1125ff588401b6122a3","observation_id":"6a98307b-e453-4956-92e1-41b63a530811","resolution":{"observed_at":"2026-05-11T11:56:08.036388Z","resolver_source":"arxiv_id","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":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":"2410.14817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-07-03T20:38:55.849757Z","title":"arXiv preprint arXiv:2410.14817 , year=","venue":null,"work_id":"64e70af5-a7b0-4520-9620-1ccb452c0bcb","year":2025},"citing_paper":{"arxiv_id":"2604.27340","last_updated":"2026-04-30T02:33:13Z","snapshot_observed_at":"2026-07-06T23:12:47.745700Z","submitted_at":"2026-04-30T02:33:13Z","title":"Investigating More Explainable and Partition-Free Compositionality Estimation for LLMs: A Rule-Generation Perspective","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-07T09:52:15.899587Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2604.27340"},"observation_digest":"sha256:fdd79d63f05a8c8d74ac386fa673e72eb4ac9f628f0cee0985b9dbf3fc82c112","observation_id":"d3710c30-5db0-402a-aab4-1c4d684a5f2d","resolution":{"observed_at":"2026-05-12T09:41:26.592904Z","resolver_source":"arxiv_id","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":"2410.14817","last_updated":"2025-06-02T21:11:54Z","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality","version":5},"cited_work":{"arxiv_id":"2410.14817","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.14817","snapshot_observed_at":"2026-07-03T20:38:55.849757Z","title":"arXiv preprint arXiv:2410.14817 , year=","venue":null,"work_id":"64e70af5-a7b0-4520-9620-1ccb452c0bcb","year":2025},"citing_paper":{"arxiv_id":"2606.18089","last_updated":"2026-07-05T17:40:26Z","snapshot_observed_at":"2026-07-12T13:34:39.011240Z","submitted_at":"2026-06-16T15:55:28Z","title":"From Reasoning Traces to Reusable Modules: Understanding Compositional Generalization in Language Model Reasoning","version":1},"reference_index":105,"source":"arxiv_source","source_observed_at":"2026-06-27T01:13:11.483599Z"},"links":{"cited_paper":"/paper/2410.14817","citing_paper":"/paper/2606.18089"},"observation_digest":"sha256:94fe8feaa1ff3f41f91d1ae0c6e758dd9470843b6095b6b41478181cc5f08575","observation_id":"cca14fc5-af9a-4ffa-a611-de9efa1e7817","resolution":{"observed_at":"2026-07-03T20:38:55.850960Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2410.14817/citation-record","integrity":"/paper/2410.14817/integrity","json":"/paper/2410.14817/citation-record.json","paper":"/paper/2410.14817"},"outbound":[],"paper":{"arxiv_id":"2410.14817","last_updated":"2025-06-02T21:11:54Z","latest_version":5,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:36:15.200874Z","submitted_at":"2024-10-18T18:37:27Z","title":"A Complexity-Based Theory of Compositionality"},"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-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 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2410.14817."}