{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FYBA6S7RKMCFZTICHLLN7RFR3O","short_pith_number":"pith:FYBA6S7R","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"},"canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","source":{"kind":"arxiv","id":"1607.07957","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07957","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07957v3","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07957","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"FYBA6S7RKMCF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYBA6S7RKMCFZTIC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYBA6S7R","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FYBA6S7RKMCFZTICHLLN7RFR3O","target":"record","payload":{"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"},"canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","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"},"source_kind":"arxiv","source_id":"1607.07957","source_version":3,"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-18T01:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XX/pI8C6UjiHzyP7xvvtsYyh3B8seC14Q3uLLXyQlmeWluPrFeWNE1I0RDIPFXD+E8QY16agUgRYJdPxAcccBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:13:51.783668Z"},"content_sha256":"bc466f3fd0ff4bc4e5f09b9204764fc403c2bdf17f6318a9411379e248267a87","schema_version":"1.0","event_id":"sha256:bc466f3fd0ff4bc4e5f09b9204764fc403c2bdf17f6318a9411379e248267a87"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FYBA6S7RKMCFZTICHLLN7RFR3O","target":"graph","payload":{"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"},"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-18T01:08:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ca5cDFGrONOtjBlflnQWDPmmHG7G2iUvm+XkzboW6Hnb8xv01+U6s8CFNyDBEnOXvsT4laqKACMI5a6GmFHKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:13:51.784032Z"},"content_sha256":"6c4094c074f242c97959442a35eeccf5a841c039ff9b76bace045de4486ad789","schema_version":"1.0","event_id":"sha256:6c4094c074f242c97959442a35eeccf5a841c039ff9b76bace045de4486ad789"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/bundle.json","state_url":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/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-06-03T08:13:51Z","links":{"resolver":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O","bundle":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/bundle.json","state":"https://pith.science/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYBA6S7RKMCFZTICHLLN7RFR3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FYBA6S7RKMCFZTICHLLN7RFR3O","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":"3a4a68f0555fb71aef0fa102f13653ed4e27d0533825d84ceee74a7db04d4662","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T04:55:34Z","title_canon_sha256":"12314e301e36217e0a5fc6465edfa65ddf96c8cbc93ce8095f575d7a1d4e3f3a"},"schema_version":"1.0","source":{"id":"1607.07957","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07957","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07957v3","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07957","created_at":"2026-05-18T01:08:23Z"},{"alias_kind":"pith_short_12","alias_value":"FYBA6S7RKMCF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYBA6S7RKMCFZTIC","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYBA6S7R","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:6c4094c074f242c97959442a35eeccf5a841c039ff9b76bace045de4486ad789","target":"graph","created_at":"2026-05-18T01:08:23Z","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":"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","authors_text":"Shinsaku Sakaue","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T04:55:34Z","title":"On maximizing a monotone k-submodular function subject to a matroid constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07957","kind":"arxiv","version":3},"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:bc466f3fd0ff4bc4e5f09b9204764fc403c2bdf17f6318a9411379e248267a87","target":"record","created_at":"2026-05-18T01:08:23Z","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":"3a4a68f0555fb71aef0fa102f13653ed4e27d0533825d84ceee74a7db04d4662","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-27T04:55:34Z","title_canon_sha256":"12314e301e36217e0a5fc6465edfa65ddf96c8cbc93ce8095f575d7a1d4e3f3a"},"schema_version":"1.0","source":{"id":"1607.07957","kind":"arxiv","version":3}},"canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e020f4bf153045ccd023ad6dfc4b1db8f996c40a4f10d6ddf2e04d32b3087fb","first_computed_at":"2026-05-18T01:08:23.566642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:23.566642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SIXeXwQDMw9mutgpzhlGMFqnuxHPlhSZoZ3SO8DuilaekGBbGOBS8LOaqs3eHZnRA6MM5lrK/BAhmmKDs3PaBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:23.567364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07957","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc466f3fd0ff4bc4e5f09b9204764fc403c2bdf17f6318a9411379e248267a87","sha256:6c4094c074f242c97959442a35eeccf5a841c039ff9b76bace045de4486ad789"],"state_sha256":"1187859b3bee9cfcc63cf8fadf67bc56dba191862ec41029e173c789aa11f011"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9OGh+T/7/MSpCeCic/ly7zwesu78bniVyHGeAzdJW8O+do+edJIANlWlDaE99aUwK8LPjI2qOBt2y04pvv5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:13:51.786027Z","bundle_sha256":"a9adcea9a2d90595c93096f17333737bbe4e376888baa0d169a8a71181d2aeef"}}