{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NSK7SKJPBJHZAKURAZOMOZF45Z","short_pith_number":"pith:NSK7SKJP","canonical_record":{"source":{"id":"1902.10172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T19:16:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6785f46334c0fe651d73947f1d68494365ba4eff3d9fd41156cbe4b10a2445a3","abstract_canon_sha256":"812f78f6c728cc9f7d930882c756a2ce09134fc271c4e964a349055995156f7c"},"schema_version":"1.0"},"canonical_sha256":"6c95f9292f0a4f902a91065cc764bcee425475ccbcf680535747bb3ec7257752","source":{"kind":"arxiv","id":"1902.10172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10172","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10172v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10172","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"NSK7SKJPBJHZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NSK7SKJPBJHZAKUR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NSK7SKJP","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NSK7SKJPBJHZAKURAZOMOZF45Z","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T19:16:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6785f46334c0fe651d73947f1d68494365ba4eff3d9fd41156cbe4b10a2445a3","abstract_canon_sha256":"812f78f6c728cc9f7d930882c756a2ce09134fc271c4e964a349055995156f7c"},"schema_version":"1.0"},"canonical_sha256":"6c95f9292f0a4f902a91065cc764bcee425475ccbcf680535747bb3ec7257752","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.573331Z","signature_b64":"sAwqpml5u5zsk5L7lVFsYfwEmTIGa8fqmWtlEpF2KBBi4Sl5Kum5FpOJIIK+Dieo+LlVxroO60JNV3tgIRmdBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c95f9292f0a4f902a91065cc764bcee425475ccbcf680535747bb3ec7257752","last_reissued_at":"2026-05-17T23:52:31.572416Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.572416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10172","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRONW/52yvBrVZ5mXFIWmqz1NrwjleXKVcrRZev9L1MxpdYdJiyzGow/WY7m5IZ9zZH80SkwIGZufNDHTfR5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:46:19.585925Z"},"content_sha256":"4000ba4d4afeb631adf57b977dcfae4a2a936db79d06e1cf0580c4502ee24ffd","schema_version":"1.0","event_id":"sha256:4000ba4d4afeb631adf57b977dcfae4a2a936db79d06e1cf0580c4502ee24ffd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NSK7SKJPBJHZAKURAZOMOZF45Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LG","authors_text":"Jeff Bilmes, Rishabh Iyer","submitted_at":"2019-02-26T19:16:24Z","abstract_excerpt":"In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a submodular function under submodular cover and submodular knapsack constraints, and minimizing a ratio of submodular functions. All these problems appear in several real world problems but have hardness factors of $\\Omega(\\sqrt{n})$ for general submodular cost functions. We show how we can achieve constant approximation factors when we restrict the cost functions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10172","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-17T23:52:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XDKcPFhwoqflJw+i9ghTFLwN1AYuhEZYEU8DOwq9Q7lgMe5lu/CG10HJ5dfFA5RFC0nwpfT4x770sTHTGwShDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:46:19.586556Z"},"content_sha256":"030989c85cf65e5ebf328330a694aad4b395e89381db04f97d5a023dde5bda36","schema_version":"1.0","event_id":"sha256:030989c85cf65e5ebf328330a694aad4b395e89381db04f97d5a023dde5bda36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/bundle.json","state_url":"https://pith.science/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/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-28T20:46:19Z","links":{"resolver":"https://pith.science/pith/NSK7SKJPBJHZAKURAZOMOZF45Z","bundle":"https://pith.science/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/bundle.json","state":"https://pith.science/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSK7SKJPBJHZAKURAZOMOZF45Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NSK7SKJPBJHZAKURAZOMOZF45Z","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":"812f78f6c728cc9f7d930882c756a2ce09134fc271c4e964a349055995156f7c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T19:16:24Z","title_canon_sha256":"6785f46334c0fe651d73947f1d68494365ba4eff3d9fd41156cbe4b10a2445a3"},"schema_version":"1.0","source":{"id":"1902.10172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10172","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10172v1","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10172","created_at":"2026-05-17T23:52:31Z"},{"alias_kind":"pith_short_12","alias_value":"NSK7SKJPBJHZ","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NSK7SKJPBJHZAKUR","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NSK7SKJP","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:030989c85cf65e5ebf328330a694aad4b395e89381db04f97d5a023dde5bda36","target":"graph","created_at":"2026-05-17T23:52:31Z","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":"In this paper, we investigate a class of submodular problems which in general are very hard. These include minimizing a submodular cost function under combinatorial constraints, which include cuts, matchings, paths, etc., optimizing a submodular function under submodular cover and submodular knapsack constraints, and minimizing a ratio of submodular functions. All these problems appear in several real world problems but have hardness factors of $\\Omega(\\sqrt{n})$ for general submodular cost functions. We show how we can achieve constant approximation factors when we restrict the cost functions","authors_text":"Jeff Bilmes, Rishabh Iyer","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T19:16:24Z","title":"Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10172","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:4000ba4d4afeb631adf57b977dcfae4a2a936db79d06e1cf0580c4502ee24ffd","target":"record","created_at":"2026-05-17T23:52:31Z","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":"812f78f6c728cc9f7d930882c756a2ce09134fc271c4e964a349055995156f7c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T19:16:24Z","title_canon_sha256":"6785f46334c0fe651d73947f1d68494365ba4eff3d9fd41156cbe4b10a2445a3"},"schema_version":"1.0","source":{"id":"1902.10172","kind":"arxiv","version":1}},"canonical_sha256":"6c95f9292f0a4f902a91065cc764bcee425475ccbcf680535747bb3ec7257752","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c95f9292f0a4f902a91065cc764bcee425475ccbcf680535747bb3ec7257752","first_computed_at":"2026-05-17T23:52:31.572416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:31.572416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAwqpml5u5zsk5L7lVFsYfwEmTIGa8fqmWtlEpF2KBBi4Sl5Kum5FpOJIIK+Dieo+LlVxroO60JNV3tgIRmdBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:31.573331Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4000ba4d4afeb631adf57b977dcfae4a2a936db79d06e1cf0580c4502ee24ffd","sha256:030989c85cf65e5ebf328330a694aad4b395e89381db04f97d5a023dde5bda36"],"state_sha256":"70e0e2896f6324b8b39423451b4c0e244ee9ba834ba8689b901235c264bf26b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fuAfgqFm9OcKeKoOYcs/3heI8DmOzREQjMO8NbVLRrUi8iaZBVx+L+pIx833ClLoaDagkOk2v9iCOmcfQaydDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:46:19.590529Z","bundle_sha256":"9018385e0a6e26c75d92298219650e1dea7a1904c0ca3521e0dbf4933839ce6a"}}