{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LFXIXAIAPXO5Y6EXTOOO3AHZW6","short_pith_number":"pith:LFXIXAIA","canonical_record":{"source":{"id":"1602.05928","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-18T19:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"e5e7e9a70e0ca608744d993a2784defe06127506bb1ac90d0555587679a21447","abstract_canon_sha256":"e044e22a4dbacfd86300c01e861527a04959976a1f4d57302109911fac615566"},"schema_version":"1.0"},"canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","source":{"kind":"arxiv","id":"1602.05928","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05928","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05928v3","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05928","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"LFXIXAIAPXO5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFXIXAIAPXO5Y6EX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFXIXAIA","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LFXIXAIAPXO5Y6EXTOOO3AHZW6","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05928","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-18T19:58:35Z","cross_cats_sorted":[],"title_canon_sha256":"e5e7e9a70e0ca608744d993a2784defe06127506bb1ac90d0555587679a21447","abstract_canon_sha256":"e044e22a4dbacfd86300c01e861527a04959976a1f4d57302109911fac615566"},"schema_version":"1.0"},"canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:34.074359Z","signature_b64":"hvaiZXG4gw7+vxlZlmAFVIsfuc7UaoFjgqq+UkVSWSmC1tHNqVHV4hE6jY4dB3tX0BpWPlywIuYk+Cm3nS9aAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","last_reissued_at":"2026-05-18T01:15:34.073738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:34.073738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05928","source_version":3,"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-18T01:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XatzlA/e/3pZS07LbKNLX/lgHhqwrN+fz0ZnrDddya0za3TxYLUW/SaJ59YJvvveRn0r44Sc2m+nfLSvVweNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:25:56.152696Z"},"content_sha256":"2a8efde7d1d2e8acf6445ddb15f5112a4a02453597bc7a6ef2cd33f8d423f757","schema_version":"1.0","event_id":"sha256:2a8efde7d1d2e8acf6445ddb15f5112a4a02453597bc7a6ef2cd33f8d423f757"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LFXIXAIAPXO5Y6EXTOOO3AHZW6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability in Networks of Register Protocols under Stochastic Schedulers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arnaud Sangnier, Daniel Stan, Mickael Randour, Nicolas Markey, Patricia Bouyer","submitted_at":"2016-02-18T19:58:35Z","abstract_excerpt":"We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite domain. The automaton has two types of transitions: write-transitions update the value of the register, while read-transitions move to a new state depending on the content of the register. Non-determinism is resolved by a stochastic scheduler. Given a protocol, we focus on almost-sure reachability of a target state by one of the processes. The answer to this p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05928","kind":"arxiv","version":3},"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-18T01:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvw8FqHMyb6KEyTRriY0gh3u0M+oMq77KTAGzcNhhh95YuLqMJWqzNO7ecAw/pBrE7ph3ooCjyLc+Mmd6637CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T21:25:56.153048Z"},"content_sha256":"5239f4feb621685106c8030c59aef3396536965bdb057b5ee20b3311cd1df93d","schema_version":"1.0","event_id":"sha256:5239f4feb621685106c8030c59aef3396536965bdb057b5ee20b3311cd1df93d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/bundle.json","state_url":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/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-23T21:25:56Z","links":{"resolver":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6","bundle":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/bundle.json","state":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LFXIXAIAPXO5Y6EXTOOO3AHZW6","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":"e044e22a4dbacfd86300c01e861527a04959976a1f4d57302109911fac615566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-18T19:58:35Z","title_canon_sha256":"e5e7e9a70e0ca608744d993a2784defe06127506bb1ac90d0555587679a21447"},"schema_version":"1.0","source":{"id":"1602.05928","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05928","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05928v3","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05928","created_at":"2026-05-18T01:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"LFXIXAIAPXO5","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LFXIXAIAPXO5Y6EX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LFXIXAIA","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:5239f4feb621685106c8030c59aef3396536965bdb057b5ee20b3311cd1df93d","target":"graph","created_at":"2026-05-18T01:15:34Z","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":"We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite domain. The automaton has two types of transitions: write-transitions update the value of the register, while read-transitions move to a new state depending on the content of the register. Non-determinism is resolved by a stochastic scheduler. Given a protocol, we focus on almost-sure reachability of a target state by one of the processes. The answer to this p","authors_text":"Arnaud Sangnier, Daniel Stan, Mickael Randour, Nicolas Markey, Patricia Bouyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-18T19:58:35Z","title":"Reachability in Networks of Register Protocols under Stochastic Schedulers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05928","kind":"arxiv","version":3},"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:2a8efde7d1d2e8acf6445ddb15f5112a4a02453597bc7a6ef2cd33f8d423f757","target":"record","created_at":"2026-05-18T01:15:34Z","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":"e044e22a4dbacfd86300c01e861527a04959976a1f4d57302109911fac615566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-18T19:58:35Z","title_canon_sha256":"e5e7e9a70e0ca608744d993a2784defe06127506bb1ac90d0555587679a21447"},"schema_version":"1.0","source":{"id":"1602.05928","kind":"arxiv","version":3}},"canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","first_computed_at":"2026-05-18T01:15:34.073738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:34.073738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvaiZXG4gw7+vxlZlmAFVIsfuc7UaoFjgqq+UkVSWSmC1tHNqVHV4hE6jY4dB3tX0BpWPlywIuYk+Cm3nS9aAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:34.074359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05928","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a8efde7d1d2e8acf6445ddb15f5112a4a02453597bc7a6ef2cd33f8d423f757","sha256:5239f4feb621685106c8030c59aef3396536965bdb057b5ee20b3311cd1df93d"],"state_sha256":"6d020ebdb1f669d1a1f08ea33f9c5a7d055ccfb579e39e09259b79af334ac250"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"neUtHHAygVwO1RMh8TllhP18hDBqemq0DrNF9HyHPoQWm3ZGtm3i14DW9rwY/usuozOhjvWRUMNHyr44UjymCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T21:25:56.155077Z","bundle_sha256":"be509a45c29c670bef747184667eb23cf0c3285b3c95b4dbc4455fa6aa21b37a"}}