{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TPMOJNOIP57TDDIHPI27DWRWO3","short_pith_number":"pith:TPMOJNOI","schema_version":"1.0","canonical_sha256":"9bd8e4b5c87f7f318d077a35f1da3676ed0f5129946a240f1b8da343a9433a4b","source":{"kind":"arxiv","id":"1611.05616","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.05616","created_at":"2026-05-18T00:58:03.110941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05616v1","created_at":"2026-05-18T00:58:03.110941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05616","created_at":"2026-05-18T00:58:03.110941+00:00"},{"alias_kind":"pith_short_12","alias_value":"TPMOJNOIP57T","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"TPMOJNOIP57TDDIH","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"TPMOJNOI","created_at":"2026-05-18T12:30:46.583412+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/TPMOJNOIP57TDDIHPI27DWRWO3","json":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3.json","graph_json":"https://pith.science/api/pith-number/TPMOJNOIP57TDDIHPI27DWRWO3/graph.json","events_json":"https://pith.science/api/pith-number/TPMOJNOIP57TDDIHPI27DWRWO3/events.json","paper":"https://pith.science/paper/TPMOJNOI"},"agent_actions":{"view_html":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3","download_json":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3.json","view_paper":"https://pith.science/paper/TPMOJNOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05616&json=true","fetch_graph":"https://pith.science/api/pith-number/TPMOJNOIP57TDDIHPI27DWRWO3/graph.json","fetch_events":"https://pith.science/api/pith-number/TPMOJNOIP57TDDIHPI27DWRWO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/action/storage_attestation","attest_author":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/action/author_attestation","sign_citation":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/action/citation_signature","submit_replication":"https://pith.science/pith/TPMOJNOIP57TDDIHPI27DWRWO3/action/replication_record"}},"created_at":"2026-05-18T00:58:03.110941+00:00","updated_at":"2026-05-18T00:58:03.110941+00:00"}