{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6H3C5IG3KA572AEEIP33NXJRNR","short_pith_number":"pith:6H3C5IG3","canonical_record":{"source":{"id":"1409.1399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-04T11:06:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8cb734bcf1f019fd6c95847cc8010902db647a7d095e8c463ee9ac9755bbdc1","abstract_canon_sha256":"6ff318b2242340f4917d7df5dee13a814280d7d375b142dcf3c3fc92e4e9b32e"},"schema_version":"1.0"},"canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","source":{"kind":"arxiv","id":"1409.1399","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1399","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1399v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1399","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"6H3C5IG3KA57","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6H3C5IG3KA572AEE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6H3C5IG3","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6H3C5IG3KA572AEEIP33NXJRNR","target":"record","payload":{"canonical_record":{"source":{"id":"1409.1399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-04T11:06:04Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f8cb734bcf1f019fd6c95847cc8010902db647a7d095e8c463ee9ac9755bbdc1","abstract_canon_sha256":"6ff318b2242340f4917d7df5dee13a814280d7d375b142dcf3c3fc92e4e9b32e"},"schema_version":"1.0"},"canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.493546Z","signature_b64":"jBiKMl5flCDaOWdho4iZM9sawnLo7ZoKR1/ItA9Wep1EDcU8BO1lDBhrWRtGHqdGSQPbSEa5oV0KcM39NjveCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","last_reissued_at":"2026-05-18T01:09:55.492830Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.492830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.1399","source_version":2,"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:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eNZsy7kV4G8SWQZkHEhJSugJnxj89X337fMoCMo+aadip3wltxZazCfF7Z4EZqe0Sgl+FcgJbcUU4//dysxcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:40:44.488800Z"},"content_sha256":"384e80d7a81008c6c8d846a2d9a5a8989071745013f73308780bf9d88aa99f47","schema_version":"1.0","event_id":"sha256:384e80d7a81008c6c8d846a2d9a5a8989071745013f73308780bf9d88aa99f47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6H3C5IG3KA572AEEIP33NXJRNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximizing k-Submodular Functions and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Justin Ward, Stanislav Zivny","submitted_at":"2014-09-04T11:06:04Z","abstract_excerpt":"We consider the maximization problem in the value oracle model of functions defined on $k$-tuples of sets that are submodular in every orthant and $r$-wise monotone, where $k\\geq 2$ and $1\\leq r\\leq k$. We give an analysis of a deterministic greedy algorithm that shows that any such function can be approximated to a factor of $1/(1+r)$. For $r=k$, we give an analysis of a randomised greedy algorithm that shows that any such function can be approximated to a factor of $1/(1+\\sqrt{k/2})$.\n  In the case of $k=r=2$, the considered functions correspond precisely to bisubmodular functions, in which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1399","kind":"arxiv","version":2},"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:09:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GR6XmXOJj2Ig6cukh68r2T5vynNZJYAQ/xw+/QZJTw+9IL/4Q9eD2RKnj0bjQAww3E7ATNAzdOvG4ZiKExIDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:40:44.489141Z"},"content_sha256":"555bd1dcdfc8cd8ddfbd53bb32d1e3cb3cbf342f6fcf6e52ce1f1329b46b4d19","schema_version":"1.0","event_id":"sha256:555bd1dcdfc8cd8ddfbd53bb32d1e3cb3cbf342f6fcf6e52ce1f1329b46b4d19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/bundle.json","state_url":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6H3C5IG3KA572AEEIP33NXJRNR/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-03T09:40:44Z","links":{"resolver":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR","bundle":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/bundle.json","state":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6H3C5IG3KA572AEEIP33NXJRNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6H3C5IG3KA572AEEIP33NXJRNR","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":"6ff318b2242340f4917d7df5dee13a814280d7d375b142dcf3c3fc92e4e9b32e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-04T11:06:04Z","title_canon_sha256":"f8cb734bcf1f019fd6c95847cc8010902db647a7d095e8c463ee9ac9755bbdc1"},"schema_version":"1.0","source":{"id":"1409.1399","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1399","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1399v2","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1399","created_at":"2026-05-18T01:09:55Z"},{"alias_kind":"pith_short_12","alias_value":"6H3C5IG3KA57","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6H3C5IG3KA572AEE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6H3C5IG3","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:555bd1dcdfc8cd8ddfbd53bb32d1e3cb3cbf342f6fcf6e52ce1f1329b46b4d19","target":"graph","created_at":"2026-05-18T01:09:55Z","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":"We consider the maximization problem in the value oracle model of functions defined on $k$-tuples of sets that are submodular in every orthant and $r$-wise monotone, where $k\\geq 2$ and $1\\leq r\\leq k$. We give an analysis of a deterministic greedy algorithm that shows that any such function can be approximated to a factor of $1/(1+r)$. For $r=k$, we give an analysis of a randomised greedy algorithm that shows that any such function can be approximated to a factor of $1/(1+\\sqrt{k/2})$.\n  In the case of $k=r=2$, the considered functions correspond precisely to bisubmodular functions, in which ","authors_text":"Justin Ward, Stanislav Zivny","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-04T11:06:04Z","title":"Maximizing k-Submodular Functions and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1399","kind":"arxiv","version":2},"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:384e80d7a81008c6c8d846a2d9a5a8989071745013f73308780bf9d88aa99f47","target":"record","created_at":"2026-05-18T01:09:55Z","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":"6ff318b2242340f4917d7df5dee13a814280d7d375b142dcf3c3fc92e4e9b32e","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-04T11:06:04Z","title_canon_sha256":"f8cb734bcf1f019fd6c95847cc8010902db647a7d095e8c463ee9ac9755bbdc1"},"schema_version":"1.0","source":{"id":"1409.1399","kind":"arxiv","version":2}},"canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","first_computed_at":"2026-05-18T01:09:55.492830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:55.492830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBiKMl5flCDaOWdho4iZM9sawnLo7ZoKR1/ItA9Wep1EDcU8BO1lDBhrWRtGHqdGSQPbSEa5oV0KcM39NjveCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:55.493546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1399","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:384e80d7a81008c6c8d846a2d9a5a8989071745013f73308780bf9d88aa99f47","sha256:555bd1dcdfc8cd8ddfbd53bb32d1e3cb3cbf342f6fcf6e52ce1f1329b46b4d19"],"state_sha256":"510ddfcc45480cc1cdbd7f6ec5fae12049135b5761f3e4a79991b84c66aef428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oD5CAAsrLNkmehbEW12E3WhKDQoeExd+VjgeL9McAfbNKlTN811VPfkj9p//12rBiQ36uwdZCyGCQ7Wl09CQCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:40:44.491055Z","bundle_sha256":"cc0049950f6e2ed10a95308c2a3f8d0f994d586b8694ef3fcea89e84f8172979"}}