{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:63IOWUNWRAFESJ6AXYKWOWNPTJ","short_pith_number":"pith:63IOWUNW","canonical_record":{"source":{"id":"1807.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T11:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"6ad7a2e8f97526dfd6c8344d6352c366314e1da46fc4e1a51d12417f7016770c","abstract_canon_sha256":"6fd2be498c84a30317f6c9ff75fa36d9c6a30c9d57c4d41009290c9931c0ef65"},"schema_version":"1.0"},"canonical_sha256":"f6d0eb51b6880a4927c0be156759af9a42f92a37f91ddea93d4fee3b0b0cf34a","source":{"kind":"arxiv","id":"1807.05009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05009","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05009v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05009","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"63IOWUNWRAFE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63IOWUNWRAFESJ6A","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63IOWUNW","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:63IOWUNWRAFESJ6AXYKWOWNPTJ","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T11:11:34Z","cross_cats_sorted":[],"title_canon_sha256":"6ad7a2e8f97526dfd6c8344d6352c366314e1da46fc4e1a51d12417f7016770c","abstract_canon_sha256":"6fd2be498c84a30317f6c9ff75fa36d9c6a30c9d57c4d41009290c9931c0ef65"},"schema_version":"1.0"},"canonical_sha256":"f6d0eb51b6880a4927c0be156759af9a42f92a37f91ddea93d4fee3b0b0cf34a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.237076Z","signature_b64":"kDb//Ng94+xoL27Qk52ncVM0WDZ3PjItKsGgX2mVL56IRcpPZzcGkN68mWNkzB3V0B6qS/wXsawJwn6sgC7SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6d0eb51b6880a4927c0be156759af9a42f92a37f91ddea93d4fee3b0b0cf34a","last_reissued_at":"2026-05-18T00:10:49.236511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.236511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05009","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-18T00:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+WjtmvfROk636s/lPQOKwQwX6o/XMgSAs0Bggb5yXODA1PWeO5K/ikBZ8vlcF5VBQrtB3xMxNbnMOjopf3DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:52:40.543365Z"},"content_sha256":"159ae11f57e97660c6649e22c459cc5a03d082eb4880fca3b1630e8b7a2f04df","schema_version":"1.0","event_id":"sha256:159ae11f57e97660c6649e22c459cc5a03d082eb4880fca3b1630e8b7a2f04df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:63IOWUNWRAFESJ6AXYKWOWNPTJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maintaning maximal matching with lookahead","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kitti Gelle, Szabolcs Ivan","submitted_at":"2018-07-13T11:11:34Z","abstract_excerpt":"In this paper we study the problem of fully dynamic maximal matching with lookahead. In a fully dynamic $n$-vertex graph setting, we have to handle updates (insertions and removals of edges), and answer queries regarding the current graph, preferably with a better time bound than that when running the trivial deterministic algorithm with worst-case time of $O(m)$ (where $m$ is the all-time maximum number of the edges) and recompute the matching from scratch each time a query arrives. We show that a maximal matching can be maintained in an (undirected) general graph with a deterministic amortiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05009","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-18T00:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2r6gZlTThns1HlBQlJbHF/zoIVLiAzQmDzNahNhoJ+VrvuiRDKrtR9SEYEJ5NcgQIfTHZQMNj1+CUsdw0ZuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T06:52:40.543714Z"},"content_sha256":"708b73a57bad33eb0550d0aa8c29df4c89f3cae97928b1d0f5e0850dd76d1a3f","schema_version":"1.0","event_id":"sha256:708b73a57bad33eb0550d0aa8c29df4c89f3cae97928b1d0f5e0850dd76d1a3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/bundle.json","state_url":"https://pith.science/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/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-06-24T06:52:40Z","links":{"resolver":"https://pith.science/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ","bundle":"https://pith.science/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/bundle.json","state":"https://pith.science/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/63IOWUNWRAFESJ6AXYKWOWNPTJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:63IOWUNWRAFESJ6AXYKWOWNPTJ","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":"6fd2be498c84a30317f6c9ff75fa36d9c6a30c9d57c4d41009290c9931c0ef65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T11:11:34Z","title_canon_sha256":"6ad7a2e8f97526dfd6c8344d6352c366314e1da46fc4e1a51d12417f7016770c"},"schema_version":"1.0","source":{"id":"1807.05009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05009","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05009v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05009","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"63IOWUNWRAFE","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"63IOWUNWRAFESJ6A","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"63IOWUNW","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:708b73a57bad33eb0550d0aa8c29df4c89f3cae97928b1d0f5e0850dd76d1a3f","target":"graph","created_at":"2026-05-18T00:10:49Z","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":"In this paper we study the problem of fully dynamic maximal matching with lookahead. In a fully dynamic $n$-vertex graph setting, we have to handle updates (insertions and removals of edges), and answer queries regarding the current graph, preferably with a better time bound than that when running the trivial deterministic algorithm with worst-case time of $O(m)$ (where $m$ is the all-time maximum number of the edges) and recompute the matching from scratch each time a query arrives. We show that a maximal matching can be maintained in an (undirected) general graph with a deterministic amortiz","authors_text":"Kitti Gelle, Szabolcs Ivan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T11:11:34Z","title":"Maintaning maximal matching with lookahead"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05009","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:159ae11f57e97660c6649e22c459cc5a03d082eb4880fca3b1630e8b7a2f04df","target":"record","created_at":"2026-05-18T00:10:49Z","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":"6fd2be498c84a30317f6c9ff75fa36d9c6a30c9d57c4d41009290c9931c0ef65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-13T11:11:34Z","title_canon_sha256":"6ad7a2e8f97526dfd6c8344d6352c366314e1da46fc4e1a51d12417f7016770c"},"schema_version":"1.0","source":{"id":"1807.05009","kind":"arxiv","version":1}},"canonical_sha256":"f6d0eb51b6880a4927c0be156759af9a42f92a37f91ddea93d4fee3b0b0cf34a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6d0eb51b6880a4927c0be156759af9a42f92a37f91ddea93d4fee3b0b0cf34a","first_computed_at":"2026-05-18T00:10:49.236511Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:49.236511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kDb//Ng94+xoL27Qk52ncVM0WDZ3PjItKsGgX2mVL56IRcpPZzcGkN68mWNkzB3V0B6qS/wXsawJwn6sgC7SBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:49.237076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:159ae11f57e97660c6649e22c459cc5a03d082eb4880fca3b1630e8b7a2f04df","sha256:708b73a57bad33eb0550d0aa8c29df4c89f3cae97928b1d0f5e0850dd76d1a3f"],"state_sha256":"d639c619f2e801cb53ce8c459280a87510303d23875e4287a13cd0d36132b24f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CA7pdXuOK0QYXP58b8Vf16lZcaf9FGJThXT6SkUXm8hXPnLHKrEPbVRovf7KKuH57duxuEivBGK6ESXrrs2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T06:52:40.545632Z","bundle_sha256":"7f5715d955b53bf24e10e5dbe9bc3780bec9147e55fc504fca313cfe47476059"}}