{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NEP7U6W5HGT4BYMRAGXTC44D5X","short_pith_number":"pith:NEP7U6W5","canonical_record":{"source":{"id":"1801.07413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"c66e16656cf62921244280c5fa6283cfe9299091163fc2dce21b5c0d9e99fabb","abstract_canon_sha256":"552c3b31bd276fe1709149c5881025ae427f24288a2b003dd49394d22729de3b"},"schema_version":"1.0"},"canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","source":{"kind":"arxiv","id":"1801.07413","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07413","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07413v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07413","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"NEP7U6W5HGT4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NEP7U6W5HGT4BYMR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NEP7U6W5","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NEP7U6W5HGT4BYMRAGXTC44D5X","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07413","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","cross_cats_sorted":[],"title_canon_sha256":"c66e16656cf62921244280c5fa6283cfe9299091163fc2dce21b5c0d9e99fabb","abstract_canon_sha256":"552c3b31bd276fe1709149c5881025ae427f24288a2b003dd49394d22729de3b"},"schema_version":"1.0"},"canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:12.888741Z","signature_b64":"OyM/CwxRlYu/gwwnb4xtVD23SPfELpmH/laGh4clR1Sm3906I5gWYEPyUTeXHe2cLFiWgazNwVUk8gzPefNXBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","last_reissued_at":"2026-05-18T00:25:12.888063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:12.888063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07413","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BojV9OTmjzMpmiqp7TTrFM7f7ZoHqFVIAQiB6QxL3TOmDBgPfLXMwDNlAK0fBKqQejeOoEy4QLbjtZnRHkcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:10:06.979016Z"},"content_sha256":"a5ad7a69b595d3db3528f0181ff46817aab17452097370132f50a7e022a1bc65","schema_version":"1.0","event_id":"sha256:a5ad7a69b595d3db3528f0181ff46817aab17452097370132f50a7e022a1bc65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NEP7U6W5HGT4BYMRAGXTC44D5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Jeffrey A. Bilmes, Wenruo Bai","submitted_at":"2018-01-23T07:15:15Z","abstract_excerpt":"We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or $p\\geq 1$ matroid independence constraints. These problems occur naturally in several real-world applications in data science, machine learning, and artificial intelligence. The problems are ordinarily inapproximable to any factor (as we show). Using the curvature $\\kappa_f$ of the submodular term, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07413","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:25:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HSn7VYCeJ3/kvXxHe4CykAOtNgTlVE/bP8cnvo6OlkcktNXrC9goNTAxA0ABK7hOAMy7noIiRtb+PHh0hWcjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T04:10:06.979388Z"},"content_sha256":"b564feee9d1407f1372b06a899da831372ac8402f435d7a106f815112e5c3644","schema_version":"1.0","event_id":"sha256:b564feee9d1407f1372b06a899da831372ac8402f435d7a106f815112e5c3644"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/bundle.json","state_url":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/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-24T04:10:06Z","links":{"resolver":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X","bundle":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/bundle.json","state":"https://pith.science/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEP7U6W5HGT4BYMRAGXTC44D5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NEP7U6W5HGT4BYMRAGXTC44D5X","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":"552c3b31bd276fe1709149c5881025ae427f24288a2b003dd49394d22729de3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","title_canon_sha256":"c66e16656cf62921244280c5fa6283cfe9299091163fc2dce21b5c0d9e99fabb"},"schema_version":"1.0","source":{"id":"1801.07413","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07413","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07413v1","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07413","created_at":"2026-05-18T00:25:12Z"},{"alias_kind":"pith_short_12","alias_value":"NEP7U6W5HGT4","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NEP7U6W5HGT4BYMR","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NEP7U6W5","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:b564feee9d1407f1372b06a899da831372ac8402f435d7a106f815112e5c3644","target":"graph","created_at":"2026-05-18T00:25:12Z","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 analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or $p\\geq 1$ matroid independence constraints. These problems occur naturally in several real-world applications in data science, machine learning, and artificial intelligence. The problems are ordinarily inapproximable to any factor (as we show). Using the curvature $\\kappa_f$ of the submodular term, and","authors_text":"Jeffrey A. Bilmes, Wenruo Bai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","title":"Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07413","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:a5ad7a69b595d3db3528f0181ff46817aab17452097370132f50a7e022a1bc65","target":"record","created_at":"2026-05-18T00:25:12Z","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":"552c3b31bd276fe1709149c5881025ae427f24288a2b003dd49394d22729de3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-23T07:15:15Z","title_canon_sha256":"c66e16656cf62921244280c5fa6283cfe9299091163fc2dce21b5c0d9e99fabb"},"schema_version":"1.0","source":{"id":"1801.07413","kind":"arxiv","version":1}},"canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"691ffa7add39a7c0e19101af317383edc6b7225d26062804382389d17d27ce98","first_computed_at":"2026-05-18T00:25:12.888063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:12.888063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OyM/CwxRlYu/gwwnb4xtVD23SPfELpmH/laGh4clR1Sm3906I5gWYEPyUTeXHe2cLFiWgazNwVUk8gzPefNXBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:12.888741Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07413","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5ad7a69b595d3db3528f0181ff46817aab17452097370132f50a7e022a1bc65","sha256:b564feee9d1407f1372b06a899da831372ac8402f435d7a106f815112e5c3644"],"state_sha256":"21ed0b5cc5549223b5795495f753dce5b0e809095993aa888bb8d8736ea0f4d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GVblBdjKmrvURbG12D2l1DXAvzE0bECIzaVcQg1KFU3wxwxgSV1d297t5dG3YqClJC18vugnogpXn8lAoudxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T04:10:06.982073Z","bundle_sha256":"e41de155eba73a93938f5743fc81326f023661756529693d4388555d14959891"}}