{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OYWOCYQMVDVRFTUXWLWHSTX5EK","short_pith_number":"pith:OYWOCYQM","schema_version":"1.0","canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","source":{"kind":"arxiv","id":"1810.01073","version":2},"attestation_state":"computed","paper":{"title":"Fully dynamic $3/2$ approximate maximum cardinality matching in $O(\\sqrt{n})$ update time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manas Jyoti Kashyop, N.S. Narayanaswamy","submitted_at":"2018-10-02T05:26:00Z","abstract_excerpt":"We present a randomized algorithm to maintain a maximal matching without 3 length augmenting paths in the fully dynamic setting. Consequently, we maintain a $3/2$ approximate maximum cardinality matching. Our algorithm takes expected amortized $O(\\sqrt{n})$ time where $n$ is the number of vertices in the graph when the update sequence is generated by an oblivious adversary. Over any sequence of $t$ edge insertions and deletions presented by an oblivious adversary, the total update time of our algorithm is $O(t\\sqrt{n})$ in expectation and $O(t\\sqrt{n} + n \\log n)$ with high probability. To the"},"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":"1810.01073","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T05:26:00Z","cross_cats_sorted":[],"title_canon_sha256":"d338b4a51694b0621b3fc36fd8ea908c58d983f65c4f729965ac9b84152c3560","abstract_canon_sha256":"0eecb9f41382c30ad2bb178033c79a01a5cc55b0448c95174e222cf4a0263b79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.667926Z","signature_b64":"mmfR3wNgAe4pRLaODOB+OXg7GkQWrhWPD5GQW9tumjThLwGQIifP12gZwquv+RMck07XEETUOezzBNE3IClbCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","last_reissued_at":"2026-05-18T00:01:37.667411Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.667411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully dynamic $3/2$ approximate maximum cardinality matching in $O(\\sqrt{n})$ update time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manas Jyoti Kashyop, N.S. Narayanaswamy","submitted_at":"2018-10-02T05:26:00Z","abstract_excerpt":"We present a randomized algorithm to maintain a maximal matching without 3 length augmenting paths in the fully dynamic setting. Consequently, we maintain a $3/2$ approximate maximum cardinality matching. Our algorithm takes expected amortized $O(\\sqrt{n})$ time where $n$ is the number of vertices in the graph when the update sequence is generated by an oblivious adversary. Over any sequence of $t$ edge insertions and deletions presented by an oblivious adversary, the total update time of our algorithm is $O(t\\sqrt{n})$ in expectation and $O(t\\sqrt{n} + n \\log n)$ with high probability. To the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01073","kind":"arxiv","version":2},"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":"1810.01073","created_at":"2026-05-18T00:01:37.667479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01073v2","created_at":"2026-05-18T00:01:37.667479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01073","created_at":"2026-05-18T00:01:37.667479+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYWOCYQMVDVR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYWOCYQMVDVRFTUX","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYWOCYQM","created_at":"2026-05-18T12:32:43.782077+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/OYWOCYQMVDVRFTUXWLWHSTX5EK","json":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK.json","graph_json":"https://pith.science/api/pith-number/OYWOCYQMVDVRFTUXWLWHSTX5EK/graph.json","events_json":"https://pith.science/api/pith-number/OYWOCYQMVDVRFTUXWLWHSTX5EK/events.json","paper":"https://pith.science/paper/OYWOCYQM"},"agent_actions":{"view_html":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK","download_json":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK.json","view_paper":"https://pith.science/paper/OYWOCYQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01073&json=true","fetch_graph":"https://pith.science/api/pith-number/OYWOCYQMVDVRFTUXWLWHSTX5EK/graph.json","fetch_events":"https://pith.science/api/pith-number/OYWOCYQMVDVRFTUXWLWHSTX5EK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/action/storage_attestation","attest_author":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/action/author_attestation","sign_citation":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/action/citation_signature","submit_replication":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/action/replication_record"}},"created_at":"2026-05-18T00:01:37.667479+00:00","updated_at":"2026-05-18T00:01:37.667479+00:00"}