{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CXSNL3XZFFAZL2LOPQCTC4TVPM","short_pith_number":"pith:CXSNL3XZ","schema_version":"1.0","canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","source":{"kind":"arxiv","id":"2404.06069","version":4},"attestation_state":"computed","paper":{"title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\\'edi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alma Ghafari, Soheil Behnezhad","submitted_at":"2024-04-09T07:15:53Z","abstract_excerpt":"We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions. Our focus is on algorithms that maintain the edges of a $(1-\\epsilon)$-approximate maximum matching for an arbitrarily small constant $\\epsilon > 0$. Until recently, the fastest known algorithm for this problem required $\\Theta(n)$ time per update where $n$ is the number of vertices. This bound was slightly improved to $n/(\\log^* n)^{\\Omega(1)}$ by Assadi, Behnezhad, Khanna, and Li [STOC'23] and ve"},"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":"2404.06069","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-04-09T07:15:53Z","cross_cats_sorted":[],"title_canon_sha256":"d70fcb08a07824413f63762093ee70e16ba9e0281f0aa0a8be006df20eed4d84","abstract_canon_sha256":"3d63c9f46b6e7fe1392e4cf5ca822835f872dec3b478393f692c2d3acb3d5a80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:11:25.521800Z","signature_b64":"FYUfv5yNlIg8bbQWA7t13pkB+1XMfuBZ9OI84iU6sEaYb9e2RNy+OV15BnnIOXTYwohRNbL7PuHWBStlkSLqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e4d5eef9294195e96e7c053172757b25c0c52d6026c92614967da7dc40a43e","last_reissued_at":"2026-07-05T09:11:25.521356Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:11:25.521356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully Dynamic Matching and Ordered Ruzsa-Szemer\\'edi Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alma Ghafari, Soheil Behnezhad","submitted_at":"2024-04-09T07:15:53Z","abstract_excerpt":"We study the fully dynamic maximum matching problem. In this problem, the goal is to efficiently maintain an approximate maximum matching of a graph that is subject to edge insertions and deletions. Our focus is on algorithms that maintain the edges of a $(1-\\epsilon)$-approximate maximum matching for an arbitrarily small constant $\\epsilon > 0$. Until recently, the fastest known algorithm for this problem required $\\Theta(n)$ time per update where $n$ is the number of vertices. This bound was slightly improved to $n/(\\log^* n)^{\\Omega(1)}$ by Assadi, Behnezhad, Khanna, and Li [STOC'23] and ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06069","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2404.06069/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2404.06069","created_at":"2026-07-05T09:11:25.521420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.06069v4","created_at":"2026-07-05T09:11:25.521420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06069","created_at":"2026-07-05T09:11:25.521420+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXSNL3XZFFAZ","created_at":"2026-07-05T09:11:25.521420+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXSNL3XZFFAZL2LO","created_at":"2026-07-05T09:11:25.521420+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXSNL3XZ","created_at":"2026-07-05T09:11:25.521420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14296","citing_title":"Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM","json":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM.json","graph_json":"https://pith.science/api/pith-number/CXSNL3XZFFAZL2LOPQCTC4TVPM/graph.json","events_json":"https://pith.science/api/pith-number/CXSNL3XZFFAZL2LOPQCTC4TVPM/events.json","paper":"https://pith.science/paper/CXSNL3XZ"},"agent_actions":{"view_html":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM","download_json":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM.json","view_paper":"https://pith.science/paper/CXSNL3XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.06069&json=true","fetch_graph":"https://pith.science/api/pith-number/CXSNL3XZFFAZL2LOPQCTC4TVPM/graph.json","fetch_events":"https://pith.science/api/pith-number/CXSNL3XZFFAZL2LOPQCTC4TVPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/action/storage_attestation","attest_author":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/action/author_attestation","sign_citation":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/action/citation_signature","submit_replication":"https://pith.science/pith/CXSNL3XZFFAZL2LOPQCTC4TVPM/action/replication_record"}},"created_at":"2026-07-05T09:11:25.521420+00:00","updated_at":"2026-07-05T09:11:25.521420+00:00"}