{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UHOOZSPLNCSZB5PQ4FDK7WCKZX","short_pith_number":"pith:UHOOZSPL","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"},"canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","source":{"kind":"arxiv","id":"2607.00843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00843","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00843v1","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00843","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"UHOOZSPLNCSZ","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"UHOOZSPLNCSZB5PQ","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"UHOOZSPL","created_at":"2026-07-02T01:18:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UHOOZSPLNCSZB5PQ4FDK7WCKZX","target":"record","payload":{"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"},"canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","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"},"source_kind":"arxiv","source_id":"2607.00843","source_version":1,"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-07-02T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qorYPijQQXpdlUz7JLbhMXjH4akXU6oDpXQbc5rvsiWoktJyHMsfVRxA/xK3RsjqUM2TEn0T2qTNVUOrC+mFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T01:08:53.653182Z"},"content_sha256":"bd0c9b673e2f2014d6914648150e7f6ff214d87a8e31a5553aadb7230a548c9e","schema_version":"1.0","event_id":"sha256:bd0c9b673e2f2014d6914648150e7f6ff214d87a8e31a5553aadb7230a548c9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UHOOZSPLNCSZB5PQ4FDK7WCKZX","target":"graph","payload":{"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"},"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-07-02T01:18:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mJLR2GAq7/KmQyRmGP5ezmlHwQShdI7Mtk8xksVNDYkgHoGQyQSSOrFThWkZPJZU4h7MNpbq+4hdgxOmK43CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T01:08:53.653578Z"},"content_sha256":"53bc0eff4b511c6609844866b37890854ceacead7c34bd5c762575b3e2112faf","schema_version":"1.0","event_id":"sha256:53bc0eff4b511c6609844866b37890854ceacead7c34bd5c762575b3e2112faf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/bundle.json","state_url":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/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-07-03T01:08:53Z","links":{"resolver":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX","bundle":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/bundle.json","state":"https://pith.science/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHOOZSPLNCSZB5PQ4FDK7WCKZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UHOOZSPLNCSZB5PQ4FDK7WCKZX","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":"7ad060018487d46312d836c009412f7d50372b510f3c44d0710244a89fb1f8c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:09:41Z","title_canon_sha256":"d9005f66546bf4a2bb5679e934c5ab82d62ec17baa096bcd889b08e58d394cbb"},"schema_version":"1.0","source":{"id":"2607.00843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.00843","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"arxiv_version","alias_value":"2607.00843v1","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00843","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_12","alias_value":"UHOOZSPLNCSZ","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_16","alias_value":"UHOOZSPLNCSZB5PQ","created_at":"2026-07-02T01:18:21Z"},{"alias_kind":"pith_short_8","alias_value":"UHOOZSPL","created_at":"2026-07-02T01:18:21Z"}],"graph_snapshots":[{"event_id":"sha256:53bc0eff4b511c6609844866b37890854ceacead7c34bd5c762575b3e2112faf","target":"graph","created_at":"2026-07-02T01:18:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.00843/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Neta Singer, Theophile Thiery","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:09:41Z","title":"Submodular Maximization over Many Matroids via Ordered Local Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00843","kind":"arxiv","version":1},"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:bd0c9b673e2f2014d6914648150e7f6ff214d87a8e31a5553aadb7230a548c9e","target":"record","created_at":"2026-07-02T01:18:21Z","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":"7ad060018487d46312d836c009412f7d50372b510f3c44d0710244a89fb1f8c8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-01T12:09:41Z","title_canon_sha256":"d9005f66546bf4a2bb5679e934c5ab82d62ec17baa096bcd889b08e58d394cbb"},"schema_version":"1.0","source":{"id":"2607.00843","kind":"arxiv","version":1}},"canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1dcecc9eb68a590f5f0e146afd84acddd778f1bb948295f24a236f227b89180","first_computed_at":"2026-07-02T01:18:21.282737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-02T01:18:21.282737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Km5knHWNOlvsDh2cjr+k24RiniQPgKEq025Vvo2K9CK0LwWVQ2WdwDCYWljsqOR7zo0Uxx3j5WicgCQDrdsRCA==","signature_status":"signed_v1","signed_at":"2026-07-02T01:18:21.283093Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.00843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd0c9b673e2f2014d6914648150e7f6ff214d87a8e31a5553aadb7230a548c9e","sha256:53bc0eff4b511c6609844866b37890854ceacead7c34bd5c762575b3e2112faf"],"state_sha256":"c8d085cc7d4e4b965a1ef1510c5ab9c6a8ad9e83ff946cd9907788ff772e081c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HxLUfaVM0lsnmtKz5PiUYajxsIP/bsXwqMxPh+2/4MAKQbpDpM6WoU2E7MirvM+p5h2ONjGh7bhZQxmOme5zDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T01:08:53.655593Z","bundle_sha256":"7b84ae3e119f1b93c262aa0f9998ef5b022f62160b514be0f8dca524302a5ee4"}}