{"as_of":"2026-08-07T10:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dae915bca0a2c97309c86ef66734c0b7b654475a70695f7534336b1dc8c7fc1c","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-07T06:34:17.273281+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-07-02T18:19:43.146102Z","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-03T08:57:48.222117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.02605","last_updated":"2024-11-11T09:45:11Z","snapshot_observed_at":"2026-08-05T03:59:55.350262Z","submitted_at":"2024-04-03T09:51:39Z","title":"A Gauss-Seidel method for solving multi-leader-multi-follower games","version":2},"cited_work":{"arxiv_id":"2404.02605","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02605","snapshot_observed_at":"2026-07-03T08:57:48.222117Z","title":"arXiv preprint arXiv:2404.02605 , year=","venue":null,"work_id":"7ca3dbca-5170-4d97-b19b-fd065cfe01e0","year":2024},"citing_paper":{"arxiv_id":"2509.16941","last_updated":"2025-11-14T22:00:03Z","snapshot_observed_at":"2026-08-06T21:34:46.041153Z","submitted_at":"2025-09-21T06:28:17Z","title":"SWE-Bench Pro: Can AI Agents Solve Long-Horizon Software Engineering Tasks?","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T13:48:53.691192Z"},"links":{"cited_paper":"/paper/2404.02605","citing_paper":"/paper/2509.16941"},"observation_digest":"sha256:2ef2bf47c727d50056faf934de0f69d12e6d77e4cc5a24657988d15a039c307a","observation_id":"3f0b4741-ac2d-4463-a347-5a80fe12f348","resolution":{"observed_at":"2026-05-12T13:48:53.781577Z","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":"2404.02605","last_updated":"2024-11-11T09:45:11Z","snapshot_observed_at":"2026-08-05T03:59:55.350262Z","submitted_at":"2024-04-03T09:51:39Z","title":"A Gauss-Seidel method for solving multi-leader-multi-follower games","version":2},"cited_work":{"arxiv_id":"2404.02605","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02605","snapshot_observed_at":"2026-07-03T08:57:48.222117Z","title":"arXiv preprint arXiv:2404.02605 , year=","venue":null,"work_id":"7ca3dbca-5170-4d97-b19b-fd065cfe01e0","year":2024},"citing_paper":{"arxiv_id":"2606.18284","last_updated":"2026-06-10T02:04:29Z","snapshot_observed_at":"2026-07-06T23:53:45.117607Z","submitted_at":"2026-06-10T02:04:29Z","title":"Breaking the Solver Bottleneck: Training Task Generators at the Learnable Frontier","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-27T10:36:09.211639Z"},"links":{"cited_paper":"/paper/2404.02605","citing_paper":"/paper/2606.18284"},"observation_digest":"sha256:4c123c1fa69aac90d163be3db0380f7d9a6c8f86620c08479d9479b53116c7e7","observation_id":"4d811881-e0ef-4662-87ee-f02d5470d62d","resolution":{"observed_at":"2026-07-03T08:57:48.223715Z","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":"2404.02605","last_updated":"2024-11-11T09:45:11Z","snapshot_observed_at":"2026-08-05T03:59:55.350262Z","submitted_at":"2024-04-03T09:51:39Z","title":"A Gauss-Seidel method for solving multi-leader-multi-follower games","version":2},"cited_work":{"arxiv_id":"2404.02605","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.02605","snapshot_observed_at":"2026-07-03T08:57:48.222117Z","title":"arXiv preprint arXiv:2404.02605 , year=","venue":null,"work_id":"7ca3dbca-5170-4d97-b19b-fd065cfe01e0","year":2024},"citing_paper":{"arxiv_id":"2607.00053","last_updated":"2026-06-30T01:46:26Z","snapshot_observed_at":"2026-07-07T00:05:41.920778Z","submitted_at":"2026-06-30T01:46:26Z","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-07-02T18:19:43.146102Z"},"links":{"cited_paper":"/paper/2404.02605","citing_paper":"/paper/2607.00053"},"observation_digest":"sha256:f290855df791c09f8200aea8c8a353153a45d556c9eb655006e4c6584d94b548","observation_id":"889cf5cb-f0cc-47de-8cdc-7418580018b5","resolution":{"observed_at":"2026-07-02T18:37:16.512067Z","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/2404.02605/citation-record","integrity":"/paper/2404.02605/integrity","json":"/paper/2404.02605/citation-record.json","paper":"/paper/2404.02605"},"outbound":[],"paper":{"arxiv_id":"2404.02605","last_updated":"2024-11-11T09:45:11Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-05T03:59:55.350262Z","submitted_at":"2024-04-03T09:51:39Z","title":"A Gauss-Seidel method for solving multi-leader-multi-follower games"},"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 3 inbound Pith citation observations for arXiv:2404.02605."}