{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:65EJJNC327S3PR4WDABHJOTI7Y","short_pith_number":"pith:65EJJNC3","schema_version":"1.0","canonical_sha256":"f74894b45bd7e5b7c796180274ba68fe287f290e1fcf97a8884cafffb837c26b","source":{"kind":"arxiv","id":"1504.06534","version":1},"attestation_state":"computed","paper":{"title":"An Automata-Theoretic Approach to the Verification of Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Benedikt Bollig, C. Aiswarya, Paul Gastin","submitted_at":"2015-04-24T15:03:08Z","abstract_excerpt":"We introduce an automata-theoretic method for the verification of distributed algorithms running on ring networks. In a distributed algorithm, an arbitrary number of processes cooperate to achieve a common goal (e.g., elect a leader). Processes have unique identifiers (pids) from an infinite, totally ordered domain. An algorithm proceeds in synchronous rounds, each round allowing a process to perform a bounded sequence of actions such as send or receive a pid, store it in some register, and compare register contents wrt. the associated total order. An algorithm is supposed to be correct indepe"},"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":"1504.06534","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-24T15:03:08Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"824b20819a1a44bee28cf7c090dfd292695d6480f8e78cffa2d1339b79165067","abstract_canon_sha256":"cb353cf758451be8b2478635c0b37f2633b6a0bde13a3d708b92200ae2b99688"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:53.365978Z","signature_b64":"BaFWly5Nnwmvp8HWXELCBpGZ3rG+a3Oqk0aV1Drsf1k07tMpzRvN/nk9nx7XJT7eXWwKMDak60Ud6mugvjrHAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74894b45bd7e5b7c796180274ba68fe287f290e1fcf97a8884cafffb837c26b","last_reissued_at":"2026-05-18T02:17:53.365409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:53.365409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Automata-Theoretic Approach to the Verification of Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Benedikt Bollig, C. Aiswarya, Paul Gastin","submitted_at":"2015-04-24T15:03:08Z","abstract_excerpt":"We introduce an automata-theoretic method for the verification of distributed algorithms running on ring networks. In a distributed algorithm, an arbitrary number of processes cooperate to achieve a common goal (e.g., elect a leader). Processes have unique identifiers (pids) from an infinite, totally ordered domain. An algorithm proceeds in synchronous rounds, each round allowing a process to perform a bounded sequence of actions such as send or receive a pid, store it in some register, and compare register contents wrt. the associated total order. An algorithm is supposed to be correct indepe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06534","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":"1504.06534","created_at":"2026-05-18T02:17:53.365529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06534v1","created_at":"2026-05-18T02:17:53.365529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06534","created_at":"2026-05-18T02:17:53.365529+00:00"},{"alias_kind":"pith_short_12","alias_value":"65EJJNC327S3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"65EJJNC327S3PR4W","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"65EJJNC3","created_at":"2026-05-18T12:29:07.941421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y","json":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y.json","graph_json":"https://pith.science/api/pith-number/65EJJNC327S3PR4WDABHJOTI7Y/graph.json","events_json":"https://pith.science/api/pith-number/65EJJNC327S3PR4WDABHJOTI7Y/events.json","paper":"https://pith.science/paper/65EJJNC3"},"agent_actions":{"view_html":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y","download_json":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y.json","view_paper":"https://pith.science/paper/65EJJNC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06534&json=true","fetch_graph":"https://pith.science/api/pith-number/65EJJNC327S3PR4WDABHJOTI7Y/graph.json","fetch_events":"https://pith.science/api/pith-number/65EJJNC327S3PR4WDABHJOTI7Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y/action/storage_attestation","attest_author":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y/action/author_attestation","sign_citation":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y/action/citation_signature","submit_replication":"https://pith.science/pith/65EJJNC327S3PR4WDABHJOTI7Y/action/replication_record"}},"created_at":"2026-05-18T02:17:53.365529+00:00","updated_at":"2026-05-18T02:17:53.365529+00:00"}