{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:75BGPAKG7QAVYTXMC3EHB2PLIW","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":"ec6cdffb22cf3d1738e6d06e50ee9c35e6e85565ac99a2951060e0d6eee21e50","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-11-10T02:55:47Z","title_canon_sha256":"27a92f0ee986cbf5551afbe6e12a0bb71c5bf7c9a63c66952548d34e21b55096"},"schema_version":"1.0","source":{"id":"1811.04177","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04177","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04177v1","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04177","created_at":"2026-05-18T00:01:06Z"},{"alias_kind":"pith_short_12","alias_value":"75BGPAKG7QAV","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"75BGPAKG7QAVYTXM","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"75BGPAKG","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:ee076e769911da969a145b67273af963f220d5b24fe56b5ab27ba8c0d8a79060","target":"graph","created_at":"2026-05-18T00:01:06Z","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 submodular function maximization is an attractive optimization model that appears in many real applications. Although a variety of greedy algorithms quickly find good feasible solutions for many instances while guaranteeing (1-1/e)-approximation ratio, we still encounter many real applications that ask optimal or better feasible solutions within reasonable computation time. In this paper, we present an efficient branch-and-bound algorithm for the non-decreasing submodular function maximization problem based on its binary integer programming (BIP) formulation with a huge number of constrain","authors_text":"Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-11-10T02:55:47Z","title":"An efficient branch-and-bound algorithm for submodular function maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04177","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:6a0f25111ee7792ff4300e1951ecec2c4359dce52ab18117c9a71b1d2c22beba","target":"record","created_at":"2026-05-18T00:01:06Z","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":"ec6cdffb22cf3d1738e6d06e50ee9c35e6e85565ac99a2951060e0d6eee21e50","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2018-11-10T02:55:47Z","title_canon_sha256":"27a92f0ee986cbf5551afbe6e12a0bb71c5bf7c9a63c66952548d34e21b55096"},"schema_version":"1.0","source":{"id":"1811.04177","kind":"arxiv","version":1}},"canonical_sha256":"ff42678146fc015c4eec16c870e9eb45b5176e1e28d80403fabf92b6bea3291b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff42678146fc015c4eec16c870e9eb45b5176e1e28d80403fabf92b6bea3291b","first_computed_at":"2026-05-18T00:01:06.042873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:06.042873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1S9rsFZxxCVqOjaydX/gsJ9OOtRAhAqpqsgN9CfpalTb52TMHm9on4LtHn31/HkurXfn8BJSYexVdDyf3b+SBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:06.043495Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04177","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a0f25111ee7792ff4300e1951ecec2c4359dce52ab18117c9a71b1d2c22beba","sha256:ee076e769911da969a145b67273af963f220d5b24fe56b5ab27ba8c0d8a79060"],"state_sha256":"dedbf6e3779c0c30a9e34f19301cfbdba64ebf86f3a75a6773563ad08c2571e4"}