{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BNJDMEKM4HUTGODXTHXYZ4ESUC","short_pith_number":"pith:BNJDMEKM","schema_version":"1.0","canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","source":{"kind":"arxiv","id":"1207.1277","version":2},"attestation_state":"computed","paper":{"title":"Simple Deterministic Algorithms for Fully Dynamic Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ofer Neiman, Shay Solomon","submitted_at":"2012-07-05T14:50:31Z","abstract_excerpt":"A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) $n$-vertex graphs using a trivial deterministic algorithm with a worst-case update time of O(n). No deterministic algorithm that outperforms the na\\\"{\\i}ve O(n) one was reported up to this date. The only progress in this direction is due to Ivkovi\\'{c} and Lloyd \\cite{IL93}, who in 1993 devised a deterministic algorithm with an \\emph{amortized} update time of $O((n+m)^{\\sqrt{2}/2})$, where $m$ is the number of edges.\n  In this paper we show the first deterministic fully dynamic algorithm that"},"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":"1207.1277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-05T14:50:31Z","cross_cats_sorted":[],"title_canon_sha256":"67e9e6e8c896f3ac79ae12168e4b71cde2b100bc220834652afafbfb62c19440","abstract_canon_sha256":"7f23fe9d1bb42aff9c23c6c2beb232a2a8f514f2f8b490f80110ed7b503721e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:25.893129Z","signature_b64":"EVFelB2+r8GDtL+qtyNBOYVDznWW1wFVS+PdXWmRKnIUbhUj95i3k6XpocEhdnYDfBCUd0xI4OE1Gyog0vwWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","last_reissued_at":"2026-05-18T03:33:25.892451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:25.892451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Deterministic Algorithms for Fully Dynamic Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ofer Neiman, Shay Solomon","submitted_at":"2012-07-05T14:50:31Z","abstract_excerpt":"A maximal matching can be maintained in fully dynamic (supporting both addition and deletion of edges) $n$-vertex graphs using a trivial deterministic algorithm with a worst-case update time of O(n). No deterministic algorithm that outperforms the na\\\"{\\i}ve O(n) one was reported up to this date. The only progress in this direction is due to Ivkovi\\'{c} and Lloyd \\cite{IL93}, who in 1993 devised a deterministic algorithm with an \\emph{amortized} update time of $O((n+m)^{\\sqrt{2}/2})$, where $m$ is the number of edges.\n  In this paper we show the first deterministic fully dynamic algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1277","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":"1207.1277","created_at":"2026-05-18T03:33:25.892560+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.1277v2","created_at":"2026-05-18T03:33:25.892560+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1277","created_at":"2026-05-18T03:33:25.892560+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNJDMEKM4HUT","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNJDMEKM4HUTGODX","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNJDMEKM","created_at":"2026-05-18T12:27:01.376967+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/BNJDMEKM4HUTGODXTHXYZ4ESUC","json":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC.json","graph_json":"https://pith.science/api/pith-number/BNJDMEKM4HUTGODXTHXYZ4ESUC/graph.json","events_json":"https://pith.science/api/pith-number/BNJDMEKM4HUTGODXTHXYZ4ESUC/events.json","paper":"https://pith.science/paper/BNJDMEKM"},"agent_actions":{"view_html":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC","download_json":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC.json","view_paper":"https://pith.science/paper/BNJDMEKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.1277&json=true","fetch_graph":"https://pith.science/api/pith-number/BNJDMEKM4HUTGODXTHXYZ4ESUC/graph.json","fetch_events":"https://pith.science/api/pith-number/BNJDMEKM4HUTGODXTHXYZ4ESUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/action/storage_attestation","attest_author":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/action/author_attestation","sign_citation":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/action/citation_signature","submit_replication":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/action/replication_record"}},"created_at":"2026-05-18T03:33:25.892560+00:00","updated_at":"2026-05-18T03:33:25.892560+00:00"}