{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z7VIWMKC37DI55EQQ4TY6MFQT5","short_pith_number":"pith:Z7VIWMKC","schema_version":"1.0","canonical_sha256":"cfea8b3142dfc68ef49087278f30b09f6dd9ce323b6f686c91030f6a482188f3","source":{"kind":"arxiv","id":"1604.08491","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08491","created_at":"2026-05-18T01:16:03.816733+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08491v1","created_at":"2026-05-18T01:16:03.816733+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08491","created_at":"2026-05-18T01:16:03.816733+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7VIWMKC37DI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7VIWMKC37DI55EQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7VIWMKC","created_at":"2026-05-18T12:30:53.716459+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/Z7VIWMKC37DI55EQQ4TY6MFQT5","json":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5.json","graph_json":"https://pith.science/api/pith-number/Z7VIWMKC37DI55EQQ4TY6MFQT5/graph.json","events_json":"https://pith.science/api/pith-number/Z7VIWMKC37DI55EQQ4TY6MFQT5/events.json","paper":"https://pith.science/paper/Z7VIWMKC"},"agent_actions":{"view_html":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5","download_json":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5.json","view_paper":"https://pith.science/paper/Z7VIWMKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08491&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7VIWMKC37DI55EQQ4TY6MFQT5/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7VIWMKC37DI55EQQ4TY6MFQT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/action/storage_attestation","attest_author":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/action/author_attestation","sign_citation":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/action/citation_signature","submit_replication":"https://pith.science/pith/Z7VIWMKC37DI55EQQ4TY6MFQT5/action/replication_record"}},"created_at":"2026-05-18T01:16:03.816733+00:00","updated_at":"2026-05-18T01:16:03.816733+00:00"}