{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HHK4F4KNFGMAVEVNVPPRP7GMSO","short_pith_number":"pith:HHK4F4KN","canonical_record":{"source":{"id":"1711.06625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T16:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"780ee8128aba054e32190d67b52a70c6dde8eefd7ec9b017f1217dddebfe23b6","abstract_canon_sha256":"a970027f613c6428bdefda59cdc4cd511debc0457547ffd65121cdad5821935d"},"schema_version":"1.0"},"canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","source":{"kind":"arxiv","id":"1711.06625","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06625","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06625v2","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06625","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"HHK4F4KNFGMA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHK4F4KNFGMAVEVN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHK4F4KN","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HHK4F4KNFGMAVEVNVPPRP7GMSO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06625","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T16:58:48Z","cross_cats_sorted":[],"title_canon_sha256":"780ee8128aba054e32190d67b52a70c6dde8eefd7ec9b017f1217dddebfe23b6","abstract_canon_sha256":"a970027f613c6428bdefda59cdc4cd511debc0457547ffd65121cdad5821935d"},"schema_version":"1.0"},"canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:18.498024Z","signature_b64":"RVByqb5ZkBBT3bnkwBiuWSRw9JxP70berp59n3HfKMmYKPh/yIIhqEx2y612qpaUrbyYDSq1VJfGvCwv1pc5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","last_reissued_at":"2026-05-18T00:22:18.497400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:18.497400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06625","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-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEv9Gbu66qG8sT0reSnZK+2Sn/PI+KOlDRlRGHxEYth6Bv0HJR8oK9fX750f1p9oBTL9FK2UjYE6aXTJ6OTmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:31:36.661263Z"},"content_sha256":"9797d8cd9ab88ff0f9f1b2c2efbdf5a32f72c116a3ecc0cec1e05002331ab5e5","schema_version":"1.0","event_id":"sha256:9797d8cd9ab88ff0f9f1b2c2efbdf5a32f72c116a3ecc0cec1e05002331ab5e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HHK4F4KNFGMAVEVNVPPRP7GMSO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cliff Stein, David Wajc, Moab Arar, Sarel Cohen, Shiri Chechik","submitted_at":"2017-11-17T16:58:48Z","abstract_excerpt":"We present a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic \"approximately-maximal\" fractional matching algorithms. Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem. Specifically, our main result is a randomized fully-dynamic $(2+\\epsilon)$-approximate integral matching algorithm with small polylog worst-case update time. For the $(2+\\epsilon)$-approximation regime only a \\emph{fractional} fully-dynamic $(2+\\epsilon)$-matching"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06625","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-18T00:22:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUA6I8hAkAJYF2yoIXzrkxrQ5m4Ly1obeBN/tX2XPGZoAIjWYaTAk7ICiNCJ2SomBNTgt4Nd/F+3daI0wgT1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:31:36.661617Z"},"content_sha256":"fe9248e361620785846cfe5527ca48e0b1a6ab2ccc2b5d735003eeeab6126a9b","schema_version":"1.0","event_id":"sha256:fe9248e361620785846cfe5527ca48e0b1a6ab2ccc2b5d735003eeeab6126a9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/bundle.json","state_url":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/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-03T17:31:36Z","links":{"resolver":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO","bundle":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/bundle.json","state":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HHK4F4KNFGMAVEVNVPPRP7GMSO","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":"a970027f613c6428bdefda59cdc4cd511debc0457547ffd65121cdad5821935d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T16:58:48Z","title_canon_sha256":"780ee8128aba054e32190d67b52a70c6dde8eefd7ec9b017f1217dddebfe23b6"},"schema_version":"1.0","source":{"id":"1711.06625","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06625","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06625v2","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06625","created_at":"2026-05-18T00:22:18Z"},{"alias_kind":"pith_short_12","alias_value":"HHK4F4KNFGMA","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HHK4F4KNFGMAVEVN","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HHK4F4KN","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:fe9248e361620785846cfe5527ca48e0b1a6ab2ccc2b5d735003eeeab6126a9b","target":"graph","created_at":"2026-05-18T00:22:18Z","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 a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic \"approximately-maximal\" fractional matching algorithms. Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem. Specifically, our main result is a randomized fully-dynamic $(2+\\epsilon)$-approximate integral matching algorithm with small polylog worst-case update time. For the $(2+\\epsilon)$-approximation regime only a \\emph{fractional} fully-dynamic $(2+\\epsilon)$-matching","authors_text":"Cliff Stein, David Wajc, Moab Arar, Sarel Cohen, Shiri Chechik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T16:58:48Z","title":"Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06625","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:9797d8cd9ab88ff0f9f1b2c2efbdf5a32f72c116a3ecc0cec1e05002331ab5e5","target":"record","created_at":"2026-05-18T00:22:18Z","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":"a970027f613c6428bdefda59cdc4cd511debc0457547ffd65121cdad5821935d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-17T16:58:48Z","title_canon_sha256":"780ee8128aba054e32190d67b52a70c6dde8eefd7ec9b017f1217dddebfe23b6"},"schema_version":"1.0","source":{"id":"1711.06625","kind":"arxiv","version":2}},"canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","first_computed_at":"2026-05-18T00:22:18.497400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:18.497400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVByqb5ZkBBT3bnkwBiuWSRw9JxP70berp59n3HfKMmYKPh/yIIhqEx2y612qpaUrbyYDSq1VJfGvCwv1pc5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:18.498024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06625","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9797d8cd9ab88ff0f9f1b2c2efbdf5a32f72c116a3ecc0cec1e05002331ab5e5","sha256:fe9248e361620785846cfe5527ca48e0b1a6ab2ccc2b5d735003eeeab6126a9b"],"state_sha256":"c660e7b9a9c5a27741ed7d3303e0b114abb52c72bbfe82d33ddb731e3a2b9df1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ksf8TtWkOQiNw31MqhMxPKxOVbvWVHWUj6Tyup2CL4DQy/+BwFeyIVlkjd1Rwx9H0AC2AuXcbJWQ7S9d0KwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:31:36.663597Z","bundle_sha256":"9ee6d277fcb69cce298e330ddc4523b8b96fe01f6272848ab6249a796fdc120f"}}