{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IDJDHB5IMPZKKZX54BF7YCHADS","short_pith_number":"pith:IDJDHB5I","schema_version":"1.0","canonical_sha256":"40d23387a863f2a566fde04bfc08e01ca2ea1882ec4d1e5a2570a2d8fe1ba521","source":{"kind":"arxiv","id":"1309.5469","version":1},"attestation_state":"computed","paper":{"title":"Towards Minimizing k-Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anna Huber, Vladimir Kolmogorov","submitted_at":"2013-09-21T12:37:35Z","abstract_excerpt":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\n  In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define and investigate a k-submodular polyhedron and prove a Min-Max-Theorem for k-submodular functions."},"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":"1309.5469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-21T12:37:35Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0e44446f59b6c522fb9c9a44dc3622e03febb9ccc989f730bf035263590458e9","abstract_canon_sha256":"799b5d502ace6e44247222e898af2504d2b75f6f68ca6ddfc2124e0d6531f270"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.536888Z","signature_b64":"bDBa3QosNV9/J4jVrAQhsHfLg+TLqdgGKHUAV40iLfjDP5P1zXXnx4QiIpQBNRumjN/3xvBl2tpvhQjfwRA1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40d23387a863f2a566fde04bfc08e01ca2ea1882ec4d1e5a2570a2d8fe1ba521","last_reissued_at":"2026-05-18T03:12:34.536083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.536083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Minimizing k-Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Anna Huber, Vladimir Kolmogorov","submitted_at":"2013-09-21T12:37:35Z","abstract_excerpt":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\n  In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define and investigate a k-submodular polyhedron and prove a Min-Max-Theorem for k-submodular functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5469","kind":"arxiv","version":1},"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":"1309.5469","created_at":"2026-05-18T03:12:34.536206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5469v1","created_at":"2026-05-18T03:12:34.536206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5469","created_at":"2026-05-18T03:12:34.536206+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDJDHB5IMPZK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDJDHB5IMPZKKZX5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDJDHB5I","created_at":"2026-05-18T12:27:46.883200+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/IDJDHB5IMPZKKZX54BF7YCHADS","json":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS.json","graph_json":"https://pith.science/api/pith-number/IDJDHB5IMPZKKZX54BF7YCHADS/graph.json","events_json":"https://pith.science/api/pith-number/IDJDHB5IMPZKKZX54BF7YCHADS/events.json","paper":"https://pith.science/paper/IDJDHB5I"},"agent_actions":{"view_html":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS","download_json":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS.json","view_paper":"https://pith.science/paper/IDJDHB5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5469&json=true","fetch_graph":"https://pith.science/api/pith-number/IDJDHB5IMPZKKZX54BF7YCHADS/graph.json","fetch_events":"https://pith.science/api/pith-number/IDJDHB5IMPZKKZX54BF7YCHADS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS/action/storage_attestation","attest_author":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS/action/author_attestation","sign_citation":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS/action/citation_signature","submit_replication":"https://pith.science/pith/IDJDHB5IMPZKKZX54BF7YCHADS/action/replication_record"}},"created_at":"2026-05-18T03:12:34.536206+00:00","updated_at":"2026-05-18T03:12:34.536206+00:00"}