{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RBHPJ23KGKHUBSOGGQTNTIKIOM","short_pith_number":"pith:RBHPJ23K","canonical_record":{"source":{"id":"1510.08865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:07:32Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"3b747dd727defbb1a1f958b71eb73e931732191cabef0c9c04b99967c0ebe6d9","abstract_canon_sha256":"b45bedfa8d9a18a19a68a2f92f35b6a03fe4835ade593fbba5e8fe5779ba23c4"},"schema_version":"1.0"},"canonical_sha256":"884ef4eb6a328f40c9c63426d9a1487323e5ffc34647bc8144e2a82c617e412b","source":{"kind":"arxiv","id":"1510.08865","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08865","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08865v2","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08865","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"RBHPJ23KGKHU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RBHPJ23KGKHUBSOG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RBHPJ23K","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RBHPJ23KGKHUBSOGGQTNTIKIOM","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:07:32Z","cross_cats_sorted":["cs.DM","cs.LG"],"title_canon_sha256":"3b747dd727defbb1a1f958b71eb73e931732191cabef0c9c04b99967c0ebe6d9","abstract_canon_sha256":"b45bedfa8d9a18a19a68a2f92f35b6a03fe4835ade593fbba5e8fe5779ba23c4"},"schema_version":"1.0"},"canonical_sha256":"884ef4eb6a328f40c9c63426d9a1487323e5ffc34647bc8144e2a82c617e412b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:43.242153Z","signature_b64":"UKPqtWlU00GBcMKRf2x3eaSbiIFN3DA67rhKRgG5rasUwwCH6mI0iIgvKyLlzcswIEAzmNK/BP7M8MACxEQcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"884ef4eb6a328f40c9c63426d9a1487323e5ffc34647bc8144e2a82c617e412b","last_reissued_at":"2026-05-18T01:08:43.241623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:43.241623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08865","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:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxMHwekyvlVBdRy0vv0FoUQrAaP0R6lrm/O8b+uYvI9SC3ip+ATQmozfsR/3sRbVJ+LE0DflvYB3QWlB5P0zAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:40:14.542183Z"},"content_sha256":"d0885f63368ff66b0de06c0f7cf96a3289e36cbeda558af0d4efd5ab3ad01c61","schema_version":"1.0","event_id":"sha256:d0885f63368ff66b0de06c0f7cf96a3289e36cbeda558af0d4efd5ab3ad01c61"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RBHPJ23KGKHUBSOGGQTNTIKIOM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications to Parallel Machine Learning and Multi-Label Image Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.LG"],"primary_cat":"cs.DS","authors_text":"Jeff Bilmes, Kai Wei, Rishabh Iyer, Shengjie Wang, Wenruo Bai","submitted_at":"2015-10-29T20:07:32Z","abstract_excerpt":"We study two mixed robust/average-case submodular partitioning problems that we collectively call Submodular Partitioning. These problems generalize both purely robust instances of the problem (namely max-min submodular fair allocation (SFA) and min-max submodular load balancing (SLB) and also generalize average-case instances (that is the submodular welfare problem (SWP) and submodular multiway partition (SMP). While the robust versions have been studied in the theory community, existing work has focused on tight approximation guarantees, and the resultant algorithms are not, in general, scal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08865","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:08:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cs0N3PyR3GSWJDtouSp0YWg2TSIqQSzmuX80sFGHHdZLnVitpLCNclqD8vhzx7zxw3bGPyeg0WbBVGdJH4SNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:40:14.542904Z"},"content_sha256":"15b5c1c9cfda827c00a59438596cca38c2c7729207e0b02da83a9429b535b96d","schema_version":"1.0","event_id":"sha256:15b5c1c9cfda827c00a59438596cca38c2c7729207e0b02da83a9429b535b96d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/bundle.json","state_url":"https://pith.science/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/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-05-23T23:40:14Z","links":{"resolver":"https://pith.science/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM","bundle":"https://pith.science/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/bundle.json","state":"https://pith.science/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RBHPJ23KGKHUBSOGGQTNTIKIOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RBHPJ23KGKHUBSOGGQTNTIKIOM","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":"b45bedfa8d9a18a19a68a2f92f35b6a03fe4835ade593fbba5e8fe5779ba23c4","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:07:32Z","title_canon_sha256":"3b747dd727defbb1a1f958b71eb73e931732191cabef0c9c04b99967c0ebe6d9"},"schema_version":"1.0","source":{"id":"1510.08865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08865","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08865v2","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08865","created_at":"2026-05-18T01:08:43Z"},{"alias_kind":"pith_short_12","alias_value":"RBHPJ23KGKHU","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RBHPJ23KGKHUBSOG","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RBHPJ23K","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:15b5c1c9cfda827c00a59438596cca38c2c7729207e0b02da83a9429b535b96d","target":"graph","created_at":"2026-05-18T01:08:43Z","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 study two mixed robust/average-case submodular partitioning problems that we collectively call Submodular Partitioning. These problems generalize both purely robust instances of the problem (namely max-min submodular fair allocation (SFA) and min-max submodular load balancing (SLB) and also generalize average-case instances (that is the submodular welfare problem (SWP) and submodular multiway partition (SMP). While the robust versions have been studied in the theory community, existing work has focused on tight approximation guarantees, and the resultant algorithms are not, in general, scal","authors_text":"Jeff Bilmes, Kai Wei, Rishabh Iyer, Shengjie Wang, Wenruo Bai","cross_cats":["cs.DM","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:07:32Z","title":"Mixed Robust/Average Submodular Partitioning: Fast Algorithms, Guarantees, and Applications to Parallel Machine Learning and Multi-Label Image Segmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08865","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:d0885f63368ff66b0de06c0f7cf96a3289e36cbeda558af0d4efd5ab3ad01c61","target":"record","created_at":"2026-05-18T01:08:43Z","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":"b45bedfa8d9a18a19a68a2f92f35b6a03fe4835ade593fbba5e8fe5779ba23c4","cross_cats_sorted":["cs.DM","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-29T20:07:32Z","title_canon_sha256":"3b747dd727defbb1a1f958b71eb73e931732191cabef0c9c04b99967c0ebe6d9"},"schema_version":"1.0","source":{"id":"1510.08865","kind":"arxiv","version":2}},"canonical_sha256":"884ef4eb6a328f40c9c63426d9a1487323e5ffc34647bc8144e2a82c617e412b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"884ef4eb6a328f40c9c63426d9a1487323e5ffc34647bc8144e2a82c617e412b","first_computed_at":"2026-05-18T01:08:43.241623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:43.241623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UKPqtWlU00GBcMKRf2x3eaSbiIFN3DA67rhKRgG5rasUwwCH6mI0iIgvKyLlzcswIEAzmNK/BP7M8MACxEQcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:43.242153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0885f63368ff66b0de06c0f7cf96a3289e36cbeda558af0d4efd5ab3ad01c61","sha256:15b5c1c9cfda827c00a59438596cca38c2c7729207e0b02da83a9429b535b96d"],"state_sha256":"dc0e2e9453097847a6c57cc134b9b26725a45e028c5eb786ba75a1bdc751aea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jL4i88y2PNjqY8ouVAV3wDdUlxkl6jD3QbAX+XOMHcGWO83f6Mkrpt6ZtWp+dfhqPF43lQ1hqCX3xTZnTt2TDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:40:14.547533Z","bundle_sha256":"eee998975302fcce54820fb79bd563235ee9f036dac8a7eb6ff792bb3a6e0467"}}