{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PLO67GVTQN2KAUN4Q3K6LY5M2T","short_pith_number":"pith:PLO67GVT","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"},"canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","source":{"kind":"arxiv","id":"1103.1109","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1109","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1109v4","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1109","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"PLO67GVTQN2K","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PLO67GVTQN2KAUN4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PLO67GVT","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PLO67GVTQN2KAUN4Q3K6LY5M2T","target":"record","payload":{"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"},"canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","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"},"source_kind":"arxiv","source_id":"1103.1109","source_version":4,"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-18T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZacQwAaxDF+Fkv4w87PUUp5SZ//Y0G6c55ESz6F2NyY8jqlh+eccHRjcbYBcVvAAX1msru6/fuY4HUHA47v/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:31.563910Z"},"content_sha256":"5f74dfc6ae6546c498efe373cbbdc0083013d516d021dc70f4a942591d2568fc","schema_version":"1.0","event_id":"sha256:5f74dfc6ae6546c498efe373cbbdc0083013d516d021dc70f4a942591d2568fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PLO67GVTQN2KAUN4Q3K6LY5M2T","target":"graph","payload":{"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"},"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-18T01:10:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNv0G2Mk/Rv8zxJD4bDFpQ+vX1bNmCwHGv3fUVws0M7kRwahi58WpIhSKf2ICZt214EF0uVwyFFSIjumRlDBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:12:31.564287Z"},"content_sha256":"626225a1bb217c4d735737e7c181ecdea4eb46e19bcd7d7fd8a4e5395abb342d","schema_version":"1.0","event_id":"sha256:626225a1bb217c4d735737e7c181ecdea4eb46e19bcd7d7fd8a4e5395abb342d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/bundle.json","state_url":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/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-05-30T13:12:31Z","links":{"resolver":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T","bundle":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/bundle.json","state":"https://pith.science/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLO67GVTQN2KAUN4Q3K6LY5M2T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PLO67GVTQN2KAUN4Q3K6LY5M2T","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":"bd6403d48fb495caa7469462157a05cf9de947cfab25c7676b82745ab4fed4ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-06T08:38:10Z","title_canon_sha256":"8fdd3b71fd5e3bf64ef7808dfe0ac8560467e87dc6120db31672a2685feb7cf4"},"schema_version":"1.0","source":{"id":"1103.1109","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1109","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1109v4","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1109","created_at":"2026-05-18T01:10:11Z"},{"alias_kind":"pith_short_12","alias_value":"PLO67GVTQN2K","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PLO67GVTQN2KAUN4","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PLO67GVT","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:626225a1bb217c4d735737e7c181ecdea4eb46e19bcd7d7fd8a4e5395abb342d","target":"graph","created_at":"2026-05-18T01:10:11Z","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 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","authors_text":"Manoj Gupta, Sandeep Sen, Surender Baswana","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-06T08:38:10Z","title":"Fully dynamic maximal matching in O(log n) update time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1109","kind":"arxiv","version":4},"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:5f74dfc6ae6546c498efe373cbbdc0083013d516d021dc70f4a942591d2568fc","target":"record","created_at":"2026-05-18T01:10:11Z","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":"bd6403d48fb495caa7469462157a05cf9de947cfab25c7676b82745ab4fed4ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-06T08:38:10Z","title_canon_sha256":"8fdd3b71fd5e3bf64ef7808dfe0ac8560467e87dc6120db31672a2685feb7cf4"},"schema_version":"1.0","source":{"id":"1103.1109","kind":"arxiv","version":4}},"canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7addef9ab38374a051bc86d5e5e3acd4f7127d875df342b0beb9f53121a93c99","first_computed_at":"2026-05-18T01:10:11.333344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:11.333344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZzzOSR2dmBX88QboWQOLS9WXOHtAxmf282D/EZma7jZpWjaSo7+VfYCWApD/rxlO+0+OHvYQXu0Ep9pzxkODA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:11.333766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1109","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f74dfc6ae6546c498efe373cbbdc0083013d516d021dc70f4a942591d2568fc","sha256:626225a1bb217c4d735737e7c181ecdea4eb46e19bcd7d7fd8a4e5395abb342d"],"state_sha256":"a3a25d12108dd19a0b4497b724082ce88c9038e45e8bb7c43a633141cedc5775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yIHV1dbMOZCb5xKvcmSU5IoQU/MY4FB0PWmfTtAQXBt42RQytN7Zkl+yDBgU9mIFn6eB+36IQHeqKfV1/ynHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:12:31.566613Z","bundle_sha256":"d9bd377ec2764d9158bcb589ed00632b27830f1c4efeb80c7e665cd73d15144f"}}