{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:B5YZH57HJAM6R47WRYLGAJGDAY","short_pith_number":"pith:B5YZH57H","canonical_record":{"source":{"id":"1711.11316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-30T10:49:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"af22d1aa4fb46091e8060ae3111101f06292b65f5248b19d9e1b1a881db988f2","abstract_canon_sha256":"c4d07489fdd9f0cd1e8886e90da024a0623412ee01b6b68753286b3702ef2840"},"schema_version":"1.0"},"canonical_sha256":"0f7193f7e74819e8f3f68e166024c3062daad1a646cddeb4c9073d2f8d6847dc","source":{"kind":"arxiv","id":"1711.11316","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11316","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11316v1","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11316","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"pith_short_12","alias_value":"B5YZH57HJAM6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5YZH57HJAM6R47W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5YZH57H","created_at":"2026-05-18T12:31:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:B5YZH57HJAM6R47WRYLGAJGDAY","target":"record","payload":{"canonical_record":{"source":{"id":"1711.11316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-30T10:49:38Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"af22d1aa4fb46091e8060ae3111101f06292b65f5248b19d9e1b1a881db988f2","abstract_canon_sha256":"c4d07489fdd9f0cd1e8886e90da024a0623412ee01b6b68753286b3702ef2840"},"schema_version":"1.0"},"canonical_sha256":"0f7193f7e74819e8f3f68e166024c3062daad1a646cddeb4c9073d2f8d6847dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:11.848872Z","signature_b64":"E1qHvHDk3j+vBmyLHIEw1uT6GWj0fLY4JtqP5cLuuuxNOZuz7XO/OxB5OqvicJV5enrJ8iBEpICAePmSYNppCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f7193f7e74819e8f3f68e166024c3062daad1a646cddeb4c9073d2f8d6847dc","last_reissued_at":"2026-05-18T00:29:11.848222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:11.848222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.11316","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-05-18T00:29:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pKcQzJx500lBz6YFPFq0zmW+w/WXeo2n7T7ipgXvyrYzwaepJm59AB0oSCGfioQ4blP7fylQrBMcXruSU0PWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:44.209531Z"},"content_sha256":"7d3bf83ca3008df6744827908bafeae209dbf284f1b5fdeb6738095197178e0d","schema_version":"1.0","event_id":"sha256:7d3bf83ca3008df6744827908bafeae209dbf284f1b5fdeb6738095197178e0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:B5YZH57HJAM6R47WRYLGAJGDAY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Maximization through the Lens of Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Rico Zenklusen, Simon Bruggmann","submitted_at":"2017-11-30T10:49:38Z","abstract_excerpt":"The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In particular, every local optimum of a constrained monotone submodular maximization problem yields a $1/2$-approximation, and we also present an appropriate extension to the non-monotone setting. However, reaching a local optimum quickly is a non-trivial task. Moreover, we describe a fast and very general local search procedure that applies to a wide range of constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11316","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":""},"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-05-18T00:29:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nPRsMZop1p4ZobvNuE3k8StidjNEqy7hi5ixJEkz+Zj17bnshkb3KaST3AHAO2wUPn2zaOKm8Lv+oXqY575ABw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:26:44.210251Z"},"content_sha256":"e34d2360317339935f9a4fb6c86f444563f1d6610b927e6c1b6c6a0d2f873a0c","schema_version":"1.0","event_id":"sha256:e34d2360317339935f9a4fb6c86f444563f1d6610b927e6c1b6c6a0d2f873a0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5YZH57HJAM6R47WRYLGAJGDAY/bundle.json","state_url":"https://pith.science/pith/B5YZH57HJAM6R47WRYLGAJGDAY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5YZH57HJAM6R47WRYLGAJGDAY/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-05-31T00:26:44Z","links":{"resolver":"https://pith.science/pith/B5YZH57HJAM6R47WRYLGAJGDAY","bundle":"https://pith.science/pith/B5YZH57HJAM6R47WRYLGAJGDAY/bundle.json","state":"https://pith.science/pith/B5YZH57HJAM6R47WRYLGAJGDAY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5YZH57HJAM6R47WRYLGAJGDAY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:B5YZH57HJAM6R47WRYLGAJGDAY","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":"c4d07489fdd9f0cd1e8886e90da024a0623412ee01b6b68753286b3702ef2840","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-30T10:49:38Z","title_canon_sha256":"af22d1aa4fb46091e8060ae3111101f06292b65f5248b19d9e1b1a881db988f2"},"schema_version":"1.0","source":{"id":"1711.11316","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.11316","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.11316v1","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.11316","created_at":"2026-05-18T00:29:11Z"},{"alias_kind":"pith_short_12","alias_value":"B5YZH57HJAM6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"B5YZH57HJAM6R47W","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"B5YZH57H","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:e34d2360317339935f9a4fb6c86f444563f1d6610b927e6c1b6c6a0d2f873a0c","target":"graph","created_at":"2026-05-18T00:29:11Z","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"},"paper":{"abstract_excerpt":"The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In particular, every local optimum of a constrained monotone submodular maximization problem yields a $1/2$-approximation, and we also present an appropriate extension to the non-monotone setting. However, reaching a local optimum quickly is a non-trivial task. Moreover, we describe a fast and very general local search procedure that applies to a wide range of constra","authors_text":"Rico Zenklusen, Simon Bruggmann","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-30T10:49:38Z","title":"Submodular Maximization through the Lens of Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.11316","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:7d3bf83ca3008df6744827908bafeae209dbf284f1b5fdeb6738095197178e0d","target":"record","created_at":"2026-05-18T00:29:11Z","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":"c4d07489fdd9f0cd1e8886e90da024a0623412ee01b6b68753286b3702ef2840","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-30T10:49:38Z","title_canon_sha256":"af22d1aa4fb46091e8060ae3111101f06292b65f5248b19d9e1b1a881db988f2"},"schema_version":"1.0","source":{"id":"1711.11316","kind":"arxiv","version":1}},"canonical_sha256":"0f7193f7e74819e8f3f68e166024c3062daad1a646cddeb4c9073d2f8d6847dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f7193f7e74819e8f3f68e166024c3062daad1a646cddeb4c9073d2f8d6847dc","first_computed_at":"2026-05-18T00:29:11.848222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:11.848222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E1qHvHDk3j+vBmyLHIEw1uT6GWj0fLY4JtqP5cLuuuxNOZuz7XO/OxB5OqvicJV5enrJ8iBEpICAePmSYNppCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:11.848872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.11316","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d3bf83ca3008df6744827908bafeae209dbf284f1b5fdeb6738095197178e0d","sha256:e34d2360317339935f9a4fb6c86f444563f1d6610b927e6c1b6c6a0d2f873a0c"],"state_sha256":"d40e26bc150a740f7e943320e5762c46ae222ba42501dd8fc09c43698bf4d719"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JcD5ibVmIIhp5uLXqv+1vTwr7cbtwSMgDx5dSUFRBBx1LIgmzyjHuz1gF32I8swPRU1+r/l1ZUyUZRCdpmzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:26:44.213918Z","bundle_sha256":"d3c46c69862a5f10014427154410aae686bacc257445f0568c409f5785e9963a"}}