{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WBDNS4OWIJB4B52HY6MLV6B7YL","short_pith_number":"pith:WBDNS4OW","schema_version":"1.0","canonical_sha256":"b046d971d64243c0f747c798baf83fc2fbd2091266caf90e067d1d3ce70929fb","source":{"kind":"arxiv","id":"2607.21909","version":1},"attestation_state":"computed","paper":{"title":"Claim Plane: Enforceable Change Intents and Dynamic Scope for Parallel Coding Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Maxim Nikolaev","submitted_at":"2026-07-24T02:30:50Z","abstract_excerpt":"Parallel coding agents can independently produce locally valid changes while still interfering at integration time, expanding beyond planned scope, or relying on premises invalidated by concurrent work. Existing responses emphasize communication, isolated workspaces, late merge-time repair, continuous supervision, or post-hoc runtime recovery. This paper presents Claim Plane, a model-agnostic coordination architecture that treats concurrent software change as a pre-write admission problem. Before implementation, each worker declares a versioned ChangeIntent containing an exact base commit, typ"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.21909","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2026-07-24T02:30:50Z","cross_cats_sorted":[],"title_canon_sha256":"43f334b8b86b32443c68b31ae080df59a80a18885f0427f0a1dd72e1406c6838","abstract_canon_sha256":"e280d3ad95d2621c14cc34bf0154471fd1d4190fabab5f4f74660c8465a68450"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T00:20:27.463247Z","signature_b64":"KWPeRRHs2T+Scbybq85tWkxKf2Ati2Lcyrg/Ngqwpjx4X+K+97ViSs4uPJxrausMkNbsdyUT4pqRMeLwfoDdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b046d971d64243c0f747c798baf83fc2fbd2091266caf90e067d1d3ce70929fb","last_reissued_at":"2026-07-27T00:20:27.462432Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T00:20:27.462432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Claim Plane: Enforceable Change Intents and Dynamic Scope for Parallel Coding Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Maxim Nikolaev","submitted_at":"2026-07-24T02:30:50Z","abstract_excerpt":"Parallel coding agents can independently produce locally valid changes while still interfering at integration time, expanding beyond planned scope, or relying on premises invalidated by concurrent work. Existing responses emphasize communication, isolated workspaces, late merge-time repair, continuous supervision, or post-hoc runtime recovery. This paper presents Claim Plane, a model-agnostic coordination architecture that treats concurrent software change as a pre-write admission problem. Before implementation, each worker declares a versioned ChangeIntent containing an exact base commit, typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.21909","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.21909/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.21909","created_at":"2026-07-27T00:20:27.462863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.21909v1","created_at":"2026-07-27T00:20:27.462863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.21909","created_at":"2026-07-27T00:20:27.462863+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBDNS4OWIJB4","created_at":"2026-07-27T00:20:27.462863+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBDNS4OWIJB4B52H","created_at":"2026-07-27T00:20:27.462863+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBDNS4OW","created_at":"2026-07-27T00:20:27.462863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.00947","citing_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","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL","json":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL.json","graph_json":"https://pith.science/api/pith-number/WBDNS4OWIJB4B52HY6MLV6B7YL/graph.json","events_json":"https://pith.science/api/pith-number/WBDNS4OWIJB4B52HY6MLV6B7YL/events.json","paper":"https://pith.science/paper/WBDNS4OW"},"agent_actions":{"view_html":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL","download_json":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL.json","view_paper":"https://pith.science/paper/WBDNS4OW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.21909&json=true","fetch_graph":"https://pith.science/api/pith-number/WBDNS4OWIJB4B52HY6MLV6B7YL/graph.json","fetch_events":"https://pith.science/api/pith-number/WBDNS4OWIJB4B52HY6MLV6B7YL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL/action/storage_attestation","attest_author":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL/action/author_attestation","sign_citation":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL/action/citation_signature","submit_replication":"https://pith.science/pith/WBDNS4OWIJB4B52HY6MLV6B7YL/action/replication_record"}},"created_at":"2026-07-27T00:20:27.462863+00:00","updated_at":"2026-07-27T00:20:27.462863+00:00"}