{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IFVQCHLDFVB5A33DSXF6YVHORI","short_pith_number":"pith:IFVQCHLD","canonical_record":{"source":{"id":"1304.0378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T15:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"3fa63fe10531123e5abde1f2ec7efd62acfcced5c2e513f599ea03be855490a8","abstract_canon_sha256":"cf534e3b34a472afb0f6ca48a35d68ac2b594bace7a3c771bf538b0d25578b6f"},"schema_version":"1.0"},"canonical_sha256":"416b011d632d43d06f6395cbec54ee8a37ddb86b4ecb92527b2cb259c83d28da","source":{"kind":"arxiv","id":"1304.0378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0378","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0378v2","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0378","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"IFVQCHLDFVB5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IFVQCHLDFVB5A33D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IFVQCHLD","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IFVQCHLDFVB5A33DSXF6YVHORI","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T15:29:21Z","cross_cats_sorted":[],"title_canon_sha256":"3fa63fe10531123e5abde1f2ec7efd62acfcced5c2e513f599ea03be855490a8","abstract_canon_sha256":"cf534e3b34a472afb0f6ca48a35d68ac2b594bace7a3c771bf538b0d25578b6f"},"schema_version":"1.0"},"canonical_sha256":"416b011d632d43d06f6395cbec54ee8a37ddb86b4ecb92527b2cb259c83d28da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:28.870245Z","signature_b64":"1mn+QqBtgZ0mnC6v49ZC2ABsezaQAyagtYkeR+ZS6ulKQ4IHBNxF2puMHTnHSbM6qL1u4Hmgiw7bMOepBzDfAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"416b011d632d43d06f6395cbec54ee8a37ddb86b4ecb92527b2cb259c83d28da","last_reissued_at":"2026-05-18T03:28:28.869400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:28.869400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0378","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOHYOr4nuNe1PHDW0RbxnYRk6Aw0CEpwhHZcKDTfA95UGpMZAziAxjUrHdMPz0Za4ekbfi7N+5tyaKUzkW1gBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:59:53.986994Z"},"content_sha256":"fa6e85725c9d67bbf8af20c356781a8749740732a003146563b1856b55a232dd","schema_version":"1.0","event_id":"sha256:fa6e85725c9d67bbf8af20c356781a8749740732a003146563b1856b55a232dd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IFVQCHLDFVB5A33DSXF6YVHORI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Dynamic $(1+\\epsilon)$-Approximate Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Manoj Gupta, Richard Peng","submitted_at":"2013-04-01T15:29:21Z","abstract_excerpt":"We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a $(1+\\epsilon)$ approximation of maximum matching under edge insertions/deletions in worst case $O(\\sqrt{m}\\epsilon^{-2})$ time per update. This improves the 3/2 approximation given in [Neiman,Solomon,STOC 2013] which runs in similar time. The result is based on two ideas. The first is to re-run a static algorithm after a chosen number of updates to ensure approximation guarantees. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0378","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:28:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I+UH77dCAi0PdKkMdj/mtkABeFc+kPnIjUyh/a5/uOE2zXPwPI18FOQQtnG+Lw0PYGZT7vOi25I/kgVMbDTYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:59:53.987357Z"},"content_sha256":"00f57359f0de4c438c8b802c6afd4a38172bfe5ae9c6ed68b740d900c7f76c19","schema_version":"1.0","event_id":"sha256:00f57359f0de4c438c8b802c6afd4a38172bfe5ae9c6ed68b740d900c7f76c19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFVQCHLDFVB5A33DSXF6YVHORI/bundle.json","state_url":"https://pith.science/pith/IFVQCHLDFVB5A33DSXF6YVHORI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFVQCHLDFVB5A33DSXF6YVHORI/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-29T23:59:53Z","links":{"resolver":"https://pith.science/pith/IFVQCHLDFVB5A33DSXF6YVHORI","bundle":"https://pith.science/pith/IFVQCHLDFVB5A33DSXF6YVHORI/bundle.json","state":"https://pith.science/pith/IFVQCHLDFVB5A33DSXF6YVHORI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFVQCHLDFVB5A33DSXF6YVHORI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IFVQCHLDFVB5A33DSXF6YVHORI","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":"cf534e3b34a472afb0f6ca48a35d68ac2b594bace7a3c771bf538b0d25578b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T15:29:21Z","title_canon_sha256":"3fa63fe10531123e5abde1f2ec7efd62acfcced5c2e513f599ea03be855490a8"},"schema_version":"1.0","source":{"id":"1304.0378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0378","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0378v2","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0378","created_at":"2026-05-18T03:28:28Z"},{"alias_kind":"pith_short_12","alias_value":"IFVQCHLDFVB5","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IFVQCHLDFVB5A33D","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IFVQCHLD","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:00f57359f0de4c438c8b802c6afd4a38172bfe5ae9c6ed68b740d900c7f76c19","target":"graph","created_at":"2026-05-18T03:28:28Z","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":"We present the first data structures that maintain near optimal maximum cardinality and maximum weighted matchings on sparse graphs in sublinear time per update. Our main result is a data structure that maintains a $(1+\\epsilon)$ approximation of maximum matching under edge insertions/deletions in worst case $O(\\sqrt{m}\\epsilon^{-2})$ time per update. This improves the 3/2 approximation given in [Neiman,Solomon,STOC 2013] which runs in similar time. The result is based on two ideas. The first is to re-run a static algorithm after a chosen number of updates to ensure approximation guarantees. T","authors_text":"Manoj Gupta, Richard Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T15:29:21Z","title":"Fully Dynamic $(1+\\epsilon)$-Approximate Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0378","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:fa6e85725c9d67bbf8af20c356781a8749740732a003146563b1856b55a232dd","target":"record","created_at":"2026-05-18T03:28:28Z","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":"cf534e3b34a472afb0f6ca48a35d68ac2b594bace7a3c771bf538b0d25578b6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-01T15:29:21Z","title_canon_sha256":"3fa63fe10531123e5abde1f2ec7efd62acfcced5c2e513f599ea03be855490a8"},"schema_version":"1.0","source":{"id":"1304.0378","kind":"arxiv","version":2}},"canonical_sha256":"416b011d632d43d06f6395cbec54ee8a37ddb86b4ecb92527b2cb259c83d28da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"416b011d632d43d06f6395cbec54ee8a37ddb86b4ecb92527b2cb259c83d28da","first_computed_at":"2026-05-18T03:28:28.869400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:28.869400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mn+QqBtgZ0mnC6v49ZC2ABsezaQAyagtYkeR+ZS6ulKQ4IHBNxF2puMHTnHSbM6qL1u4Hmgiw7bMOepBzDfAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:28.870245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa6e85725c9d67bbf8af20c356781a8749740732a003146563b1856b55a232dd","sha256:00f57359f0de4c438c8b802c6afd4a38172bfe5ae9c6ed68b740d900c7f76c19"],"state_sha256":"3f563eaafa4fbfb006adda5a9f427dce4c54e6ea5713de2b1ae126da2a555415"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ro3lhL0suu/+iGyWOO7uHq6rGov9a/hYxpv85lfFNhGNTpuBuyjAF8UQmwd9PRkkvffkwsWDvyYSdqBaw1xvAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:59:53.989281Z","bundle_sha256":"162e58d2482fad95f1b906c6be41629658712c1d4bd0e0ddc19b02ffc7b6ff01"}}