{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OYWOCYQMVDVRFTUXWLWHSTX5EK","short_pith_number":"pith:OYWOCYQM","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"},"canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","source":{"kind":"arxiv","id":"1810.01073","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01073","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01073v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01073","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"OYWOCYQMVDVR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYWOCYQMVDVRFTUX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYWOCYQM","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OYWOCYQMVDVRFTUXWLWHSTX5EK","target":"record","payload":{"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"},"canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","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"},"source_kind":"arxiv","source_id":"1810.01073","source_version":2,"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eF8uCXwOUpEtBwm/koSdl1kUssYThPH+73qFi8+NvF3U5GRcZWVecwZtIGCSnBUgc3ijgQjk2C/GVQo2YlIaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:44:23.151584Z"},"content_sha256":"5f71e47dce3f0efa9bbb61f0e6dd8890e281e9dd6feb5425e06123898ff16e29","schema_version":"1.0","event_id":"sha256:5f71e47dce3f0efa9bbb61f0e6dd8890e281e9dd6feb5425e06123898ff16e29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OYWOCYQMVDVRFTUXWLWHSTX5EK","target":"graph","payload":{"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"},"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:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J38zPiZVBNJt8Gr4KRFCeukpJA/gILIF2hl5/e8AsgLFEFfNZXdrSbqsljzasPTDzY/3XLCfElcm0SZirht9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T21:44:23.151923Z"},"content_sha256":"74460cd0f6519ba567a55262f895d0e2476938eb84f46c590bce7a8932c9f5a9","schema_version":"1.0","event_id":"sha256:74460cd0f6519ba567a55262f895d0e2476938eb84f46c590bce7a8932c9f5a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/bundle.json","state_url":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/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-26T21:44:23Z","links":{"resolver":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK","bundle":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/bundle.json","state":"https://pith.science/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYWOCYQMVDVRFTUXWLWHSTX5EK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OYWOCYQMVDVRFTUXWLWHSTX5EK","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":"0eecb9f41382c30ad2bb178033c79a01a5cc55b0448c95174e222cf4a0263b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T05:26:00Z","title_canon_sha256":"d338b4a51694b0621b3fc36fd8ea908c58d983f65c4f729965ac9b84152c3560"},"schema_version":"1.0","source":{"id":"1810.01073","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01073","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01073v2","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01073","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"OYWOCYQMVDVR","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OYWOCYQMVDVRFTUX","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OYWOCYQM","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:74460cd0f6519ba567a55262f895d0e2476938eb84f46c590bce7a8932c9f5a9","target":"graph","created_at":"2026-05-18T00:01:37Z","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 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","authors_text":"Manas Jyoti Kashyop, N.S. Narayanaswamy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T05:26:00Z","title":"Fully dynamic $3/2$ approximate maximum cardinality matching in $O(\\sqrt{n})$ update time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01073","kind":"arxiv","version":2},"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:5f71e47dce3f0efa9bbb61f0e6dd8890e281e9dd6feb5425e06123898ff16e29","target":"record","created_at":"2026-05-18T00:01:37Z","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":"0eecb9f41382c30ad2bb178033c79a01a5cc55b0448c95174e222cf4a0263b79","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-02T05:26:00Z","title_canon_sha256":"d338b4a51694b0621b3fc36fd8ea908c58d983f65c4f729965ac9b84152c3560"},"schema_version":"1.0","source":{"id":"1810.01073","kind":"arxiv","version":2}},"canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"762ce1620ca8eb12ce97b2ec794efd22a0ae37d9914926e6d433e464eb4762bc","first_computed_at":"2026-05-18T00:01:37.667411Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.667411Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mmfR3wNgAe4pRLaODOB+OXg7GkQWrhWPD5GQW9tumjThLwGQIifP12gZwquv+RMck07XEETUOezzBNE3IClbCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.667926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01073","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f71e47dce3f0efa9bbb61f0e6dd8890e281e9dd6feb5425e06123898ff16e29","sha256:74460cd0f6519ba567a55262f895d0e2476938eb84f46c590bce7a8932c9f5a9"],"state_sha256":"021f4ce17111a28503ed69e3e7684c8666df10034c7df818990eb56acc3819eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRH34FDW+6s90mhacAV+gYvEJX+2JwemX08J7pVKjOHC/hFwiBS3s1kdBWAOV/tVMvALhdK3CSuj5gCstXxUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T21:44:23.153753Z","bundle_sha256":"2b1a4a832f274cf8dd4b3e70ba604b341cd0585370b0950bc4b550df5d212ca0"}}