{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RTH22O6PJBA2AAE24IGXSXAEJG","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":"11575e4a7e22146b578731a6b83a861c51312ad3fc15ceb25928fb795344c48d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T05:44:00Z","title_canon_sha256":"50e8bbe3b956e429b1625e3833f834c0671b615c88ebe263274f8807bedebcbc"},"schema_version":"1.0","source":{"id":"1904.12682","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.12682","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"arxiv_version","alias_value":"1904.12682v1","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.12682","created_at":"2026-05-17T23:47:34Z"},{"alias_kind":"pith_short_12","alias_value":"RTH22O6PJBA2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RTH22O6PJBA2AAE2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RTH22O6P","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:cb68a526ff8d4133bb84db373fac11fded26b32b171effd5969023f1bdf7f640","target":"graph","created_at":"2026-05-17T23:47:34Z","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":"When approaching to problems in computer science, we often encounter situations where a subset of a finite set maximizing some utility function needs to be selected. Some of such utility functions are known to be approximately submodular. For the problem of maximizing an approximately submodular function (ASFM problem), a greedy algorithm quickly finds good feasible solutions for many instances while guaranteeing ($1-e^{-\\gamma}$)-approximation ratio for a given submodular ratio $\\gamma$. However, we still encounter its applications that ask more accurate or exactly optimal solutions within a ","authors_text":"Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T05:44:00Z","title":"An efficient branch-and-cut algorithm for approximately submodular function maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.12682","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:f895a9d5d068102aaec28d03fad545d9e4b61e52b00332619df95a04e8fd47cf","target":"record","created_at":"2026-05-17T23:47:34Z","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":"11575e4a7e22146b578731a6b83a861c51312ad3fc15ceb25928fb795344c48d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2019-04-26T05:44:00Z","title_canon_sha256":"50e8bbe3b956e429b1625e3833f834c0671b615c88ebe263274f8807bedebcbc"},"schema_version":"1.0","source":{"id":"1904.12682","kind":"arxiv","version":1}},"canonical_sha256":"8ccfad3bcf4841a0009ae20d795c0449b5cd1e668b80d31c653cdcf0f4e4ebcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ccfad3bcf4841a0009ae20d795c0449b5cd1e668b80d31c653cdcf0f4e4ebcb","first_computed_at":"2026-05-17T23:47:34.363403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:34.363403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RN4ycMS0gtkvNyyGGfjHr+laPkfzs+03cUThxVvON5TH0pnLR8htdS3eNDI6iwUJk7sHj464g7PLZscYbAjZCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:34.363882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.12682","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f895a9d5d068102aaec28d03fad545d9e4b61e52b00332619df95a04e8fd47cf","sha256:cb68a526ff8d4133bb84db373fac11fded26b32b171effd5969023f1bdf7f640"],"state_sha256":"12fab2b49c4aba9621eb57413da90a77819b9cfc260e8f81d1ccde142c43c1df"}