{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LFXIXAIAPXO5Y6EXTOOO3AHZW6","short_pith_number":"pith:LFXIXAIA","schema_version":"1.0","canonical_sha256":"596e8b81007ddddc78979b9ced80f9b7836dac46820ac89b629af54c58b7ff23","source":{"kind":"arxiv","id":"1602.05928","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.05928","created_at":"2026-05-18T01:15:34.073811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.05928v3","created_at":"2026-05-18T01:15:34.073811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05928","created_at":"2026-05-18T01:15:34.073811+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFXIXAIAPXO5","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFXIXAIAPXO5Y6EX","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFXIXAIA","created_at":"2026-05-18T12:30:29.479603+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/LFXIXAIAPXO5Y6EXTOOO3AHZW6","json":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6.json","graph_json":"https://pith.science/api/pith-number/LFXIXAIAPXO5Y6EXTOOO3AHZW6/graph.json","events_json":"https://pith.science/api/pith-number/LFXIXAIAPXO5Y6EXTOOO3AHZW6/events.json","paper":"https://pith.science/paper/LFXIXAIA"},"agent_actions":{"view_html":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6","download_json":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6.json","view_paper":"https://pith.science/paper/LFXIXAIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.05928&json=true","fetch_graph":"https://pith.science/api/pith-number/LFXIXAIAPXO5Y6EXTOOO3AHZW6/graph.json","fetch_events":"https://pith.science/api/pith-number/LFXIXAIAPXO5Y6EXTOOO3AHZW6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/action/storage_attestation","attest_author":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/action/author_attestation","sign_citation":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/action/citation_signature","submit_replication":"https://pith.science/pith/LFXIXAIAPXO5Y6EXTOOO3AHZW6/action/replication_record"}},"created_at":"2026-05-18T01:15:34.073811+00:00","updated_at":"2026-05-18T01:15:34.073811+00:00"}