{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:PKMAIL2DPJHUEP75XLX5S5Y762","short_pith_number":"pith:PKMAIL2D","schema_version":"1.0","canonical_sha256":"7a98042f437a4f423ffdbaefd9771ff68b269f25998b6f236e13f39a7620b934","source":{"kind":"arxiv","id":"2605.15143","version":1},"attestation_state":"computed","paper":{"title":"Complete Local Reasoning About Parameterized Programs Over Topologies","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Safety verification of parameterized concurrent programs reduces to complete local proofs under suitable topology assumptions.","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Azadeh Farzan, Ruotong Cheng","submitted_at":"2026-05-14T17:47:24Z","abstract_excerpt":"This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to automatically produce a proof of correctness in the form of a universally quantified inductive invariant, where the quantification is over the nodes in the topology. We illustrate that under reasonable assumptions on the underlying topology, the problem can be reduced to and solved as a compositional scheme, that is, the verification of the parameterized family is reduced to a set of local proofs, in a complete manne"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15143","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2026-05-14T17:47:24Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"d2e81b86f63e65438e4a46be466612d037de109a3a05dae62678aaa9ffabe0da","abstract_canon_sha256":"5dbdde7bc0005cb26ebdc9fa67d906a3e2285e4023686b1c90d0205c94fc4a29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.2","canonical_sha256":"7a98042f437a4f423ffdbaefd9771ff68b269f25998b6f236e13f39a7620b934","last_reissued_at":"2026-05-17T21:57:18.865043Z","signature_status":"unsigned_v0","first_computed_at":"2026-05-17T21:40:25.546025Z"},"graph_snapshot":{"paper":{"title":"Complete Local Reasoning About Parameterized Programs Over Topologies","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Safety verification of parameterized concurrent programs reduces to complete local proofs under suitable topology assumptions.","cross_cats":["cs.PL"],"primary_cat":"cs.LO","authors_text":"Azadeh Farzan, Ruotong Cheng","submitted_at":"2026-05-14T17:47:24Z","abstract_excerpt":"This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to automatically produce a proof of correctness in the form of a universally quantified inductive invariant, where the quantification is over the nodes in the topology. We illustrate that under reasonable assumptions on the underlying topology, the problem can be reduced to and solved as a compositional scheme, that is, the verification of the parameterized family is reduced to a set of local proofs, in a complete manne"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"under reasonable assumptions on the underlying topology, the problem can be reduced to and solved as a compositional scheme, that is, the verification of the parameterized family is reduced to a set of local proofs, in a complete manner.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"reasonable assumptions on the underlying topology that enable the complete reduction from global parameterized verification to a finite set of local proofs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Safety verification of parameterized concurrent programs reduces to complete local proofs under suitable topology assumptions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25ec45519817a9e296911d811076b1dd0b869ea0e920adca10732ccd4d37e554"},"source":{"id":"2605.15143","kind":"arxiv","version":1},"verdict":{"id":"ee69543c-cc19-4d4b-a9f3-220cc8091c77","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:54:42.567055Z","strongest_claim":"under reasonable assumptions on the underlying topology, the problem can be reduced to and solved as a compositional scheme, that is, the verification of the parameterized family is reduced to a set of local proofs, in a complete manner.","one_line_summary":"Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"reasonable assumptions on the underlying topology that enable the complete reduction from global parameterized verification to a finite set of local proofs.","pith_extraction_headline":"Safety verification of parameterized concurrent programs reduces to complete local proofs under suitable topology assumptions."},"references":{"count":38,"sample":[{"doi":"10.1007/s10009-016-0424-3","year":2016,"title":"International Journal on Software Tools for Technology Transfer18(5), 469–473 (Oct 2016)","work_id":"6f9fcd7a-215f-4f6b-8a27-cc9420729506","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-35873-9_28","year":2013,"title":"In: Giacobazzi, R., Berdine, J., Mastroeni, I","work_id":"03f8af65-3450-43b4-aab5-7667d3571a90","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/s00446-017-0302-6","year":2018,"title":"Distributed Computing31(3), 187–222 (Jun 2018)","work_id":"927b1fb3-49be-4f11-8938-de128545fe2e","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/0020-0190(86)90071-2","year":1986,"title":"Information Processing Letters22(6), 307–309 (May 1986)","work_id":"206b569a-14f8-4eda-ac0d-d8a94b64b581","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/3-540-44585-4_19","year":2001,"title":"(eds.) Computer Aided Verification","work_id":"2479b61c-41df-4672-8bd7-7d12800b7d22","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":38,"snapshot_sha256":"51b326e8c50080db9d477efed3fbfdb1ee7fc37d18c7098b1307f8c3cbe5c5f7","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"c0f97d6a02212967ceba13e4dacbb37c8ba05a01eedb28ece17928f95f4403da"},"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":"2605.15143","created_at":"2026-05-17T21:18:33.156642+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15143v1","created_at":"2026-05-17T21:18:33.156642+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKMAIL2DPJHU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKMAIL2DPJHUEP75","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKMAIL2D","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762","json":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762.json","graph_json":"https://pith.science/api/pith-number/PKMAIL2DPJHUEP75XLX5S5Y762/graph.json","events_json":"https://pith.science/api/pith-number/PKMAIL2DPJHUEP75XLX5S5Y762/events.json","paper":"https://pith.science/paper/PKMAIL2D"},"agent_actions":{"view_html":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762","download_json":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762.json","view_paper":"https://pith.science/paper/PKMAIL2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15143&json=true","fetch_graph":"https://pith.science/api/pith-number/PKMAIL2DPJHUEP75XLX5S5Y762/graph.json","fetch_events":"https://pith.science/api/pith-number/PKMAIL2DPJHUEP75XLX5S5Y762/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762/action/storage_attestation","attest_author":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762/action/author_attestation","sign_citation":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762/action/citation_signature","submit_replication":"https://pith.science/pith/PKMAIL2DPJHUEP75XLX5S5Y762/action/replication_record"}},"created_at":"2026-05-17T21:18:33.156642+00:00","updated_at":"2026-05-17T21:57:18.865138+00:00"}