{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6H3C5IG3KA572AEEIP33NXJRNR","short_pith_number":"pith:6H3C5IG3","schema_version":"1.0","canonical_sha256":"f1f62ea0db503bfd008443f7b6dd316c7c9258fe3fddfcf5e1007c91818a00a9","source":{"kind":"arxiv","id":"1409.1399","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.1399","created_at":"2026-05-18T01:09:55.492958+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1399v2","created_at":"2026-05-18T01:09:55.492958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1399","created_at":"2026-05-18T01:09:55.492958+00:00"},{"alias_kind":"pith_short_12","alias_value":"6H3C5IG3KA57","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6H3C5IG3KA572AEE","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6H3C5IG3","created_at":"2026-05-18T12:28:16.859392+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/6H3C5IG3KA572AEEIP33NXJRNR","json":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR.json","graph_json":"https://pith.science/api/pith-number/6H3C5IG3KA572AEEIP33NXJRNR/graph.json","events_json":"https://pith.science/api/pith-number/6H3C5IG3KA572AEEIP33NXJRNR/events.json","paper":"https://pith.science/paper/6H3C5IG3"},"agent_actions":{"view_html":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR","download_json":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR.json","view_paper":"https://pith.science/paper/6H3C5IG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1399&json=true","fetch_graph":"https://pith.science/api/pith-number/6H3C5IG3KA572AEEIP33NXJRNR/graph.json","fetch_events":"https://pith.science/api/pith-number/6H3C5IG3KA572AEEIP33NXJRNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/action/storage_attestation","attest_author":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/action/author_attestation","sign_citation":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/action/citation_signature","submit_replication":"https://pith.science/pith/6H3C5IG3KA572AEEIP33NXJRNR/action/replication_record"}},"created_at":"2026-05-18T01:09:55.492958+00:00","updated_at":"2026-05-18T01:09:55.492958+00:00"}