{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TPMOJNOIP57TDDIHPI27DWRWO3","short_pith_number":"pith:TPMOJNOI","canonical_record":{"source":{"id":"1611.05616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T09:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"bba43a33f34d0ef320960aaca0105ce7d61f3645ac0e5b5231f214e4b1a6e9cb","abstract_canon_sha256":"2bd7f5672ab999a5fce46f243c08f560260f97f3f94810973e596dde2601d9b0"},"schema_version":"1.0"},"canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","source":{"kind":"arxiv","id":"1611.05616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05616","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05616v1","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05616","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"TPMOJNOIP57T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPMOJNOIP57TDDIH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPMOJNOI","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TPMOJNOIP57TDDIHPI27DWRWO3","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T09:29:44Z","cross_cats_sorted":[],"title_canon_sha256":"bba43a33f34d0ef320960aaca0105ce7d61f3645ac0e5b5231f214e4b1a6e9cb","abstract_canon_sha256":"2bd7f5672ab999a5fce46f243c08f560260f97f3f94810973e596dde2601d9b0"},"schema_version":"1.0"},"canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:03.111454Z","signature_b64":"kppSsVjf7uePUTNArDS/kLtbqgLGWm6frZrD0oY47kPIBsAB6dN7OnD1SRAiBxMll8SDEsj22QF28zpK4GjPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","last_reissued_at":"2026-05-18T00:58:03.110850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:03.110850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05616","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vwxCsnYug78CZsUWduIGnZkYHUp14JxBWSvHeuL/ziP+ng17Mq8jYTuLaL1hGVrMudBSr0vj+ld8ypKvRa6AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:30:04.528399Z"},"content_sha256":"573d76f6b7ee26e9485599cb70e2d5828f66fbcc2a6380a324d9292dc4ed3fd7","schema_version":"1.0","event_id":"sha256:573d76f6b7ee26e9485599cb70e2d5828f66fbcc2a6380a324d9292dc4ed3fd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TPMOJNOIP57TDDIHPI27DWRWO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self-Stabilizing Maximal Matching and Anonymous Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Devan Sohier, Johanne Cohen, Jonas Lef\\`evre, Khaled Ma\\^amra, Laurence Pilard","submitted_at":"2016-11-17T09:29:44Z","abstract_excerpt":"We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under the classical link-register model, a self-stabilizing algorithm that gives a unique name to a link such that this name is shared by both extremities of the link."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05616","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:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wU0Os2bobKPGiRgOVzWqfjyU5mPuVCCwA8xqaUmNEK2cTHUBO6rjUqgjC+ZDRzV7XmaSpIBaxGxw9JJtNM/4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:30:04.528764Z"},"content_sha256":"df8e977b4add0984343734de98acaefac6a09ca2b4190ab335c01a59204fac63","schema_version":"1.0","event_id":"sha256:df8e977b4add0984343734de98acaefac6a09ca2b4190ab335c01a59204fac63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/bundle.json","state_url":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TPMOJNOIP57TDDIHPI27DWRWO3/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-27T07:30:04Z","links":{"resolver":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3","bundle":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/bundle.json","state":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TPMOJNOIP57TDDIHPI27DWRWO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TPMOJNOIP57TDDIHPI27DWRWO3","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":"2bd7f5672ab999a5fce46f243c08f560260f97f3f94810973e596dde2601d9b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T09:29:44Z","title_canon_sha256":"bba43a33f34d0ef320960aaca0105ce7d61f3645ac0e5b5231f214e4b1a6e9cb"},"schema_version":"1.0","source":{"id":"1611.05616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05616","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05616v1","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05616","created_at":"2026-05-18T00:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"TPMOJNOIP57T","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"TPMOJNOIP57TDDIH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"TPMOJNOI","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:df8e977b4add0984343734de98acaefac6a09ca2b4190ab335c01a59204fac63","target":"graph","created_at":"2026-05-18T00:58:03Z","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 propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is $O(n^3)$ moves with high probability, under the adversarial distributed daemon. In this algorithm, each node can determine whether one of its neighbors points to it or to another node, leading to a contradiction with the anonymous assumption. To solve this problem, we provide under the classical link-register model, a self-stabilizing algorithm that gives a unique name to a link such that this name is shared by both extremities of the link.","authors_text":"Devan Sohier, Johanne Cohen, Jonas Lef\\`evre, Khaled Ma\\^amra, Laurence Pilard","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T09:29:44Z","title":"Self-Stabilizing Maximal Matching and Anonymous Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05616","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:573d76f6b7ee26e9485599cb70e2d5828f66fbcc2a6380a324d9292dc4ed3fd7","target":"record","created_at":"2026-05-18T00:58:03Z","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":"2bd7f5672ab999a5fce46f243c08f560260f97f3f94810973e596dde2601d9b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-17T09:29:44Z","title_canon_sha256":"bba43a33f34d0ef320960aaca0105ce7d61f3645ac0e5b5231f214e4b1a6e9cb"},"schema_version":"1.0","source":{"id":"1611.05616","kind":"arxiv","version":1}},"canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","first_computed_at":"2026-05-18T00:58:03.110850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:03.110850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kppSsVjf7uePUTNArDS/kLtbqgLGWm6frZrD0oY47kPIBsAB6dN7OnD1SRAiBxMll8SDEsj22QF28zpK4GjPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:03.111454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573d76f6b7ee26e9485599cb70e2d5828f66fbcc2a6380a324d9292dc4ed3fd7","sha256:df8e977b4add0984343734de98acaefac6a09ca2b4190ab335c01a59204fac63"],"state_sha256":"94ea8e03df3b6b71644ee08bcbfc96b60fd409c8a39e4ae0487c35e518057310"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xob/JGci0rnQkdvmspIZlImqvcra9xnvjtdTTRUvZpHidGReAnUXiHWyDpgLPuSyhS5pTdDfAqJUFyhz6R6EAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:30:04.530934Z","bundle_sha256":"fa953f29072d376fe5c1fe8c8232e700267d7a606f2875889ac82ca2f70c380e"}}