{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ESOZVEYBIKZNN4NOOKJWS63WTU","short_pith_number":"pith:ESOZVEYB","schema_version":"1.0","canonical_sha256":"249d9a930142b2d6f1ae7293697b769d1566874403479a906f305823739656bc","source":{"kind":"arxiv","id":"1604.08066","version":3},"attestation_state":"computed","paper":{"title":"The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Manoussakis, Johanne Cohen, Jonas Lef\\`evre, Khaled Ma\\^amra, Laurence Pilard","submitted_at":"2016-04-27T13:40:55Z","abstract_excerpt":"Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in $O(^2n)$ moves. However, the complexity tightness was not proved. In this paper, we exhibit a sub-exponential execution of this matching algorithm."},"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":"1604.08066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-27T13:40:55Z","cross_cats_sorted":[],"title_canon_sha256":"a7b5efad98e01daa69be260e1d14d9f40022b8db2d84a61364d9594f89bc7fe9","abstract_canon_sha256":"b18f451506b995849d327313f27be272967837cc0501c6250d6bf7d2740e0006"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:16.735068Z","signature_b64":"w/4AxMrk+bWgKB5Je/msKWFX0F//XpO6ATNQKFye/NhUrMnZe2IBDxfOYYhSopufuNbBVvDsCsnEmBveitAYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249d9a930142b2d6f1ae7293697b769d1566874403479a906f305823739656bc","last_reissued_at":"2026-05-18T00:46:16.734587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:16.734587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"George Manoussakis, Johanne Cohen, Jonas Lef\\`evre, Khaled Ma\\^amra, Laurence Pilard","submitted_at":"2016-04-27T13:40:55Z","abstract_excerpt":"Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in $O(^2n)$ moves. However, the complexity tightness was not proved. In this paper, we exhibit a sub-exponential execution of this matching algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08066","kind":"arxiv","version":3},"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":"1604.08066","created_at":"2026-05-18T00:46:16.734660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08066v3","created_at":"2026-05-18T00:46:16.734660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08066","created_at":"2026-05-18T00:46:16.734660+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESOZVEYBIKZN","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESOZVEYBIKZNN4NO","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESOZVEYB","created_at":"2026-05-18T12:30:15.759754+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/ESOZVEYBIKZNN4NOOKJWS63WTU","json":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU.json","graph_json":"https://pith.science/api/pith-number/ESOZVEYBIKZNN4NOOKJWS63WTU/graph.json","events_json":"https://pith.science/api/pith-number/ESOZVEYBIKZNN4NOOKJWS63WTU/events.json","paper":"https://pith.science/paper/ESOZVEYB"},"agent_actions":{"view_html":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU","download_json":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU.json","view_paper":"https://pith.science/paper/ESOZVEYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08066&json=true","fetch_graph":"https://pith.science/api/pith-number/ESOZVEYBIKZNN4NOOKJWS63WTU/graph.json","fetch_events":"https://pith.science/api/pith-number/ESOZVEYBIKZNN4NOOKJWS63WTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU/action/storage_attestation","attest_author":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU/action/author_attestation","sign_citation":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU/action/citation_signature","submit_replication":"https://pith.science/pith/ESOZVEYBIKZNN4NOOKJWS63WTU/action/replication_record"}},"created_at":"2026-05-18T00:46:16.734660+00:00","updated_at":"2026-05-18T00:46:16.734660+00:00"}