{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HHK4F4KNFGMAVEVNVPPRP7GMSO","short_pith_number":"pith:HHK4F4KN","schema_version":"1.0","canonical_sha256":"39d5c2f14d29980a92adabdf17fccc93ae75fc483e6800920a23ccc3d2a6ed53","source":{"kind":"arxiv","id":"1711.06625","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.06625","created_at":"2026-05-18T00:22:18.497497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06625v2","created_at":"2026-05-18T00:22:18.497497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06625","created_at":"2026-05-18T00:22:18.497497+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHK4F4KNFGMA","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHK4F4KNFGMAVEVN","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHK4F4KN","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14296","citing_title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","ref_index":214,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO","json":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO.json","graph_json":"https://pith.science/api/pith-number/HHK4F4KNFGMAVEVNVPPRP7GMSO/graph.json","events_json":"https://pith.science/api/pith-number/HHK4F4KNFGMAVEVNVPPRP7GMSO/events.json","paper":"https://pith.science/paper/HHK4F4KN"},"agent_actions":{"view_html":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO","download_json":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO.json","view_paper":"https://pith.science/paper/HHK4F4KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06625&json=true","fetch_graph":"https://pith.science/api/pith-number/HHK4F4KNFGMAVEVNVPPRP7GMSO/graph.json","fetch_events":"https://pith.science/api/pith-number/HHK4F4KNFGMAVEVNVPPRP7GMSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/action/storage_attestation","attest_author":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/action/author_attestation","sign_citation":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/action/citation_signature","submit_replication":"https://pith.science/pith/HHK4F4KNFGMAVEVNVPPRP7GMSO/action/replication_record"}},"created_at":"2026-05-18T00:22:18.497497+00:00","updated_at":"2026-05-18T00:22:18.497497+00:00"}