{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZZOQE5PSOZ3O76YWJH42SNGW5N","short_pith_number":"pith:ZZOQE5PS","canonical_record":{"source":{"id":"1611.06038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-18T10:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"dee6883ea5e2d1f6c8720874661efd27487b4c77862ec10ce795e29b222571cf","abstract_canon_sha256":"1e2586f51586aab9f21e2a87f3bfe62dc1cb0f71b53aacd930ca3a430342ae31"},"schema_version":"1.0"},"canonical_sha256":"ce5d0275f27676effb1649f9a934d6eb551eff7828b7f01da4f64873a614b322","source":{"kind":"arxiv","id":"1611.06038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06038","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06038v1","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06038","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZZOQE5PSOZ3O","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZZOQE5PSOZ3O76YW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZZOQE5PS","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZZOQE5PSOZ3O76YWJH42SNGW5N","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-18T10:50:23Z","cross_cats_sorted":[],"title_canon_sha256":"dee6883ea5e2d1f6c8720874661efd27487b4c77862ec10ce795e29b222571cf","abstract_canon_sha256":"1e2586f51586aab9f21e2a87f3bfe62dc1cb0f71b53aacd930ca3a430342ae31"},"schema_version":"1.0"},"canonical_sha256":"ce5d0275f27676effb1649f9a934d6eb551eff7828b7f01da4f64873a614b322","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:43.244096Z","signature_b64":"cAdZQrhFVx9sssiUO3On3YhR7uIamSzZ66kBhbyMGU1M4qlrQ/Xhb7SC2E+xhO8QTsqnlM4S50GVpKh6eAILCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce5d0275f27676effb1649f9a934d6eb551eff7828b7f01da4f64873a614b322","last_reissued_at":"2026-05-18T00:57:43.243403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:43.243403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06038","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:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4o/Bq5QNzbzGoAP2C3OeL1WsgfwWRYmnXC6l+WGIy94uMRTWYamkVTN/BAoJDss02T79RTzQ56W/KHSikuV2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:43:31.690540Z"},"content_sha256":"2719d0a00ee4679a0fe14435a368b171a4d8662587981a7565d72ebbed5c4338","schema_version":"1.0","event_id":"sha256:2719d0a00ee4679a0fe14435a368b171a4d8662587981a7565d72ebbed5c4338"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZZOQE5PSOZ3O76YWJH42SNGW5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Manoussakis, Johanne Cohen, Khaled Ma\\^amra, Laurence Pilard","submitted_at":"2016-11-18T10:50:23Z","abstract_excerpt":"We present the first polynomial self-stabilizing algorithm for finding a $\\frac23$-approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne \\emph{et al.} \\cite{ManneMPT11} and has a sub-exponential time complexity under the distributed adversarial daemon \\cite{Coor}. Our new algorithm is an adaptation of the Manne \\emph{et al.} algorithm and works under the same daemon, but with a time complexity in $O(n^3)$ moves. Moreover, our algorithm only needs one more boolean variable than the previous one, thus as in the Manne \\emph{et al.} a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06038","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:57:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tr4gcwXY8g8x7NK4ksCyutATgc4ueIuUMx+FVZ0V7amppWF0hYCjJTMO9y5l720PV2occCD9RSzngC8YXagaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T07:43:31.690898Z"},"content_sha256":"07ac67f875f1bb17b262b98c1fc09e87a1b1c1d183e42e2a0dc63a9272d77f51","schema_version":"1.0","event_id":"sha256:07ac67f875f1bb17b262b98c1fc09e87a1b1c1d183e42e2a0dc63a9272d77f51"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/bundle.json","state_url":"https://pith.science/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/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-06-23T07:43:31Z","links":{"resolver":"https://pith.science/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N","bundle":"https://pith.science/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/bundle.json","state":"https://pith.science/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZOQE5PSOZ3O76YWJH42SNGW5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZZOQE5PSOZ3O76YWJH42SNGW5N","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":"1e2586f51586aab9f21e2a87f3bfe62dc1cb0f71b53aacd930ca3a430342ae31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-18T10:50:23Z","title_canon_sha256":"dee6883ea5e2d1f6c8720874661efd27487b4c77862ec10ce795e29b222571cf"},"schema_version":"1.0","source":{"id":"1611.06038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06038","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06038v1","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06038","created_at":"2026-05-18T00:57:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZZOQE5PSOZ3O","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"ZZOQE5PSOZ3O76YW","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"ZZOQE5PS","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:07ac67f875f1bb17b262b98c1fc09e87a1b1c1d183e42e2a0dc63a9272d77f51","target":"graph","created_at":"2026-05-18T00:57:43Z","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 present the first polynomial self-stabilizing algorithm for finding a $\\frac23$-approximation of a maximum matching in a general graph. The previous best known algorithm has been presented by Manne \\emph{et al.} \\cite{ManneMPT11} and has a sub-exponential time complexity under the distributed adversarial daemon \\cite{Coor}. Our new algorithm is an adaptation of the Manne \\emph{et al.} algorithm and works under the same daemon, but with a time complexity in $O(n^3)$ moves. Moreover, our algorithm only needs one more boolean variable than the previous one, thus as in the Manne \\emph{et al.} a","authors_text":"George Manoussakis, Johanne Cohen, 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-18T10:50:23Z","title":"Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06038","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:2719d0a00ee4679a0fe14435a368b171a4d8662587981a7565d72ebbed5c4338","target":"record","created_at":"2026-05-18T00:57:43Z","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":"1e2586f51586aab9f21e2a87f3bfe62dc1cb0f71b53aacd930ca3a430342ae31","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-18T10:50:23Z","title_canon_sha256":"dee6883ea5e2d1f6c8720874661efd27487b4c77862ec10ce795e29b222571cf"},"schema_version":"1.0","source":{"id":"1611.06038","kind":"arxiv","version":1}},"canonical_sha256":"ce5d0275f27676effb1649f9a934d6eb551eff7828b7f01da4f64873a614b322","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce5d0275f27676effb1649f9a934d6eb551eff7828b7f01da4f64873a614b322","first_computed_at":"2026-05-18T00:57:43.243403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:43.243403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cAdZQrhFVx9sssiUO3On3YhR7uIamSzZ66kBhbyMGU1M4qlrQ/Xhb7SC2E+xhO8QTsqnlM4S50GVpKh6eAILCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:43.244096Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2719d0a00ee4679a0fe14435a368b171a4d8662587981a7565d72ebbed5c4338","sha256:07ac67f875f1bb17b262b98c1fc09e87a1b1c1d183e42e2a0dc63a9272d77f51"],"state_sha256":"7a35ca435cf44c95586100bf916c1bd4349c63e9177f7592ef82c5895aa9c08e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rHllkz32jTscpniEpUiVFSSFr+cY72PVPclNYgL9JUAkW8lC//48R9t0gFfNNfZtApUSPAZoe0V3UEYDI07XBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T07:43:31.692903Z","bundle_sha256":"5bf832843ff5fb312f00710642d8742e1149e1728071f780ad603edd5b0e3746"}}