{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LIEKPXOQLLW44NBG77DNBXFTXD","short_pith_number":"pith:LIEKPXOQ","canonical_record":{"source":{"id":"1709.04811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-14T14:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"e98dfe493ba23ac0b72b38f876f9bd8ecd5ad5169a80ba3bf6df48a4ac4e9da3","abstract_canon_sha256":"7ee04195e8be45b2ad1d0d6da4a07d10c4c1f90f6edfc1e85195f775157e1f28"},"schema_version":"1.0"},"canonical_sha256":"5a08a7ddd05aedce3426ffc6d0dcb3b8c19a306307d986207b76c83872c5ff67","source":{"kind":"arxiv","id":"1709.04811","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04811","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04811v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04811","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"LIEKPXOQLLW4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIEKPXOQLLW44NBG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIEKPXOQ","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LIEKPXOQLLW44NBG77DNBXFTXD","target":"record","payload":{"canonical_record":{"source":{"id":"1709.04811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-14T14:27:08Z","cross_cats_sorted":[],"title_canon_sha256":"e98dfe493ba23ac0b72b38f876f9bd8ecd5ad5169a80ba3bf6df48a4ac4e9da3","abstract_canon_sha256":"7ee04195e8be45b2ad1d0d6da4a07d10c4c1f90f6edfc1e85195f775157e1f28"},"schema_version":"1.0"},"canonical_sha256":"5a08a7ddd05aedce3426ffc6d0dcb3b8c19a306307d986207b76c83872c5ff67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:10.088379Z","signature_b64":"JQM3VN9/3/vHSu5xJ2HOgVi0Yt1j5c/8ymlfIN2N+mRKqIx8yxcGStzU0mwjWa1oRoLD4ziunUvtEYPV7UvTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a08a7ddd05aedce3426ffc6d0dcb3b8c19a306307d986207b76c83872c5ff67","last_reissued_at":"2026-05-18T00:35:10.087789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:10.087789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.04811","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-18T00:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hj3Xk7JRtoDJAgwGjfjrW7gItK4OFlSyN8ozizd/EcZTm8ySdd0GxzLb2Lqw6q97P5KOMIA7RIf6A7tdXjfsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:13:44.964283Z"},"content_sha256":"4fb556cf6580a319c3450808fc3e90edb11b96e25aff6b1e967d0ad963afa63b","schema_version":"1.0","event_id":"sha256:4fb556cf6580a319c3450808fc3e90edb11b96e25aff6b1e967d0ad963afa63b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LIEKPXOQLLW44NBG77DNBXFTXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A self-stabilizing algorithm for maximal matching in link-register model in $O(n\\Delta^3)$ moves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Devan Sohier, Georges Manoussakis, Johanne Cohen, Laurence Pilard","submitted_at":"2017-09-14T14:27:08Z","abstract_excerpt":"In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the link-register model under read/write atomicity, with complexity {$O(n\\Delta^3)$} moves under the adversarial distributed daemon, where $\\Delta$ is the maximum degree of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04811","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-18T00:35:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5i1AKngz+h5GabUBrUsM6sTay9yogeF/SXKPKUYKU3E6/f78z6wyaiuXr8dc1NrJHuaZ3b+3XstBtxOhUIiIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:13:44.964647Z"},"content_sha256":"8bca769147b232c8c210f4dc09a49bc01c3a892d0a685032b808afaba1084f89","schema_version":"1.0","event_id":"sha256:8bca769147b232c8c210f4dc09a49bc01c3a892d0a685032b808afaba1084f89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIEKPXOQLLW44NBG77DNBXFTXD/bundle.json","state_url":"https://pith.science/pith/LIEKPXOQLLW44NBG77DNBXFTXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIEKPXOQLLW44NBG77DNBXFTXD/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-05-28T04:13:44Z","links":{"resolver":"https://pith.science/pith/LIEKPXOQLLW44NBG77DNBXFTXD","bundle":"https://pith.science/pith/LIEKPXOQLLW44NBG77DNBXFTXD/bundle.json","state":"https://pith.science/pith/LIEKPXOQLLW44NBG77DNBXFTXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIEKPXOQLLW44NBG77DNBXFTXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LIEKPXOQLLW44NBG77DNBXFTXD","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":"7ee04195e8be45b2ad1d0d6da4a07d10c4c1f90f6edfc1e85195f775157e1f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-14T14:27:08Z","title_canon_sha256":"e98dfe493ba23ac0b72b38f876f9bd8ecd5ad5169a80ba3bf6df48a4ac4e9da3"},"schema_version":"1.0","source":{"id":"1709.04811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.04811","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"arxiv_version","alias_value":"1709.04811v1","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04811","created_at":"2026-05-18T00:35:10Z"},{"alias_kind":"pith_short_12","alias_value":"LIEKPXOQLLW4","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LIEKPXOQLLW44NBG","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LIEKPXOQ","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:8bca769147b232c8c210f4dc09a49bc01c3a892d0a685032b808afaba1084f89","target":"graph","created_at":"2026-05-18T00:35:10Z","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":"In the matching problem, each node maintains a pointer to one of its neighbor or to $null$, and a maximal matching is computed when each node points either to a neighbor that itself points to it (they are then called married), or to $null$, in which case no neighbor can also point to $null$. This paper presents a self-stabilizing distributed algorithm to compute a maximal matching in the link-register model under read/write atomicity, with complexity {$O(n\\Delta^3)$} moves under the adversarial distributed daemon, where $\\Delta$ is the maximum degree of the graph.","authors_text":"Devan Sohier, Georges Manoussakis, Johanne Cohen, Laurence Pilard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-14T14:27:08Z","title":"A self-stabilizing algorithm for maximal matching in link-register model in $O(n\\Delta^3)$ moves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04811","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:4fb556cf6580a319c3450808fc3e90edb11b96e25aff6b1e967d0ad963afa63b","target":"record","created_at":"2026-05-18T00:35:10Z","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":"7ee04195e8be45b2ad1d0d6da4a07d10c4c1f90f6edfc1e85195f775157e1f28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-14T14:27:08Z","title_canon_sha256":"e98dfe493ba23ac0b72b38f876f9bd8ecd5ad5169a80ba3bf6df48a4ac4e9da3"},"schema_version":"1.0","source":{"id":"1709.04811","kind":"arxiv","version":1}},"canonical_sha256":"5a08a7ddd05aedce3426ffc6d0dcb3b8c19a306307d986207b76c83872c5ff67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a08a7ddd05aedce3426ffc6d0dcb3b8c19a306307d986207b76c83872c5ff67","first_computed_at":"2026-05-18T00:35:10.087789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:10.087789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JQM3VN9/3/vHSu5xJ2HOgVi0Yt1j5c/8ymlfIN2N+mRKqIx8yxcGStzU0mwjWa1oRoLD4ziunUvtEYPV7UvTBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:10.088379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.04811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fb556cf6580a319c3450808fc3e90edb11b96e25aff6b1e967d0ad963afa63b","sha256:8bca769147b232c8c210f4dc09a49bc01c3a892d0a685032b808afaba1084f89"],"state_sha256":"9c98f616a944be47874566919b430cc55d2535abf2f01f977c23e983d7771491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbmkj6cKZeQSqmNN8W3i6g80rA29M3Vf2imBKNdVoslO3gZ86bvqfHIIF+k/OFR6Ent6+AMSP+y6usj4/HSDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:13:44.966740Z","bundle_sha256":"299bab6287fc07ca7066d47bd847db50a3ffaf6a5da4f1707af655f3552c4670"}}