{"as_of":"2026-08-09T10:13:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:15a64fd7f1d3d114d82c393a2db09f3d86adfebd615fff3ce2b57450f72dc6a9","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:46:10.814831Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2402.14833","last_updated":"2024-02-17T22:37:17Z","snapshot_observed_at":"2026-08-09T03:05:21.906518Z","submitted_at":"2024-02-17T22:37:17Z","title":"CliqueParcel: An Approach For Batching LLM Prompts That Jointly Optimizes Efficiency And Faithfulness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14833","snapshot_observed_at":"2026-08-02T07:46:10.814831Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20528","last_updated":"2026-07-10T06:32:31Z","snapshot_observed_at":"2026-08-07T06:22:41.372249Z","submitted_at":"2026-07-10T06:32:31Z","title":"PromptPack: Scaling LLM Annotation Agents for Online Recommendation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T07:46:10.814831Z"},"links":{"cited_paper":"/paper/2402.14833","citing_paper":"/paper/2607.20528"},"observation_digest":"sha256:ec25898dbb3050ec151061172676992a76f6035834268f33b9a6c019b505213f","observation_id":"710f83e2-cc6f-4e0b-a563-03b36f121344","resolution":{"observed_at":"2026-08-02T07:46:10.814831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14833","last_updated":"2024-02-17T22:37:17Z","snapshot_observed_at":"2026-08-09T03:05:21.906518Z","submitted_at":"2024-02-17T22:37:17Z","title":"CliqueParcel: An Approach For Batching LLM Prompts That Jointly Optimizes Efficiency And Faithfulness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.14833","snapshot_observed_at":"2026-08-01T03:37:49.943200Z","title":"Juicer: Data- efficient imitation learning for robotic assembly,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23108","last_updated":"2026-07-25T08:41:52Z","snapshot_observed_at":"2026-08-07T14:28:05.616462Z","submitted_at":"2026-07-25T08:41:52Z","title":"The Curse of Precision: A Data Scaling Law for High-Precision Robotic Manipulation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T03:37:49.943200Z"},"links":{"cited_paper":"/paper/2402.14833","citing_paper":"/paper/2607.23108"},"observation_digest":"sha256:be525d2f8953abcc50618aa24cf539bdcee8f00c0caf0853f50751d268f9b1ad","observation_id":"f765127e-8f89-4d3a-95c8-e719e9dc7098","resolution":{"observed_at":"2026-08-01T03:37:49.943200Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.14833/citation-record","integrity":"/paper/2402.14833/integrity","json":"/paper/2402.14833/citation-record.json","paper":"/paper/2402.14833"},"outbound":[],"paper":{"arxiv_id":"2402.14833","last_updated":"2024-02-17T22:37:17Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T03:05:21.906518Z","submitted_at":"2024-02-17T22:37:17Z","title":"CliqueParcel: An Approach For Batching LLM Prompts That Jointly Optimizes Efficiency And Faithfulness"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2402.14833."}