{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BNJDMEKM4HUTGODXTHXYZ4ESUC","short_pith_number":"pith:BNJDMEKM","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"},"canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","source":{"kind":"arxiv","id":"1207.1277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1277","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1277v2","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1277","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"BNJDMEKM4HUT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BNJDMEKM4HUTGODX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BNJDMEKM","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BNJDMEKM4HUTGODXTHXYZ4ESUC","target":"record","payload":{"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"},"canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","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"},"source_kind":"arxiv","source_id":"1207.1277","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-18T03:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNZ+gW8rFjFi6Qc7HXGotMJt4Ex7+4m4UyYh//jrUkJbuVrCNK+S4qg5pqjP/+CPTp51ZomydQ7Ph3cTkTQiCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:26:29.828830Z"},"content_sha256":"3cadf28993477f2ed95bbe62efd467899d8e033cd19201bb5447b339eeb74fef","schema_version":"1.0","event_id":"sha256:3cadf28993477f2ed95bbe62efd467899d8e033cd19201bb5447b339eeb74fef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BNJDMEKM4HUTGODXTHXYZ4ESUC","target":"graph","payload":{"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"},"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-18T03:33:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9D5QZJz9hq0c/XeZDAkHxoyjYMN6vwnhjssaColeQclBrpoRDpZQXwOTr2LlXaScoYEUVulgAyKm2y3F+K1KCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T18:26:29.829227Z"},"content_sha256":"57ea05908673c734866469af058c116b90d5b3f5aea3490e04d016cb81010171","schema_version":"1.0","event_id":"sha256:57ea05908673c734866469af058c116b90d5b3f5aea3490e04d016cb81010171"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/bundle.json","state_url":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/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-27T18:26:29Z","links":{"resolver":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC","bundle":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/bundle.json","state":"https://pith.science/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BNJDMEKM4HUTGODXTHXYZ4ESUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BNJDMEKM4HUTGODXTHXYZ4ESUC","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":"7f23fe9d1bb42aff9c23c6c2beb232a2a8f514f2f8b490f80110ed7b503721e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-05T14:50:31Z","title_canon_sha256":"67e9e6e8c896f3ac79ae12168e4b71cde2b100bc220834652afafbfb62c19440"},"schema_version":"1.0","source":{"id":"1207.1277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1277","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1277v2","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1277","created_at":"2026-05-18T03:33:25Z"},{"alias_kind":"pith_short_12","alias_value":"BNJDMEKM4HUT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BNJDMEKM4HUTGODX","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BNJDMEKM","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:57ea05908673c734866469af058c116b90d5b3f5aea3490e04d016cb81010171","target":"graph","created_at":"2026-05-18T03:33:25Z","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":"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","authors_text":"Ofer Neiman, Shay Solomon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-05T14:50:31Z","title":"Simple Deterministic Algorithms for Fully Dynamic Maximal Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1277","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:3cadf28993477f2ed95bbe62efd467899d8e033cd19201bb5447b339eeb74fef","target":"record","created_at":"2026-05-18T03:33:25Z","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":"7f23fe9d1bb42aff9c23c6c2beb232a2a8f514f2f8b490f80110ed7b503721e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-05T14:50:31Z","title_canon_sha256":"67e9e6e8c896f3ac79ae12168e4b71cde2b100bc220834652afafbfb62c19440"},"schema_version":"1.0","source":{"id":"1207.1277","kind":"arxiv","version":2}},"canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b5236114ce1e933387799ef8cf092a0a96de3b82d44a504a4af23aa75ec100c","first_computed_at":"2026-05-18T03:33:25.892451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:25.892451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EVFelB2+r8GDtL+qtyNBOYVDznWW1wFVS+PdXWmRKnIUbhUj95i3k6XpocEhdnYDfBCUd0xI4OE1Gyog0vwWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:25.893129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cadf28993477f2ed95bbe62efd467899d8e033cd19201bb5447b339eeb74fef","sha256:57ea05908673c734866469af058c116b90d5b3f5aea3490e04d016cb81010171"],"state_sha256":"97ef7ae533c8205800b8d0a0da5389e0ae399c68fc0ca88df187361a8e9cc7be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2/51ijbzj8IhiA+Uos2eumX+/HtBc8Dhxeb5aQHDLL8jx2cRFfzWRPDdFg8EP/TnmFbraadxG4gwlsQV+CnsAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T18:26:29.832261Z","bundle_sha256":"647f86000b44993ec1196ba0d23734dac19655b90fb7d3d0b604952d79cbc73f"}}