{"as_of":"2026-08-16T03:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6327dccfa1c8478dc5144b5897a7f06cbbcff1eaca02dc4c13301c6237ba8e2a","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T00:42:09.233032Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2608.00947/citation-record","integrity":"/paper/2608.00947/integrity","json":"/paper/2608.00947/citation-record.json","paper":"/paper/2608.00947"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.21909","last_updated":"2026-07-24T02:30:50Z","snapshot_observed_at":"2026-08-14T23:38:42.021364Z","submitted_at":"2026-07-24T02:30:50Z","title":"Claim Plane: Enforceable Change Intents and Dynamic Scope for Parallel Coding Agents","version":1},"cited_work":{"arxiv_id":"2607.21909","doi":"10.48550/arxiv.2607.21909","metadata_source":"pith","pith_arxiv_id":"2607.21909","snapshot_observed_at":"2026-08-06T06:16:15.181768Z","title":"Claim Plane: Enforceable Change Intents and Dynamic Scope for Parallel Coding Agents","venue":"cs.SE","work_id":"beb7b970-6a4a-4c12-993b-a2ccedcb4182","year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.317190Z"},"links":{"cited_paper":"/paper/2607.21909","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:2a5c0f9f816c853c3fdca2962ab471fcf0b19e0cd9a174eb85d7e8f019d9380f","observation_id":"8644ad68-b2ce-40f3-8ae5-385dfcee2e64","resolution":{"observed_at":"2026-08-06T00:42:09.431471Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-06T22:08:15.396007+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-06T22:08:15.396007+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:42:08.347228Z","title":"CooperBench: Why Coding Agents Cannot be Your Teammates Yet,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.347228Z"},"links":{"citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:206021dff500581b5f8a2c2fb99c781ecec02ec3b37761b9d8ce89c6ecf1e472","observation_id":"a3df6f03-157d-426d-b03c-c63ed76b100d","resolution":{"observed_at":"2026-08-06T00:42:08.347228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.21489","last_updated":"2026-07-08T16:30:55Z","snapshot_observed_at":"2026-08-15T20:58:05.925054Z","submitted_at":"2026-03-23T02:26:35Z","title":"Effective Strategies for Asynchronous Software Engineering Agents","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.21489","snapshot_observed_at":"2026-08-06T00:42:08.408093Z","title":"Effective Strategies for Asynchronous Software Engineering Agents,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.408093Z"},"links":{"cited_paper":"/paper/2603.21489","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:8cee4b474d7096586d470d96e70ded790b7dc6420cebd1dbb0d01dc7c3bdee7b","observation_id":"ab11394b-c7ee-4b0a-801e-6fe881ff1ada","resolution":{"observed_at":"2026-08-06T00:42:08.408093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.00953","last_updated":"2026-05-31T02:10:12Z","snapshot_observed_at":"2026-08-14T21:04:54.586909Z","submitted_at":"2026-05-31T02:10:12Z","title":"When Parallelism Pays Off: Cohesion-Aware Task Partitioning for Multi-Agent Coding","version":1},"cited_work":{"arxiv_id":"2606.00953","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.00953","snapshot_observed_at":"2026-08-06T00:42:10.430939Z","title":"When Parallelism Pays Off: Cohesion-Aware Task Partitioning for Multi-Agent Coding","venue":"cs.LG","work_id":"a2afc331-54fe-4181-9dce-585ba392e576","year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.478732Z"},"links":{"cited_paper":"/paper/2606.00953","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:1a2a346f13bb8c089135944b933dfaaf0dc351429dd7c687c7cb19a533e2da8d","observation_id":"44fb4960-cb11-4f7d-801f-d2eeffcb3789","resolution":{"observed_at":"2026-08-06T00:42:10.513715Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.10913","last_updated":"2026-06-24T17:55:07Z","snapshot_observed_at":"2026-08-13T15:51:48.523223Z","submitted_at":"2026-05-11T17:50:51Z","title":"Shepherd: Enabling Programmable Meta-Agents via Reversible Agentic Execution Traces","version":3},"cited_work":{"arxiv_id":"2605.10913","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.10913","snapshot_observed_at":"2026-08-06T00:42:10.237088Z","title":"Shepherd: Enabling Programmable Meta-Agents via Reversible Agentic Execution Traces","venue":"cs.AI","work_id":"f3efbc44-9b3d-4341-9143-d0c67dfcde38","year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.539209Z"},"links":{"cited_paper":"/paper/2605.10913","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:763acd301c4d2f9f9f65c888d60593fd3b27a69675b4d214e32445f2da35f4b2","observation_id":"d9702b0b-fa87-4443-81eb-fc9cf3fd8cf0","resolution":{"observed_at":"2026-08-06T00:42:10.337785Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:42:08.683170Z","title":"CodeCRDT: Observation -Driven Coordination for Multi -Agent LLM Code Generation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.683170Z"},"links":{"citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:506ae07f17f299b9d96f8e91b75618292c201a39f183bee65883dace7a3448cd","observation_id":"eed25649-2791-4541-aeaa-a2053a94a041","resolution":{"observed_at":"2026-08-06T00:42:08.683170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2607.00041","last_updated":"2026-06-29T16:02:38Z","snapshot_observed_at":"2026-08-13T16:18:46.839036Z","submitted_at":"2026-06-29T16:02:38Z","title":"ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesis","version":1},"cited_work":{"arxiv_id":"2607.00041","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.00041","snapshot_observed_at":"2026-08-06T00:42:09.745779Z","title":"ATM: CID-Brokered Pre-Write Admission for Multi-Agent Code Co-Synthesis","venue":"cs.SE","work_id":"06c867e3-2b0a-442c-9415-7b978d3fb185","year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.935439Z"},"links":{"cited_paper":"/paper/2607.00041","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:5088b7932b53fe5b38ae7a22b7abc1cfdc4f60640ca60b343dd3460c4452bc1c","observation_id":"68e107ed-cda7-405f-bd1d-fe3829ba98ca","resolution":{"observed_at":"2026-08-06T00:42:09.868303Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.26924","last_updated":"2026-06-25T12:02:18Z","snapshot_observed_at":"2026-07-07T00:01:10.711037Z","submitted_at":"2026-06-25T12:02:18Z","title":"A Deterministic Control Plane for LLM Coding Agents","version":1},"cited_work":{"arxiv_id":"2606.26924","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.26924","snapshot_observed_at":"2026-08-06T00:42:09.585494Z","title":"A Deterministic Control Plane for LLM Coding Agents","venue":"cs.SE","work_id":"3c4476ab-fec7-4d37-b171-94c5f75e1238","year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:09.004153Z"},"links":{"cited_paper":"/paper/2606.26924","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:a0ad3cd06ec6bf06d3146851c44b67998177d54174a665bf21dfa90fe2b2e3fe","observation_id":"62ec61dc-bf58-433d-9198-3f4c332d839f","resolution":{"observed_at":"2026-08-06T00:42:09.639297Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15793","last_updated":"2024-11-11T20:01:15Z","snapshot_observed_at":"2026-07-06T18:19:29.996982Z","submitted_at":"2024-05-06T17:41:33Z","title":"SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15793","snapshot_observed_at":"2026-08-06T00:42:09.081234Z","title":"SWE -agent: Agent-Computer Interfaces Enable Automated Software Engineering,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:09.081234Z"},"links":{"cited_paper":"/paper/2405.15793","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:dbb87f56f34c972b06f5c03b141de63e7b0de04988ba6f8702480f9dd64b128b","observation_id":"c749de02-7081-43e5-90cc-ff6c7e8cae1c","resolution":{"observed_at":"2026-08-06T00:42:09.081234Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.03310","last_updated":"2026-05-05T02:56:44Z","snapshot_observed_at":"2026-08-14T19:27:36.398385Z","submitted_at":"2026-05-05T02:56:44Z","title":"Coordination as an Architectural Layer for LLM-Based Multi-Agent Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.03310","snapshot_observed_at":"2026-08-06T00:42:09.150176Z","title":"Coordination as an Architectural Layer for LLM -Based Multi -Agent Systems,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:09.150176Z"},"links":{"cited_paper":"/paper/2605.03310","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:712096bceaf1ba913e62e963f5701044eb790a01853cb52c65ad8a9b70f7d829","observation_id":"63b696e5-acc5-4253-8d31-9f43b0f59f54","resolution":{"observed_at":"2026-08-06T00:42:09.150176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.18747","last_updated":"2026-05-18T17:59:03Z","snapshot_observed_at":"2026-08-16T00:13:58.777607Z","submitted_at":"2026-05-18T17:59:03Z","title":"Code as Agent Harness","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.18747","snapshot_observed_at":"2026-08-06T00:42:09.233032Z","title":"Code as Agent Harness,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:09.233032Z"},"links":{"cited_paper":"/paper/2605.18747","citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:f9dfab2896750b96e8434a0dc32cbf85c73f76db138c0d4692a2d7d903d8f0c8","observation_id":"c4122e39-c8a1-4e9b-962c-dc6b2c8a2204","resolution":{"observed_at":"2026-08-06T00:42:09.233032Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T00:42:08.849740Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-06T00:42:08.849740Z"},"links":{"citing_paper":"/paper/2608.00947"},"observation_digest":"sha256:e0f38de97cf193eeecbf210a6b4ee58f33fb516397bc7447c7d86da26e99db72","observation_id":"e8fd2cbc-b364-4504-931e-3af835b3491b","resolution":{"observed_at":"2026-08-06T00:42:08.849740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.00947","last_updated":"2026-08-02T02:56:49Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-14T21:31:39.598018Z","submitted_at":"2026-08-02T02:56:49Z","title":"Claim Plane: Reliability Gains and the Limits of Selective Concurrency for Parallel Coding Agents: A 30-Pair, Three-Seed Confirmatory Study of Deterministic Pre-Write Admission"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":12},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2608.00947."}