{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UHOOZSPLNCSZB5PQ4FDK7WCKZX","short_pith_number":"pith:UHOOZSPL","schema_version":"1.0","canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","source":{"kind":"arxiv","id":"2607.00843","version":1},"attestation_state":"computed","paper":{"title":"Submodular Maximization over Many Matroids via Ordered Local Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neta Singer, Theophile Thiery","submitted_at":"2026-07-01T12:09:41Z","abstract_excerpt":"Given a monotone submodular function, we consider the problem of finding a maximum-valued set in the intersection of $k$ matroids. Our main result is a polynomial time local search based algorithm achieving a $\\frac{k}{2} + o(k)$ approximation guarantee. This asymptotically matches the best-known guarantee of $\\frac{k}{2} + \\epsilon$ in the unweighted setting by Lee, Sviridenko, and Vondr\\'ak (2009). Prior to this work, the state-of-the-art was a $\\frac{\\ln(4)k}{1+\\ln(2)} + o(k)$-approximation algorithm obtained by Feldman and Ward (2026). Our approach extends to Matroid $k$-Parity yielding th"},"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":"2607.00843","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:09:41Z","cross_cats_sorted":[],"title_canon_sha256":"d9005f66546bf4a2bb5679e934c5ab82d62ec17baa096bcd889b08e58d394cbb","abstract_canon_sha256":"7ad060018487d46312d836c009412f7d50372b510f3c44d0710244a89fb1f8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T01:18:21.283093Z","signature_b64":"Km5knHWNOlvsDh2cjr+k24RiniQPgKEq025Vvo2K9CK0LwWVQ2WdwDCYWljsqOR7zo0Uxx3j5WicgCQDrdsRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","last_reissued_at":"2026-07-02T01:18:21.282737Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T01:18:21.282737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Maximization over Many Matroids via Ordered Local Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Neta Singer, Theophile Thiery","submitted_at":"2026-07-01T12:09:41Z","abstract_excerpt":"Given a monotone submodular function, we consider the problem of finding a maximum-valued set in the intersection of $k$ matroids. Our main result is a polynomial time local search based algorithm achieving a $\\frac{k}{2} + o(k)$ approximation guarantee. This asymptotically matches the best-known guarantee of $\\frac{k}{2} + \\epsilon$ in the unweighted setting by Lee, Sviridenko, and Vondr\\'ak (2009). Prior to this work, the state-of-the-art was a $\\frac{\\ln(4)k}{1+\\ln(2)} + o(k)$-approximation algorithm obtained by Feldman and Ward (2026). Our approach extends to Matroid $k$-Parity yielding th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00843","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/2607.00843/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":"2607.00843","created_at":"2026-07-02T01:18:21.282796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00843v1","created_at":"2026-07-02T01:18:21.282796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00843","created_at":"2026-07-02T01:18:21.282796+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHOOZSPLNCSZ","created_at":"2026-07-02T01:18:21.282796+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHOOZSPLNCSZB5PQ","created_at":"2026-07-02T01:18:21.282796+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHOOZSPL","created_at":"2026-07-02T01:18:21.282796+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX","json":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX.json","graph_json":"https://pith.science/api/pith-number/UHOOZSPLNCSZB5PQ4FDK7WCKZX/graph.json","events_json":"https://pith.science/api/pith-number/UHOOZSPLNCSZB5PQ4FDK7WCKZX/events.json","paper":"https://pith.science/paper/UHOOZSPL"},"agent_actions":{"view_html":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX","download_json":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX.json","view_paper":"https://pith.science/paper/UHOOZSPL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00843&json=true","fetch_graph":"https://pith.science/api/pith-number/UHOOZSPLNCSZB5PQ4FDK7WCKZX/graph.json","fetch_events":"https://pith.science/api/pith-number/UHOOZSPLNCSZB5PQ4FDK7WCKZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/action/storage_attestation","attest_author":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/action/author_attestation","sign_citation":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/action/citation_signature","submit_replication":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/action/replication_record"}},"created_at":"2026-07-02T01:18:21.282796+00:00","updated_at":"2026-07-02T01:18:21.282796+00:00"}