{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OL6VEEKFWURNY3AK752GM34P5U","short_pith_number":"pith:OL6VEEKF","schema_version":"1.0","canonical_sha256":"72fd521145b522dc6c0aff74666f8fed08f52abb922e982e46783045192e15e1","source":{"kind":"arxiv","id":"1005.5630","version":1},"attestation_state":"computed","paper":{"title":"Reliable Self-Stabilizing Communication for Quasi Rendezvous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Lavault (LIPN), Colette Johnen (LaBRI), Ivan Lavallee (LAISC)","submitted_at":"2010-05-31T09:09:25Z","abstract_excerpt":"The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the previous value, whatever the initial scheduling of processes' actions. The second primitive implements a \"weak rendezvous\" communication mechanism by using an alternating bit protocol: whenever a proces"},"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":"1005.5630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-05-31T09:09:25Z","cross_cats_sorted":[],"title_canon_sha256":"ab8423e72c8700b0cad5821890a127631c11a6630ed7c090a3630223e19ed1af","abstract_canon_sha256":"b9c5d2c17f6ea2f4beaf8377a64dd49014f26c28fbcc974eae47bab2ee114c0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:07.916365Z","signature_b64":"X22nKdwExSq+1/GpC1zTejBuYlJhansOhUR/RokBAzXyszoTd5Sv7OwtbAU4zLN6IvSuDLNQMZk0MsRkMeXLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72fd521145b522dc6c0aff74666f8fed08f52abb922e982e46783045192e15e1","last_reissued_at":"2026-05-18T03:05:07.915817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:07.915817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable Self-Stabilizing Communication for Quasi Rendezvous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Lavault (LIPN), Colette Johnen (LaBRI), Ivan Lavallee (LAISC)","submitted_at":"2010-05-31T09:09:25Z","abstract_excerpt":"The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the previous value, whatever the initial scheduling of processes' actions. The second primitive implements a \"weak rendezvous\" communication mechanism by using an alternating bit protocol: whenever a proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5630","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":"1005.5630","created_at":"2026-05-18T03:05:07.915901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.5630v1","created_at":"2026-05-18T03:05:07.915901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5630","created_at":"2026-05-18T03:05:07.915901+00:00"},{"alias_kind":"pith_short_12","alias_value":"OL6VEEKFWURN","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OL6VEEKFWURNY3AK","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OL6VEEKF","created_at":"2026-05-18T12:26:12.377268+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/OL6VEEKFWURNY3AK752GM34P5U","json":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U.json","graph_json":"https://pith.science/api/pith-number/OL6VEEKFWURNY3AK752GM34P5U/graph.json","events_json":"https://pith.science/api/pith-number/OL6VEEKFWURNY3AK752GM34P5U/events.json","paper":"https://pith.science/paper/OL6VEEKF"},"agent_actions":{"view_html":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U","download_json":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U.json","view_paper":"https://pith.science/paper/OL6VEEKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.5630&json=true","fetch_graph":"https://pith.science/api/pith-number/OL6VEEKFWURNY3AK752GM34P5U/graph.json","fetch_events":"https://pith.science/api/pith-number/OL6VEEKFWURNY3AK752GM34P5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U/action/storage_attestation","attest_author":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U/action/author_attestation","sign_citation":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U/action/citation_signature","submit_replication":"https://pith.science/pith/OL6VEEKFWURNY3AK752GM34P5U/action/replication_record"}},"created_at":"2026-05-18T03:05:07.915901+00:00","updated_at":"2026-05-18T03:05:07.915901+00:00"}