{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TG7CO6K3AW5DKY52MR6ANN3YKG","short_pith_number":"pith:TG7CO6K3","canonical_record":{"source":{"id":"1812.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-21T05:03:21Z","cross_cats_sorted":[],"title_canon_sha256":"b363ed73b48505794272afeb377bdb7a11d1624f606e19f3e29f15866a9ef153","abstract_canon_sha256":"4b342f78edbb39b26afb3637e716af1d7e062ff00defebc31e7f84dd59e3b0a3"},"schema_version":"1.0"},"canonical_sha256":"99be27795b05ba3563ba647c06b77851b408a97eebe5b67cee992785fcc85987","source":{"kind":"arxiv","id":"1812.08949","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08949","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08949v1","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08949","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"TG7CO6K3AW5D","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TG7CO6K3AW5DKY52","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TG7CO6K3","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TG7CO6K3AW5DKY52MR6ANN3YKG","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08949","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-21T05:03:21Z","cross_cats_sorted":[],"title_canon_sha256":"b363ed73b48505794272afeb377bdb7a11d1624f606e19f3e29f15866a9ef153","abstract_canon_sha256":"4b342f78edbb39b26afb3637e716af1d7e062ff00defebc31e7f84dd59e3b0a3"},"schema_version":"1.0"},"canonical_sha256":"99be27795b05ba3563ba647c06b77851b408a97eebe5b67cee992785fcc85987","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.745047Z","signature_b64":"Row/GKCAfMAzmvkszBg4XbGZ9yLMv+FIp1H8qRTXR9RFNgJ/IYZ3ClcRX+R11ebW7qxg02JmHmj+oGaYMaOEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99be27795b05ba3563ba647c06b77851b408a97eebe5b67cee992785fcc85987","last_reissued_at":"2026-05-17T23:41:30.744307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.744307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08949","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u9GT8pU795go9tQvOiOVwWwm888yKZgvhb1G5tHGb4D0ZgJjQ1nCZH52HBrcYcfU9zQuT7fvuIE7726SeeocAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:52:36.152807Z"},"content_sha256":"c2d3a95a00fe63b325e06a0f8f9f2756f772b61d442c9c5e4295ec81f10118ee","schema_version":"1.0","event_id":"sha256:c2d3a95a00fe63b325e06a0f8f9f2756f772b61d442c9c5e4295ec81f10118ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TG7CO6K3AW5DKY52MR6ANN3YKG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"\\'Etienne Andr\\'e, Jean-Marc Mota, Laurent Fribourg, Romain Soulat","submitted_at":"2018-12-21T05:03:21Z","abstract_excerpt":"The election of a leader in a network is a challenging task, especially when the processes are asynchronous, i.e., execute an algorithm with time-varying periods. Thales developed an industrial election algorithm with an arbitrary number of processes, that can possibly fail. In this work, we prove the correctness of a variant of this industrial algorithm. We use a method combining abstraction, the SafeProver solver, and a parametric timed model-checker. This allows us to prove the correctness of the algorithm for a large number p of processes (p=5000)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08949","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stB12MWzMDO9oUb9zBQkgJYuBTNkni7LLn3eZAvQc70aFUdRcvR+egati0FmOgBkcH7sd2qm9u5jgRizfTYJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:52:36.153150Z"},"content_sha256":"9286d65fcaa8eae586a62f13360764ec9cd4789cf6fb457f71b57b6419fa4f07","schema_version":"1.0","event_id":"sha256:9286d65fcaa8eae586a62f13360764ec9cd4789cf6fb457f71b57b6419fa4f07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/bundle.json","state_url":"https://pith.science/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T09:52:36Z","links":{"resolver":"https://pith.science/pith/TG7CO6K3AW5DKY52MR6ANN3YKG","bundle":"https://pith.science/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/bundle.json","state":"https://pith.science/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TG7CO6K3AW5DKY52MR6ANN3YKG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TG7CO6K3AW5DKY52MR6ANN3YKG","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4b342f78edbb39b26afb3637e716af1d7e062ff00defebc31e7f84dd59e3b0a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-21T05:03:21Z","title_canon_sha256":"b363ed73b48505794272afeb377bdb7a11d1624f606e19f3e29f15866a9ef153"},"schema_version":"1.0","source":{"id":"1812.08949","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08949","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08949v1","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08949","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"TG7CO6K3AW5D","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TG7CO6K3AW5DKY52","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TG7CO6K3","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:9286d65fcaa8eae586a62f13360764ec9cd4789cf6fb457f71b57b6419fa4f07","target":"graph","created_at":"2026-05-17T23:41:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The election of a leader in a network is a challenging task, especially when the processes are asynchronous, i.e., execute an algorithm with time-varying periods. Thales developed an industrial election algorithm with an arbitrary number of processes, that can possibly fail. In this work, we prove the correctness of a variant of this industrial algorithm. We use a method combining abstraction, the SafeProver solver, and a parametric timed model-checker. This allows us to prove the correctness of the algorithm for a large number p of processes (p=5000).","authors_text":"\\'Etienne Andr\\'e, Jean-Marc Mota, Laurent Fribourg, Romain Soulat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-21T05:03:21Z","title":"Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08949","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c2d3a95a00fe63b325e06a0f8f9f2756f772b61d442c9c5e4295ec81f10118ee","target":"record","created_at":"2026-05-17T23:41:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4b342f78edbb39b26afb3637e716af1d7e062ff00defebc31e7f84dd59e3b0a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-21T05:03:21Z","title_canon_sha256":"b363ed73b48505794272afeb377bdb7a11d1624f606e19f3e29f15866a9ef153"},"schema_version":"1.0","source":{"id":"1812.08949","kind":"arxiv","version":1}},"canonical_sha256":"99be27795b05ba3563ba647c06b77851b408a97eebe5b67cee992785fcc85987","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99be27795b05ba3563ba647c06b77851b408a97eebe5b67cee992785fcc85987","first_computed_at":"2026-05-17T23:41:30.744307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:30.744307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Row/GKCAfMAzmvkszBg4XbGZ9yLMv+FIp1H8qRTXR9RFNgJ/IYZ3ClcRX+R11ebW7qxg02JmHmj+oGaYMaOEBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:30.745047Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08949","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2d3a95a00fe63b325e06a0f8f9f2756f772b61d442c9c5e4295ec81f10118ee","sha256:9286d65fcaa8eae586a62f13360764ec9cd4789cf6fb457f71b57b6419fa4f07"],"state_sha256":"8c4ac3a600e5bbaed056849e84b9f172a7dea2be9479c5f269db93ab14b6b541"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHWDZgW6g6iauMCQQWEZk2gPkTVzToer1j0SbBhutwRJxSVG6EvVbrWpwlWLx+3oilcO+gk9xFhO2C38lzmbCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:52:36.155116Z","bundle_sha256":"aa5b0f81a1c13ff300870c8585ff669d2744aaf9fe77675860e7073e87e26328"}}