{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XUDEP54AYFTLTK5IARQ3A3DJLN","short_pith_number":"pith:XUDEP54A","schema_version":"1.0","canonical_sha256":"bd0647f780c166b9aba80461b06c695b6743a51b80c3ce878993ccdd16486ede","source":{"kind":"arxiv","id":"2403.02582","version":1},"attestation_state":"computed","paper":{"title":"On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yang P. Liu","submitted_at":"2024-03-05T01:33:09Z","abstract_excerpt":"We study connections between the problem of fully dynamic $(1-\\epsilon)$-approximate maximum bipartite matching, and the dual $(1+\\epsilon)$-approximate vertex cover problem, with the online matrix-vector ($\\mathsf{OMv}$) conjecture which has recently been used in several fine-grained hardness reductions. We prove that there is an online algorithm that maintains a $(1+\\epsilon)$-approximate vertex cover in amortized $n^{1-c}\\epsilon^{-C}$ time for constants $c, C > 0$ for fully dynamic updates if and only if the $\\mathsf{OMv}$ conjecture is false. Similarly, we prove that there is an online al"},"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":"2403.02582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-03-05T01:33:09Z","cross_cats_sorted":[],"title_canon_sha256":"aa6990706383a0625aa50835c31ddc8f981238b0fd31584bd0eff316eb505f80","abstract_canon_sha256":"693989c2d3a676e3eaa67ac355242007a503b996d722d48b0468183d7c685f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:19.380760Z","signature_b64":"LrBPLAx27j31L1/TjtyUuP63KSy4At+oz1v2KS4DPhsTjyMmlbRP1VozhhO/QWrzU9RePvjL+7apqULFj2KYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd0647f780c166b9aba80461b06c695b6743a51b80c3ce878993ccdd16486ede","last_reissued_at":"2026-07-05T07:52:19.380309Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:19.380309Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Approximate Fully-Dynamic Matching and Online Matrix-Vector Multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yang P. Liu","submitted_at":"2024-03-05T01:33:09Z","abstract_excerpt":"We study connections between the problem of fully dynamic $(1-\\epsilon)$-approximate maximum bipartite matching, and the dual $(1+\\epsilon)$-approximate vertex cover problem, with the online matrix-vector ($\\mathsf{OMv}$) conjecture which has recently been used in several fine-grained hardness reductions. We prove that there is an online algorithm that maintains a $(1+\\epsilon)$-approximate vertex cover in amortized $n^{1-c}\\epsilon^{-C}$ time for constants $c, C > 0$ for fully dynamic updates if and only if the $\\mathsf{OMv}$ conjecture is false. Similarly, we prove that there is an online al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02582","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02582/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":"2403.02582","created_at":"2026-07-05T07:52:19.380375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02582v1","created_at":"2026-07-05T07:52:19.380375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02582","created_at":"2026-07-05T07:52:19.380375+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUDEP54AYFTL","created_at":"2026-07-05T07:52:19.380375+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUDEP54AYFTLTK5I","created_at":"2026-07-05T07:52:19.380375+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUDEP54A","created_at":"2026-07-05T07:52:19.380375+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":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN","json":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN.json","graph_json":"https://pith.science/api/pith-number/XUDEP54AYFTLTK5IARQ3A3DJLN/graph.json","events_json":"https://pith.science/api/pith-number/XUDEP54AYFTLTK5IARQ3A3DJLN/events.json","paper":"https://pith.science/paper/XUDEP54A"},"agent_actions":{"view_html":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN","download_json":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN.json","view_paper":"https://pith.science/paper/XUDEP54A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02582&json=true","fetch_graph":"https://pith.science/api/pith-number/XUDEP54AYFTLTK5IARQ3A3DJLN/graph.json","fetch_events":"https://pith.science/api/pith-number/XUDEP54AYFTLTK5IARQ3A3DJLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN/action/storage_attestation","attest_author":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN/action/author_attestation","sign_citation":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN/action/citation_signature","submit_replication":"https://pith.science/pith/XUDEP54AYFTLTK5IARQ3A3DJLN/action/replication_record"}},"created_at":"2026-07-05T07:52:19.380375+00:00","updated_at":"2026-07-05T07:52:19.380375+00:00"}