{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FYBA6S7RKMCFZTICHLLN7RFR3O","short_pith_number":"pith:FYBA6S7R","schema_version":"1.0","canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","source":{"kind":"arxiv","id":"1607.07957","version":3},"attestation_state":"computed","paper":{"title":"On maximizing a monotone k-submodular function subject to a matroid constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Shinsaku Sakaue","submitted_at":"2016-07-27T04:55:34Z","abstract_excerpt":"A $k$-submodular function is an extension of a submodular function in that its input is given by $k$ disjoint subsets instead of a single subset. For unconstrained nonnegative $k$-submodular maximization, Ward and \\v{Z}ivn\\'y proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata, Tanigawa and Yoshida presenting a $1/2$-approximation algorithm. Iwata et al. also provided a $k/(2k-1)$-approximation algorithm for monotone $k$-submodular maximization and proved that its approximation ratio is asymptotically tight. More recently, Ohsaka and Yoshida propo"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.07957","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T04:55:34Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"12314e301e36217e0a5fc6465edfa65ddf96c8cbc93ce8095f575d7a1d4e3f3a","abstract_canon_sha256":"3a4a68f0555fb71aef0fa102f13653ed4e27d0533825d84ceee74a7db04d4662"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:23.567364Z","signature_b64":"SIXeXwQDMw9mutgpzhlGMFqnuxHPlhSZoZ3SO8DuilaekGBbGOBS8LOaqs3eHZnRA6MM5lrK/BAhmmKDs3PaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","last_reissued_at":"2026-05-18T01:08:23.566642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:23.566642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On maximizing a monotone k-submodular function subject to a matroid constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Shinsaku Sakaue","submitted_at":"2016-07-27T04:55:34Z","abstract_excerpt":"A $k$-submodular function is an extension of a submodular function in that its input is given by $k$ disjoint subsets instead of a single subset. For unconstrained nonnegative $k$-submodular maximization, Ward and \\v{Z}ivn\\'y proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata, Tanigawa and Yoshida presenting a $1/2$-approximation algorithm. Iwata et al. also provided a $k/(2k-1)$-approximation algorithm for monotone $k$-submodular maximization and proved that its approximation ratio is asymptotically tight. More recently, Ohsaka and Yoshida propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07957","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.07957","created_at":"2026-05-18T01:08:23.566775+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07957v3","created_at":"2026-05-18T01:08:23.566775+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07957","created_at":"2026-05-18T01:08:23.566775+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYBA6S7RKMCF","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYBA6S7RKMCFZTIC","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYBA6S7R","created_at":"2026-05-18T12:30:15.759754+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O","json":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O.json","graph_json":"https://pith.science/api/pith-number/FYBA6S7RKMCFZTICHLLN7RFR3O/graph.json","events_json":"https://pith.science/api/pith-number/FYBA6S7RKMCFZTICHLLN7RFR3O/events.json","paper":"https://pith.science/paper/FYBA6S7R"},"agent_actions":{"view_html":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O","download_json":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O.json","view_paper":"https://pith.science/paper/FYBA6S7R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07957&json=true","fetch_graph":"https://pith.science/api/pith-number/FYBA6S7RKMCFZTICHLLN7RFR3O/graph.json","fetch_events":"https://pith.science/api/pith-number/FYBA6S7RKMCFZTICHLLN7RFR3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/action/storage_attestation","attest_author":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/action/author_attestation","sign_citation":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/action/citation_signature","submit_replication":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/action/replication_record"}},"created_at":"2026-05-18T01:08:23.566775+00:00","updated_at":"2026-05-18T01:08:23.566775+00:00"}