{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:PLO67GVTQN2KAUN4Q3K6LY5M2T","short_pith_number":"pith:PLO67GVT","schema_version":"1.0","canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","source":{"kind":"arxiv","id":"1103.1109","version":4},"attestation_state":"computed","paper":{"title":"Fully dynamic maximal matching in O(log n) update time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Sandeep Sen, Surender Baswana","submitted_at":"2011-03-06T08:38:10Z","abstract_excerpt":"We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized time for each edge update where n is the number of vertices in the graph. While there is a trivial O(n) algorithm for edge update, the previous best known result for this problem for a graph with n vertices and m edges is O({(n+ m)}^{0.7072})which is sub-linear only for a sparse graph.\n  For the related problem of maximum matching, Onak and Rubinfield designed a randomized data structure that achieves O(log^2 n) amorti"},"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":"1103.1109","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-06T08:38:10Z","cross_cats_sorted":[],"title_canon_sha256":"8fdd3b71fd5e3bf64ef7808dfe0ac8560467e87dc6120db31672a2685feb7cf4","abstract_canon_sha256":"bd6403d48fb495caa7469462157a05cf9de947cfab25c7676b82745ab4fed4ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:11.333766Z","signature_b64":"7ZzzOSR2dmBX88QboWQOLS9WXOHtAxmf282D/EZma7jZpWjaSo7+VfYCWApD/rxlO+0+OHvYQXu0Ep9pzxkODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","last_reissued_at":"2026-05-18T01:10:11.333344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:11.333344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully dynamic maximal matching in O(log n) update time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Sandeep Sen, Surender Baswana","submitted_at":"2011-03-06T08:38:10Z","abstract_excerpt":"We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized time for each edge update where n is the number of vertices in the graph. While there is a trivial O(n) algorithm for edge update, the previous best known result for this problem for a graph with n vertices and m edges is O({(n+ m)}^{0.7072})which is sub-linear only for a sparse graph.\n  For the related problem of maximum matching, Onak and Rubinfield designed a randomized data structure that achieves O(log^2 n) amorti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1109","kind":"arxiv","version":4},"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":"1103.1109","created_at":"2026-05-18T01:10:11.333410+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.1109v4","created_at":"2026-05-18T01:10:11.333410+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1109","created_at":"2026-05-18T01:10:11.333410+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLO67GVTQN2K","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLO67GVTQN2KAUN4","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLO67GVT","created_at":"2026-05-18T12:26:39.201973+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/PLO67GVTQN2KAUN4Q3K6LY5M2T","json":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T.json","graph_json":"https://pith.science/api/pith-number/PLO67GVTQN2KAUN4Q3K6LY5M2T/graph.json","events_json":"https://pith.science/api/pith-number/PLO67GVTQN2KAUN4Q3K6LY5M2T/events.json","paper":"https://pith.science/paper/PLO67GVT"},"agent_actions":{"view_html":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T","download_json":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T.json","view_paper":"https://pith.science/paper/PLO67GVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.1109&json=true","fetch_graph":"https://pith.science/api/pith-number/PLO67GVTQN2KAUN4Q3K6LY5M2T/graph.json","fetch_events":"https://pith.science/api/pith-number/PLO67GVTQN2KAUN4Q3K6LY5M2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/action/storage_attestation","attest_author":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/action/author_attestation","sign_citation":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/action/citation_signature","submit_replication":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/action/replication_record"}},"created_at":"2026-05-18T01:10:11.333410+00:00","updated_at":"2026-05-18T01:10:11.333410+00:00"}