{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z7VIWMKC37DI55EQQ4TY6MFQT5","short_pith_number":"pith:Z7VIWMKC","canonical_record":{"source":{"id":"1604.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T16:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"2c2e59dee4aeb24868d91c2315a32512f8c39df525cd5afe8958fbb3572b0570","abstract_canon_sha256":"1828c30d0bf8613575d999ae2cb0c2abaa7a8468bafe93326f0ec2bf92400cd9"},"schema_version":"1.0"},"canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","source":{"kind":"arxiv","id":"1604.08491","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08491","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08491v1","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08491","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z7VIWMKC37DI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z7VIWMKC37DI55EQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z7VIWMKC","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z7VIWMKC37DI55EQQ4TY6MFQT5","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08491","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T16:15:17Z","cross_cats_sorted":[],"title_canon_sha256":"2c2e59dee4aeb24868d91c2315a32512f8c39df525cd5afe8958fbb3572b0570","abstract_canon_sha256":"1828c30d0bf8613575d999ae2cb0c2abaa7a8468bafe93326f0ec2bf92400cd9"},"schema_version":"1.0"},"canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:03.817365Z","signature_b64":"NofPT5Fm/PsRvt8N6mive0hdV+8xw65NcVUxzkazSTIz8egW+hf2xjI4ftYzASD1Nd1gLwCzWTQQzw3A9P/YCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","last_reissued_at":"2026-05-18T01:16:03.816621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:03.816621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08491","source_version":1,"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ViD9aVLt/1pshB/gxyU9+uupGRI/KYxE1MHC1+jvPJBel0RBa8CV66BMhgFJ3J4YKLBeq6UrLSqnux05ZW9KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:22:47.642234Z"},"content_sha256":"b24fe60fc915764eaecd91412f84c71ea1f94c70d2a94ff138ee2d1f58f3ccaf","schema_version":"1.0","event_id":"sha256:b24fe60fc915764eaecd91412f84c71ea1f94c70d2a94ff138ee2d1f58f3ccaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z7VIWMKC37DI55EQQ4TY6MFQT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic Maximal Matching in Constant Update Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shay Solomon","submitted_at":"2016-04-28T16:15:17Z","abstract_excerpt":"Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be maintained in general graphs with logarithmic amortized update time. More specifically, starting from an empty graph on $n$ fixed vertices, they devised a randomized algorithm for maintaining maximal matching over any sequence of $t$ edge insertions and deletions with a total runtime of $O(t \\log n)$ in expectation and $O(t \\log n + n \\log^2 n)$ with high probability. Whether or not this runtime bound can be improved towards $O(t)$ has remained an important open problem. Despite significant research efforts, thi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08491","kind":"arxiv","version":1},"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rc36lVhgNjGrOF8D5S13qbgGVwi5og3VqzFRZ4CVcPwk00Imcbl0MoNWF2UdtT9Jwk1d018uCGiqD58JMhQyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T04:22:47.642922Z"},"content_sha256":"a345be78a125ca0369bf29ecc56c0056152b91a6850191ac753aeb6f9bc4d16b","schema_version":"1.0","event_id":"sha256:a345be78a125ca0369bf29ecc56c0056152b91a6850191ac753aeb6f9bc4d16b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/bundle.json","state_url":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/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-27T04:22:47Z","links":{"resolver":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5","bundle":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/bundle.json","state":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z7VIWMKC37DI55EQQ4TY6MFQT5","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":"1828c30d0bf8613575d999ae2cb0c2abaa7a8468bafe93326f0ec2bf92400cd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T16:15:17Z","title_canon_sha256":"2c2e59dee4aeb24868d91c2315a32512f8c39df525cd5afe8958fbb3572b0570"},"schema_version":"1.0","source":{"id":"1604.08491","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08491","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08491v1","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08491","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"Z7VIWMKC37DI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z7VIWMKC37DI55EQ","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z7VIWMKC","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:a345be78a125ca0369bf29ecc56c0056152b91a6850191ac753aeb6f9bc4d16b","target":"graph","created_at":"2026-05-18T01:16:03Z","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":"Baswana, Gupta and Sen [FOCS'11] showed that fully dynamic maximal matching can be maintained in general graphs with logarithmic amortized update time. More specifically, starting from an empty graph on $n$ fixed vertices, they devised a randomized algorithm for maintaining maximal matching over any sequence of $t$ edge insertions and deletions with a total runtime of $O(t \\log n)$ in expectation and $O(t \\log n + n \\log^2 n)$ with high probability. Whether or not this runtime bound can be improved towards $O(t)$ has remained an important open problem. Despite significant research efforts, thi","authors_text":"Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T16:15:17Z","title":"Fully Dynamic Maximal Matching in Constant Update Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08491","kind":"arxiv","version":1},"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:b24fe60fc915764eaecd91412f84c71ea1f94c70d2a94ff138ee2d1f58f3ccaf","target":"record","created_at":"2026-05-18T01:16:03Z","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":"1828c30d0bf8613575d999ae2cb0c2abaa7a8468bafe93326f0ec2bf92400cd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-28T16:15:17Z","title_canon_sha256":"2c2e59dee4aeb24868d91c2315a32512f8c39df525cd5afe8958fbb3572b0570"},"schema_version":"1.0","source":{"id":"1604.08491","kind":"arxiv","version":1}},"canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","first_computed_at":"2026-05-18T01:16:03.816621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:03.816621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NofPT5Fm/PsRvt8N6mive0hdV+8xw65NcVUxzkazSTIz8egW+hf2xjI4ftYzASD1Nd1gLwCzWTQQzw3A9P/YCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:03.817365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08491","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b24fe60fc915764eaecd91412f84c71ea1f94c70d2a94ff138ee2d1f58f3ccaf","sha256:a345be78a125ca0369bf29ecc56c0056152b91a6850191ac753aeb6f9bc4d16b"],"state_sha256":"9a3ed3c9083ef38bb34742a16fc77c7e5362ac373d4866ce7f6c353faca0309c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HwJLxgqdRUWtpHbeRKNDuFRv+1EcLvN0ZBt9VlQSwnCjLkrsdBKHk06+57qGAPNwGBy/bWwIcCRM9oRtNFqjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T04:22:47.646067Z","bundle_sha256":"37b3e1f011da0f75a14a2e6e94e90e93797903c341f234d98d64ac96910f2b1f"}}