{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:VLKZBQ35T7RPMUIPQKSGBYQMMW","short_pith_number":"pith:VLKZBQ35","canonical_record":{"source":{"id":"2306.00959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T17:54:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fc987a3e1fca0e2bdb25d3b3e41bb4af9607b5bdeb9e4964f5d2dcdef52d28f","abstract_canon_sha256":"177ba8ad7839203d86e13f2720a6c12a171ae74e7df094f1262e2554f68ec712"},"schema_version":"1.0"},"canonical_sha256":"aad590c37d9fe2f6510f82a460e20c6592e2a6545a739d077885d9ec127cbb48","source":{"kind":"arxiv","id":"2306.00959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.00959","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"2306.00959v2","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00959","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"VLKZBQ35T7RP","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"VLKZBQ35T7RPMUIP","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"VLKZBQ35","created_at":"2026-07-05T07:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:VLKZBQ35T7RPMUIPQKSGBYQMMW","target":"record","payload":{"canonical_record":{"source":{"id":"2306.00959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T17:54:15Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9fc987a3e1fca0e2bdb25d3b3e41bb4af9607b5bdeb9e4964f5d2dcdef52d28f","abstract_canon_sha256":"177ba8ad7839203d86e13f2720a6c12a171ae74e7df094f1262e2554f68ec712"},"schema_version":"1.0"},"canonical_sha256":"aad590c37d9fe2f6510f82a460e20c6592e2a6545a739d077885d9ec127cbb48","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:27:46.747047Z","signature_b64":"U5u8a5bwxLXvpuH7G4yMOHZeDxrcWTq9hNfPhgAyi56kL1y0/XTuY1hW4NW7Q6+OS8N58Ehal+j68QhDWjJ6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aad590c37d9fe2f6510f82a460e20c6592e2a6545a739d077885d9ec127cbb48","last_reissued_at":"2026-07-05T07:27:46.746444Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:27:46.746444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.00959","source_version":2,"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-05T07:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qkj/O2GoVAFOvVqzZ9W01PX4K5tOh/wjgLDymy0n3PjYHo/YpCx5cGqVM5+VOwLZzmkQBlcsPj5u5VSNJAYbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T22:49:09.273363Z"},"content_sha256":"893c69432c27d6f75ad6f15767178c8a2274919cf697338ba628485a12aaff64","schema_version":"1.0","event_id":"sha256:893c69432c27d6f75ad6f15767178c8a2274919cf697338ba628485a12aaff64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:VLKZBQ35T7RPMUIPQKSGBYQMMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Algorithms for Matroid Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Kiarash Banihashem, Leyla Biabani, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Peyman Jabbarzade, Samira Goudarzi","submitted_at":"2023-06-01T17:54:15Z","abstract_excerpt":"Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial optimization. In this paper, we consider these problems in the dynamic setting, where (1) we have oracle access to a monotone submodular function $f: 2^{V} \\rightarrow \\mathbb{R}^+$ and (2) we are given a sequence $\\mathcal{S}$ of insertions and deletions of elements of an underlying ground set $V$.\n  We develop the first fully dynamic $(4+\\epsilon)$-approximation algorithm for the submodular maximization problem under"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00959","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.00959/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-05T07:27:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+BU1nTQpam7gti+AhHeZMWBDOuhR3sw/3L0bxLr3/bQDoV1TDMmQE/wVww3R+Yx9K1LqWafE+ukq7YWx7XZbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-26T22:49:09.273749Z"},"content_sha256":"ddfe7e2fc42d702f96e29b0afaee51539a6c5677c3012c3012ba68728d5022e6","schema_version":"1.0","event_id":"sha256:ddfe7e2fc42d702f96e29b0afaee51539a6c5677c3012c3012ba68728d5022e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/bundle.json","state_url":"https://pith.science/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/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-26T22:49:09Z","links":{"resolver":"https://pith.science/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW","bundle":"https://pith.science/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/bundle.json","state":"https://pith.science/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VLKZBQ35T7RPMUIPQKSGBYQMMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:VLKZBQ35T7RPMUIPQKSGBYQMMW","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":"177ba8ad7839203d86e13f2720a6c12a171ae74e7df094f1262e2554f68ec712","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T17:54:15Z","title_canon_sha256":"9fc987a3e1fca0e2bdb25d3b3e41bb4af9607b5bdeb9e4964f5d2dcdef52d28f"},"schema_version":"1.0","source":{"id":"2306.00959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.00959","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"arxiv_version","alias_value":"2306.00959v2","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.00959","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_12","alias_value":"VLKZBQ35T7RP","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"VLKZBQ35T7RPMUIP","created_at":"2026-07-05T07:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"VLKZBQ35","created_at":"2026-07-05T07:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ddfe7e2fc42d702f96e29b0afaee51539a6c5677c3012c3012ba68728d5022e6","target":"graph","created_at":"2026-07-05T07:27:46Z","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/2306.00959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial optimization. In this paper, we consider these problems in the dynamic setting, where (1) we have oracle access to a monotone submodular function $f: 2^{V} \\rightarrow \\mathbb{R}^+$ and (2) we are given a sequence $\\mathcal{S}$ of insertions and deletions of elements of an underlying ground set $V$.\n  We develop the first fully dynamic $(4+\\epsilon)$-approximation algorithm for the submodular maximization problem under","authors_text":"Kiarash Banihashem, Leyla Biabani, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Peyman Jabbarzade, Samira Goudarzi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T17:54:15Z","title":"Dynamic Algorithms for Matroid Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.00959","kind":"arxiv","version":2},"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:893c69432c27d6f75ad6f15767178c8a2274919cf697338ba628485a12aaff64","target":"record","created_at":"2026-07-05T07:27:46Z","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":"177ba8ad7839203d86e13f2720a6c12a171ae74e7df094f1262e2554f68ec712","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-06-01T17:54:15Z","title_canon_sha256":"9fc987a3e1fca0e2bdb25d3b3e41bb4af9607b5bdeb9e4964f5d2dcdef52d28f"},"schema_version":"1.0","source":{"id":"2306.00959","kind":"arxiv","version":2}},"canonical_sha256":"aad590c37d9fe2f6510f82a460e20c6592e2a6545a739d077885d9ec127cbb48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aad590c37d9fe2f6510f82a460e20c6592e2a6545a739d077885d9ec127cbb48","first_computed_at":"2026-07-05T07:27:46.746444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:27:46.746444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U5u8a5bwxLXvpuH7G4yMOHZeDxrcWTq9hNfPhgAyi56kL1y0/XTuY1hW4NW7Q6+OS8N58Ehal+j68QhDWjJ6Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:27:46.747047Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.00959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:893c69432c27d6f75ad6f15767178c8a2274919cf697338ba628485a12aaff64","sha256:ddfe7e2fc42d702f96e29b0afaee51539a6c5677c3012c3012ba68728d5022e6"],"state_sha256":"d837329742bce2821389bf71179e15e3261201886114bd5fcd4962368102002a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGxASAHY8easl4VMdfb90BTlh2I3vn6KwO0nQ4oOLM6GzV+A7y8GkIvoQHu4w9Wl6saJ6FTpnO2ZuYPmpVgrDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-26T22:49:09.276308Z","bundle_sha256":"4ba39bbe85972cb3bba220d486df0d290f59c7ca6c65dadb47aa8c23551fbd44"}}