{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6JM5OYXN4RXVOWKUVGKHEEX5FG","short_pith_number":"pith:6JM5OYXN","canonical_record":{"source":{"id":"1311.2106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"168e63ffd887ce1a67f06c66a8057c51fbdd01dcd829adfbbcb8e8d996a45009","abstract_canon_sha256":"d8fa32bdcabdeed787a1197dddbdf87b43f43911853dc19390212cd03a0498fe"},"schema_version":"1.0"},"canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","source":{"kind":"arxiv","id":"1311.2106","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2106","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2106v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2106","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"6JM5OYXN4RXV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JM5OYXN4RXVOWKU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JM5OYXN","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6JM5OYXN4RXVOWKUVGKHEEX5FG","target":"record","payload":{"canonical_record":{"source":{"id":"1311.2106","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","cross_cats_sorted":["cs.AI","cs.DM"],"title_canon_sha256":"168e63ffd887ce1a67f06c66a8057c51fbdd01dcd829adfbbcb8e8d996a45009","abstract_canon_sha256":"d8fa32bdcabdeed787a1197dddbdf87b43f43911853dc19390212cd03a0498fe"},"schema_version":"1.0"},"canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:33.523245Z","signature_b64":"hSMV4ATdxXl4iK2OziT4dFuukY+ebHUEYZCUp3xebeiGKhHtka/8daKLyODGjfDVmgdoQ+6obhWBxTf+AjfbAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","last_reissued_at":"2026-05-18T03:07:33.522700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:33.522700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.2106","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pBOXcFNUb/fWFpTeS0xnprXzd3ArcGjqFgaWy3pRFTER3uK4aANGvcEeYA0LH7YKh6DvTQbeuA01GGxKvDUVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:27.959770Z"},"content_sha256":"5c0f9b81569efca5e5d423ce7dc878e74970149168884eb85fb87c554344b87b","schema_version":"1.0","event_id":"sha256:5c0f9b81569efca5e5d423ce7dc878e74970149168884eb85fb87c554344b87b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6JM5OYXN4RXVOWKUVGKHEEX5FG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DM"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Rishabh Iyer","submitted_at":"2013-11-08T23:28:02Z","abstract_excerpt":"We investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require maximizing a certain submodular function (like coverage or diversity) while simultaneously minimizing another (like cooperative cost). These problems are often posed as minimizing the difference between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2106","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-18T03:07:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5It3eIQmQ77c1dlNBMXLMxxdBi8NRnlYTZZ9hTFCqMgwRStWdE2Ixe7HriAsq5EVbCPC4wkWRxvdjSVVqRqaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:13:27.960193Z"},"content_sha256":"3074121ab53f7d4560c5a39644f8e48d11e99f57cd621612c713f9b67a2c65ea","schema_version":"1.0","event_id":"sha256:3074121ab53f7d4560c5a39644f8e48d11e99f57cd621612c713f9b67a2c65ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/bundle.json","state_url":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/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-29T15:13:27Z","links":{"resolver":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG","bundle":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/bundle.json","state":"https://pith.science/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JM5OYXN4RXVOWKUVGKHEEX5FG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6JM5OYXN4RXVOWKUVGKHEEX5FG","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":"d8fa32bdcabdeed787a1197dddbdf87b43f43911853dc19390212cd03a0498fe","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","title_canon_sha256":"168e63ffd887ce1a67f06c66a8057c51fbdd01dcd829adfbbcb8e8d996a45009"},"schema_version":"1.0","source":{"id":"1311.2106","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.2106","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"arxiv_version","alias_value":"1311.2106v1","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2106","created_at":"2026-05-18T03:07:33Z"},{"alias_kind":"pith_short_12","alias_value":"6JM5OYXN4RXV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6JM5OYXN4RXVOWKU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6JM5OYXN","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:3074121ab53f7d4560c5a39644f8e48d11e99f57cd621612c713f9b67a2c65ea","target":"graph","created_at":"2026-05-18T03:07:33Z","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 investigate two new optimization problems -- minimizing a submodular function subject to a submodular lower bound constraint (submodular cover) and maximizing a submodular function subject to a submodular upper bound constraint (submodular knapsack). We are motivated by a number of real-world applications in machine learning including sensor placement and data subset selection, which require maximizing a certain submodular function (like coverage or diversity) while simultaneously minimizing another (like cooperative cost). These problems are often posed as minimizing the difference between","authors_text":"Jeff Bilmes, Rishabh Iyer","cross_cats":["cs.AI","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","title":"Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2106","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:5c0f9b81569efca5e5d423ce7dc878e74970149168884eb85fb87c554344b87b","target":"record","created_at":"2026-05-18T03:07:33Z","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":"d8fa32bdcabdeed787a1197dddbdf87b43f43911853dc19390212cd03a0498fe","cross_cats_sorted":["cs.AI","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-08T23:28:02Z","title_canon_sha256":"168e63ffd887ce1a67f06c66a8057c51fbdd01dcd829adfbbcb8e8d996a45009"},"schema_version":"1.0","source":{"id":"1311.2106","kind":"arxiv","version":1}},"canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f259d762ede46f575954a9947212fd299a17905a2ce42ae3a7de44c7f35f84fc","first_computed_at":"2026-05-18T03:07:33.522700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:07:33.522700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hSMV4ATdxXl4iK2OziT4dFuukY+ebHUEYZCUp3xebeiGKhHtka/8daKLyODGjfDVmgdoQ+6obhWBxTf+AjfbAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:07:33.523245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.2106","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c0f9b81569efca5e5d423ce7dc878e74970149168884eb85fb87c554344b87b","sha256:3074121ab53f7d4560c5a39644f8e48d11e99f57cd621612c713f9b67a2c65ea"],"state_sha256":"8d477eb8a9c6fc48e2f62a6b0cf120724c2a6338edab367f56171bda07955584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHaJxJhA+2jECgggDw04tbCoeq6D33a7r2orsX+NWcQa2l1jC7ar4WMNivYMsWnNi0f+uGiBAULQBjfWr2cKDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:13:27.964202Z","bundle_sha256":"314cee213649ac4bef45d1978262d521fd98541929118e93e59f81bab3b9ad95"}}