{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:U26F7MZS3VDQZ36XVQOS6VIPO4","short_pith_number":"pith:U26F7MZS","canonical_record":{"source":{"id":"1108.4983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-25T01:28:59Z","cross_cats_sorted":[],"title_canon_sha256":"437512d714b3d62b00147a4eae4a6343bd33151d586b1f62b403666081c15405","abstract_canon_sha256":"397fb4d3b32449090cf38ea9e786e4c23d2fd1413be3a9403f1d204200c67b7f"},"schema_version":"1.0"},"canonical_sha256":"a6bc5fb332dd470cefd7ac1d2f550f771b1eca88f8c15c3027aa9aba5618342f","source":{"kind":"arxiv","id":"1108.4983","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4983","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4983v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4983","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"U26F7MZS3VDQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U26F7MZS3VDQZ36X","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U26F7MZS","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:U26F7MZS3VDQZ36XVQOS6VIPO4","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4983","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-25T01:28:59Z","cross_cats_sorted":[],"title_canon_sha256":"437512d714b3d62b00147a4eae4a6343bd33151d586b1f62b403666081c15405","abstract_canon_sha256":"397fb4d3b32449090cf38ea9e786e4c23d2fd1413be3a9403f1d204200c67b7f"},"schema_version":"1.0"},"canonical_sha256":"a6bc5fb332dd470cefd7ac1d2f550f771b1eca88f8c15c3027aa9aba5618342f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:26.635578Z","signature_b64":"LgM2bJkwkTdLsRRIsYtJZ41j2MvIM1ImCGCVlGVPHPHEY41ElAW4Pq3Qry3p5BA3F9UG/mE/nMlO6+kyR15SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6bc5fb332dd470cefd7ac1d2f550f771b1eca88f8c15c3027aa9aba5618342f","last_reissued_at":"2026-05-18T04:00:26.634933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:26.634933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4983","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-05-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/KNQvlM3AlkYZrl25ItO98lr9Gb42sV2oa56V9VqwIi3R/oD/hmaY20MoJbN0ubTKhTNgDn+SO3XgtlKR9oEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:34:57.259021Z"},"content_sha256":"46f084c1abb0688644a4f96b46d6bd9976c187a3ee2f8e765865752d99887d7c","schema_version":"1.0","event_id":"sha256:46f084c1abb0688644a4f96b46d6bd9976c187a3ee2f8e765865752d99887d7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:U26F7MZS3VDQZ36XVQOS6VIPO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward","submitted_at":"2011-08-25T01:28:59Z","abstract_excerpt":"We consider the problem of maximizing a monotone submodular function in a $k$-exchange system. These systems, introduced by Feldman et al., generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. Feldman et al. show that a simple non-oblivious local search algorithm attains a $(k + 1)/2$ approximation ratio for the problem of linear maximization in a $k$-exchange system. Here, we extend this approach to the case of monotone submodular objective functions. We give a deterministic, non-oblivious local search algorithm that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4983","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":""},"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-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jApttKhuhoKztMDmfKHd9C1MIxR8MbEgL9+gYcmcvnm8F81sdlcNNWD+vCS7oIS9/TKAbXrtOzdhADX8rh1UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:34:57.259781Z"},"content_sha256":"2382c06e79f4212a55985dbb624b595571a0b08fc5dec303de213563af5ca66c","schema_version":"1.0","event_id":"sha256:2382c06e79f4212a55985dbb624b595571a0b08fc5dec303de213563af5ca66c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/bundle.json","state_url":"https://pith.science/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/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-06-09T05:34:57Z","links":{"resolver":"https://pith.science/pith/U26F7MZS3VDQZ36XVQOS6VIPO4","bundle":"https://pith.science/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/bundle.json","state":"https://pith.science/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U26F7MZS3VDQZ36XVQOS6VIPO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:U26F7MZS3VDQZ36XVQOS6VIPO4","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":"397fb4d3b32449090cf38ea9e786e4c23d2fd1413be3a9403f1d204200c67b7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-25T01:28:59Z","title_canon_sha256":"437512d714b3d62b00147a4eae4a6343bd33151d586b1f62b403666081c15405"},"schema_version":"1.0","source":{"id":"1108.4983","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4983","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4983v2","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4983","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"U26F7MZS3VDQ","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"U26F7MZS3VDQZ36X","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"U26F7MZS","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:2382c06e79f4212a55985dbb624b595571a0b08fc5dec303de213563af5ca66c","target":"graph","created_at":"2026-05-18T04:00:26Z","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":"We consider the problem of maximizing a monotone submodular function in a $k$-exchange system. These systems, introduced by Feldman et al., generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. Feldman et al. show that a simple non-oblivious local search algorithm attains a $(k + 1)/2$ approximation ratio for the problem of linear maximization in a $k$-exchange system. Here, we extend this approach to the case of monotone submodular objective functions. We give a deterministic, non-oblivious local search algorithm that a","authors_text":"Justin Ward","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-25T01:28:59Z","title":"A $(k + 3)/2$-approximation algorithm for monotone submodular maximization over a $k$-exchange system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4983","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:46f084c1abb0688644a4f96b46d6bd9976c187a3ee2f8e765865752d99887d7c","target":"record","created_at":"2026-05-18T04:00:26Z","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":"397fb4d3b32449090cf38ea9e786e4c23d2fd1413be3a9403f1d204200c67b7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-25T01:28:59Z","title_canon_sha256":"437512d714b3d62b00147a4eae4a6343bd33151d586b1f62b403666081c15405"},"schema_version":"1.0","source":{"id":"1108.4983","kind":"arxiv","version":2}},"canonical_sha256":"a6bc5fb332dd470cefd7ac1d2f550f771b1eca88f8c15c3027aa9aba5618342f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6bc5fb332dd470cefd7ac1d2f550f771b1eca88f8c15c3027aa9aba5618342f","first_computed_at":"2026-05-18T04:00:26.634933Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:26.634933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LgM2bJkwkTdLsRRIsYtJZ41j2MvIM1ImCGCVlGVPHPHEY41ElAW4Pq3Qry3p5BA3F9UG/mE/nMlO6+kyR15SAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:26.635578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4983","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46f084c1abb0688644a4f96b46d6bd9976c187a3ee2f8e765865752d99887d7c","sha256:2382c06e79f4212a55985dbb624b595571a0b08fc5dec303de213563af5ca66c"],"state_sha256":"b97985d77e411b7ebc13f84c86e9787e1b47fb82e23b1324ee505ea20fdcb6ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DLLrq7uWARRIhb6yy0ZKetS8TD2QdHIbeXCSAYG9zUPQdbozn8/AZ3NhmazAn/xNSdv5n2yWvshqCEiEpcEsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:34:57.264074Z","bundle_sha256":"9d9edd4de9a4c7c52b4e5f008448d51b54076df1b54693ad42539877ce22600e"}}