{"as_of":"2026-08-17T03:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1c7431ab247e5e616d7698baf00f2d08da5898d129ef8bb2b56305f3a93c31a2","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-16T06:30:59.297886+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-16T04:59:38.812138Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-16T04:59:39.222631Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.00384","last_updated":"2024-07-15T05:42:34Z","snapshot_observed_at":"2026-08-17T03:02:03.254789Z","submitted_at":"2023-09-01T10:44:36Z","title":"BatchPrompt: Accomplish more with less","version":3},"cited_work":{"arxiv_id":"2309.00384","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.00384","snapshot_observed_at":"2026-08-16T04:59:39.222631Z","title":"BatchPrompt: Accomplish more with less","venue":"cs.CL","work_id":"2dc7e011-6004-4dba-ba42-91f6b2ceba7d","year":2023},"citing_paper":{"arxiv_id":"2504.21773","last_updated":"2025-09-14T05:13:07Z","snapshot_observed_at":"2026-08-16T13:28:38.270136Z","submitted_at":"2025-04-30T16:17:53Z","title":"MAC-Tuning: LLM Multi-Compositional Problem Reasoning with Enhanced Knowledge Boundary Awareness","version":4},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T04:59:38.812138Z"},"links":{"cited_paper":"/paper/2309.00384","citing_paper":"/paper/2504.21773"},"observation_digest":"sha256:d0712a54cba586b9e36831e05a595282e494d7925a4ac71c74c65f2f8d866e72","observation_id":"5a14e150-44f3-42ef-84ea-006472352f12","resolution":{"observed_at":"2026-08-16T04:59:39.229757Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00384","last_updated":"2024-07-15T05:42:34Z","snapshot_observed_at":"2026-08-17T03:02:03.254789Z","submitted_at":"2023-09-01T10:44:36Z","title":"BatchPrompt: Accomplish more with less","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.00384","snapshot_observed_at":"2026-08-03T05:43:53.891321Z","title":"Batch- prompt: Accomplish more with less.arXiv preprint arXiv:2309.00384,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.01472","last_updated":"2026-06-24T08:53:47Z","snapshot_observed_at":"2026-08-03T05:43:51.520535Z","submitted_at":"2026-02-01T22:31:19Z","title":"ConPress: Learning Efficient Reasoning from Multi-Question Contextual Pressure","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T05:43:53.891321Z"},"links":{"cited_paper":"/paper/2309.00384","citing_paper":"/paper/2602.01472"},"observation_digest":"sha256:37f772be835534801984eba4ddde1074ff03ff98a0604d0e3838f371c66ac319","observation_id":"17128df2-5f3d-46db-9c34-d0ba9a685e3b","resolution":{"observed_at":"2026-08-03T05:43:53.891321Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.00384/citation-record","integrity":"/paper/2309.00384/integrity","json":"/paper/2309.00384/citation-record.json","paper":"/paper/2309.00384"},"outbound":[],"paper":{"arxiv_id":"2309.00384","last_updated":"2024-07-15T05:42:34Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-17T03:02:03.254789Z","submitted_at":"2023-09-01T10:44:36Z","title":"BatchPrompt: Accomplish more with less"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2309.00384."}