{"as_of":"2026-08-22T18:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:68a11c0db32046cd3a7a2e275c0efe50230eb2255e35c99a1801c49bf34d4c90","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T07:34:22.029488Z","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-05-23T02:02:23.035058Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.22793","last_updated":"2025-06-11T04:25:03Z","snapshot_observed_at":"2026-08-16T13:04:39.498672Z","submitted_at":"2024-10-30T08:17:10Z","title":"Less is More: DocString Compression in Code Generation","version":3},"cited_work":{"arxiv_id":"2410.22793","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22793","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"52527cd1-1e7f-42bf-97f6-ef515aefb0a9","year":2025},"citing_paper":{"arxiv_id":"2502.14925","last_updated":"2026-04-09T19:58:28Z","snapshot_observed_at":"2026-08-05T17:56:07.944638Z","submitted_at":"2025-02-19T23:15:23Z","title":"CODEPROMPTZIP: Code-specific Prompt Compression for Retrieval-Augmented Generation in Coding Tasks with LMs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-23T01:59:18.546405Z"},"links":{"cited_paper":"/paper/2410.22793","citing_paper":"/paper/2502.14925"},"observation_digest":"sha256:f120568e37a68538bca558e64c6fc5514ae1dca35ffa86e80eb1dfe984e27700","observation_id":"753ff54a-a19d-40ff-b4a3-e6f7d3b26700","resolution":{"observed_at":"2026-05-23T02:02:23.037256Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22793","last_updated":"2025-06-11T04:25:03Z","snapshot_observed_at":"2026-08-16T13:04:39.498672Z","submitted_at":"2024-10-30T08:17:10Z","title":"Less is More: DocString Compression in Code Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.22793","snapshot_observed_at":"2026-08-03T07:34:22.029488Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2601.20147","last_updated":"2026-07-17T10:12:37Z","snapshot_observed_at":"2026-08-15T12:02:44.300500Z","submitted_at":"2026-01-28T00:45:28Z","title":"Not All Tokens Matter: Data-Centric Optimization for Efficient Code Summarization","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-03T07:34:22.029488Z"},"links":{"cited_paper":"/paper/2410.22793","citing_paper":"/paper/2601.20147"},"observation_digest":"sha256:04604fa92d2c38453e2809fe8c562bdf43ba92c66cb85039a6d1230b8859f92c","observation_id":"e32fd5bb-effa-4ac3-9817-e978d655e61b","resolution":{"observed_at":"2026-08-03T07:34:22.029488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.22793","last_updated":"2025-06-11T04:25:03Z","snapshot_observed_at":"2026-08-16T13:04:39.498672Z","submitted_at":"2024-10-30T08:17:10Z","title":"Less is More: DocString Compression in Code Generation","version":3},"cited_work":{"arxiv_id":"2410.22793","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.22793","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"52527cd1-1e7f-42bf-97f6-ef515aefb0a9","year":2025},"citing_paper":{"arxiv_id":"2602.01785","last_updated":"2026-08-14T09:39:49Z","snapshot_observed_at":"2026-08-19T23:09:06.003911Z","submitted_at":"2026-02-02T08:10:21Z","title":"Seeing is Coding: On the Effectiveness of Vision Language Models in Code Understanding","version":2},"reference_index":102,"source":"pdf_text","source_observed_at":"2026-05-16T08:30:50.984873Z"},"links":{"cited_paper":"/paper/2410.22793","citing_paper":"/paper/2602.01785"},"observation_digest":"sha256:8134e04c4759fe35d9b91c971954eb89cb7d6adbf765666ebc77c43ea8ea2c84","observation_id":"05a9464b-2fb8-4962-8842-f0ff0546172f","resolution":{"observed_at":"2026-05-16T08:32:36.529752Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2410.22793/citation-record","integrity":"/paper/2410.22793/integrity","json":"/paper/2410.22793/citation-record.json","paper":"/paper/2410.22793"},"outbound":[],"paper":{"arxiv_id":"2410.22793","last_updated":"2025-06-11T04:25:03Z","latest_version":3,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T13:04:39.498672Z","submitted_at":"2024-10-30T08:17:10Z","title":"Less is More: DocString Compression in Code Generation"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2410.22793."}