{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BWO6LBKC3LJC5JXT2TCPPAX6F6","short_pith_number":"pith:BWO6LBKC","schema_version":"1.0","canonical_sha256":"0d9de58542dad22ea6f3d4c4f782fe2f8329179b8dcb918873699432c6b9014c","source":{"kind":"arxiv","id":"1910.01353","version":2},"attestation_state":"computed","paper":{"title":"Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dabeen Lee, Fatma K{\\i}l{\\i}n\\c{c}-Karzan, Simge K\\\"u\\c{c}\\\"ukyavuz","submitted_at":"2019-10-03T08:27:57Z","abstract_excerpt":"A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly a knapsack constraint). In this paper, we first revisit basic mixing sets by establishing a strong and previously unrecognized connection to submodularity. In particular, we show that mixing inequalities with binary variables are nothing but the polymatroid inequalities associated with a specific submodular function. This submodularity viewpoint enables us to unify and extend"},"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":"1910.01353","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-10-03T08:27:57Z","cross_cats_sorted":[],"title_canon_sha256":"ab6a67e5d5f36ebf8d781ca5f5ecac2e2bf9339aa27e46b5ab2c84ef4b94d8d9","abstract_canon_sha256":"ef09575a9d90f509455bcc147e92791ccd45537f468a3eed3be07bdf04e24f8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:52:56.120018Z","signature_b64":"VU61IUccPH9TjqtlGz/VIvraWuHmBOhXfrshDS8G43/B+taCFCjY3mWqasXmIJsQEDsjZ6BChgNPQc/qgHCdDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9de58542dad22ea6f3d4c4f782fe2f8329179b8dcb918873699432c6b9014c","last_reissued_at":"2026-07-05T02:52:56.119674Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:52:56.119674Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dabeen Lee, Fatma K{\\i}l{\\i}n\\c{c}-Karzan, Simge K\\\"u\\c{c}\\\"ukyavuz","submitted_at":"2019-10-03T08:27:57Z","abstract_excerpt":"A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly a knapsack constraint). In this paper, we first revisit basic mixing sets by establishing a strong and previously unrecognized connection to submodularity. In particular, we show that mixing inequalities with binary variables are nothing but the polymatroid inequalities associated with a specific submodular function. This submodularity viewpoint enables us to unify and extend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.01353","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.01353/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.01353","created_at":"2026-07-05T02:52:56.119730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.01353v2","created_at":"2026-07-05T02:52:56.119730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.01353","created_at":"2026-07-05T02:52:56.119730+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWO6LBKC3LJC","created_at":"2026-07-05T02:52:56.119730+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWO6LBKC3LJC5JXT","created_at":"2026-07-05T02:52:56.119730+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWO6LBKC","created_at":"2026-07-05T02:52:56.119730+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.16330","citing_title":"Rank-one convexification for quadratic optimization problems with step function penalties","ref_index":55,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6","json":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6.json","graph_json":"https://pith.science/api/pith-number/BWO6LBKC3LJC5JXT2TCPPAX6F6/graph.json","events_json":"https://pith.science/api/pith-number/BWO6LBKC3LJC5JXT2TCPPAX6F6/events.json","paper":"https://pith.science/paper/BWO6LBKC"},"agent_actions":{"view_html":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6","download_json":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6.json","view_paper":"https://pith.science/paper/BWO6LBKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.01353&json=true","fetch_graph":"https://pith.science/api/pith-number/BWO6LBKC3LJC5JXT2TCPPAX6F6/graph.json","fetch_events":"https://pith.science/api/pith-number/BWO6LBKC3LJC5JXT2TCPPAX6F6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6/action/storage_attestation","attest_author":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6/action/author_attestation","sign_citation":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6/action/citation_signature","submit_replication":"https://pith.science/pith/BWO6LBKC3LJC5JXT2TCPPAX6F6/action/replication_record"}},"created_at":"2026-07-05T02:52:56.119730+00:00","updated_at":"2026-07-05T02:52:56.119730+00:00"}