{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K4IMX33TOFKUGPRAEB4DQ4SU6P","short_pith_number":"pith:K4IMX33T","schema_version":"1.0","canonical_sha256":"5710cbef737155433e202078387254f3c768e0bfa636bb8c2cfdc709459352b7","source":{"kind":"arxiv","id":"1505.04409","version":1},"attestation_state":"computed","paper":{"title":"Automatic Completion of Distributed Protocols with Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Abhishek Udupa, Christos Stergiou, Mukund Raghothaman, Rajeev Alur, Stavros Tripakis","submitted_at":"2015-05-17T15:47:49Z","abstract_excerpt":"A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and its correctness is specified using safety and liveness requirements. Designing correct distributed protocols is a challenging task. Aimed at simplifying this task, we allow the designer to leave some of the guards and updates to state variables in the description of extended state machines as unknown functions. The protocol completion problem then is to find interpretations for these unknown functions while guaranteei"},"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":"1505.04409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-05-17T15:47:49Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ed969724105e87f9a8ab81c8caed8793f3f2ae5cb4ed6d42612f6e619b91fe1a","abstract_canon_sha256":"6a4f8cac65d26dc81f0cb37e8689e71fd253bf9f4bba047c416252ae1570e8d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.490776Z","signature_b64":"zpCBCVxeS9k0IuUpFymbtvocxxtiowPdOKIhlJW3dSHwhDHpSoLBbhTOVPP9z361emud0shhyxQXJDVKbpFfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5710cbef737155433e202078387254f3c768e0bfa636bb8c2cfdc709459352b7","last_reissued_at":"2026-05-18T02:07:25.490361Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.490361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Completion of Distributed Protocols with Symmetry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Abhishek Udupa, Christos Stergiou, Mukund Raghothaman, Rajeev Alur, Stavros Tripakis","submitted_at":"2015-05-17T15:47:49Z","abstract_excerpt":"A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and its correctness is specified using safety and liveness requirements. Designing correct distributed protocols is a challenging task. Aimed at simplifying this task, we allow the designer to leave some of the guards and updates to state variables in the description of extended state machines as unknown functions. The protocol completion problem then is to find interpretations for these unknown functions while guaranteei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04409","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":""},"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":"1505.04409","created_at":"2026-05-18T02:07:25.490427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04409v1","created_at":"2026-05-18T02:07:25.490427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04409","created_at":"2026-05-18T02:07:25.490427+00:00"},{"alias_kind":"pith_short_12","alias_value":"K4IMX33TOFKU","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K4IMX33TOFKUGPRA","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K4IMX33T","created_at":"2026-05-18T12:29:27.538025+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07935","citing_title":"TraceFix: Repairing Agent Coordination Protocols with TLA+ Counterexamples","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P","json":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P.json","graph_json":"https://pith.science/api/pith-number/K4IMX33TOFKUGPRAEB4DQ4SU6P/graph.json","events_json":"https://pith.science/api/pith-number/K4IMX33TOFKUGPRAEB4DQ4SU6P/events.json","paper":"https://pith.science/paper/K4IMX33T"},"agent_actions":{"view_html":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P","download_json":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P.json","view_paper":"https://pith.science/paper/K4IMX33T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04409&json=true","fetch_graph":"https://pith.science/api/pith-number/K4IMX33TOFKUGPRAEB4DQ4SU6P/graph.json","fetch_events":"https://pith.science/api/pith-number/K4IMX33TOFKUGPRAEB4DQ4SU6P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P/action/storage_attestation","attest_author":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P/action/author_attestation","sign_citation":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P/action/citation_signature","submit_replication":"https://pith.science/pith/K4IMX33TOFKUGPRAEB4DQ4SU6P/action/replication_record"}},"created_at":"2026-05-18T02:07:25.490427+00:00","updated_at":"2026-05-18T02:07:25.490427+00:00"}