{"as_of":"2026-08-06T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4110c994cce7d65652049032918778e600d5fca0416c8d839edc624f072bb7ba","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T22:02:19.709831Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2511.13193/citation-record","integrity":"/paper/2511.13193/integrity","json":"/paper/2511.13193/citation-record.json","paper":"/paper/2511.13193"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-04T15:46:25.710484Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":"2110.14168","doi":"10.1002/j.1545-","metadata_source":"pith","pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Training Verifiers to Solve Math Word Problems","venue":"cs.LG","work_id":"acab1aa8-b4d6-40e0-a3ee-25341701dca2","year":2021},"citing_paper":{"arxiv_id":"2511.13193","last_updated":"2026-04-24T04:00:13Z","snapshot_observed_at":"2026-07-06T22:36:00.635873Z","submitted_at":"2025-11-17T10:00:20Z","title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T22:02:19.709831Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2511.13193"},"observation_digest":"sha256:cd1058529870ed9ca627e2be3f9de6a3269acff4d62f1762cac4b326a8006dde","observation_id":"b494948b-31da-41f8-b1d0-93ec19f3a9a0","resolution":{"observed_at":"2026-05-17T22:05:21.620560Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In Christodoulopoulos, C.; Chakraborty, T.; Rose, C.; and Peng, V ., eds.,Findings of the Association for Computational Linguistics: EMNLP 2025, 6243–6256","venue":null,"work_id":"4de518cd-5a99-4a86-9978-fb2245f4bc43","year":2025},"citing_paper":{"arxiv_id":"2511.13193","last_updated":"2026-04-24T04:00:13Z","snapshot_observed_at":"2026-07-06T22:36:00.635873Z","submitted_at":"2025-11-17T10:00:20Z","title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T22:02:19.709831Z"},"links":{"citing_paper":"/paper/2511.13193"},"observation_digest":"sha256:5f499de3f7252748551b33779eba3953ea211aed722e27a55daf3e54bee305f8","observation_id":"7bc15071-d4a8-479c-abbf-af36f8534185","resolution":{"observed_at":"2026-05-17T22:05:22.218742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.00720","last_updated":"2023-01-30T09:15:49Z","snapshot_observed_at":"2026-07-06T13:58:52.579337Z","submitted_at":"2022-10-03T05:33:27Z","title":"Complexity-Based Prompting for Multi-Step Reasoning","version":2},"cited_work":{"arxiv_id":"2210.00720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.00720","snapshot_observed_at":"2026-07-05T10:20:57.247384Z","title":"Complexity-based prompting for multi-step reasoning","venue":"cs.CL","work_id":"346e5048-02d1-410f-b165-2e5ffdafc2a5","year":2022},"citing_paper":{"arxiv_id":"2511.13193","last_updated":"2026-04-24T04:00:13Z","snapshot_observed_at":"2026-07-06T22:36:00.635873Z","submitted_at":"2025-11-17T10:00:20Z","title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T22:02:19.709831Z"},"links":{"cited_paper":"/paper/2210.00720","citing_paper":"/paper/2511.13193"},"observation_digest":"sha256:034ec84b9c77d0da5959b95a63e18ee9d13d31e275ff3a7ecea253b9ed35c8f4","observation_id":"dcf7f8a8-43cb-494c-bd9f-7530518a896c","resolution":{"observed_at":"2026-05-17T22:05:21.624184Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.01403","last_updated":"2024-02-01T23:12:41Z","snapshot_observed_at":"2026-08-06T02:16:40.784256Z","submitted_at":"2023-07-03T23:51:05Z","title":"Learning Multi-Agent Communication with Contrastive Learning","version":3},"cited_work":{"arxiv_id":"2307.01403","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2307.01403","snapshot_observed_at":"2026-06-29T17:13:44.524898Z","title":"org/abs/2307.01403","venue":null,"work_id":"d0597815-0ec9-4d43-b82b-db632e29b9fd","year":2023},"citing_paper":{"arxiv_id":"2511.13193","last_updated":"2026-04-24T04:00:13Z","snapshot_observed_at":"2026-07-06T22:36:00.635873Z","submitted_at":"2025-11-17T10:00:20Z","title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T22:02:19.709831Z"},"links":{"cited_paper":"/paper/2307.01403","citing_paper":"/paper/2511.13193"},"observation_digest":"sha256:4ee2c433aabe1f1560f171dae2f3f6c8cd2107bac1b0341fba51f494e8ec828c","observation_id":"800bd4c9-fc92-45bd-8ec6-e5a689463759","resolution":{"observed_at":"2026-05-17T22:05:21.617171Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.13193","last_updated":"2026-04-24T04:00:13Z","latest_version":2,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T22:36:00.635873Z","submitted_at":"2025-11-17T10:00:20Z","title":"Cost-Effective Communication: An Auction-based Method for Language Agent Interaction"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":4},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2511.13193."}