{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EJS6G7LH553MBQULWI6UAV2UVM","short_pith_number":"pith:EJS6G7LH","schema_version":"1.0","canonical_sha256":"2265e37d67ef76c0c28bb23d405754ab10da70a892b2674bf64dc1a1e4bb33cf","source":{"kind":"arxiv","id":"1701.04072","version":1},"attestation_state":"computed","paper":{"title":"Scenario Reduction Revisited: Fundamental Limits and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Daniel Kuhn, Kilian Schindler, Napat Rujeerapaiboon, Wolfram Wiesemann","submitted_at":"2017-01-15T16:40:20Z","abstract_excerpt":"The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, where the new atoms must be chosen from among the existing ones. Using the Wasserstein distance as measure of proximity between distributions, we identify those $n$-point distributions on the unit ball that are least susceptible to scenario reduction, i.e., that have maximum Wasserstein distance to their closest $m$-point distributions for s"},"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":"1701.04072","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-01-15T16:40:20Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"92323b1d19de30d27bee67a506dcb79230d3bcc9b83a89ddd72b8d0f90ab1f2a","abstract_canon_sha256":"2ee145688ccfa19d6962ce244885f4deb7e7f37ec629fac80bf100d29c5b0437"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:47.921768Z","signature_b64":"SNaXxY9HWo6j/KngzZxkozDS11fY6vRPMB7U+LmDOW95CYnjyVsB0fdgkOqJnyftCYcWdVoLRIymkOUc/S1wAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2265e37d67ef76c0c28bb23d405754ab10da70a892b2674bf64dc1a1e4bb33cf","last_reissued_at":"2026-05-18T00:52:47.921260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:47.921260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scenario Reduction Revisited: Fundamental Limits and Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.OC","authors_text":"Daniel Kuhn, Kilian Schindler, Napat Rujeerapaiboon, Wolfram Wiesemann","submitted_at":"2017-01-15T16:40:20Z","abstract_excerpt":"The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, where the new atoms must be chosen from among the existing ones. Using the Wasserstein distance as measure of proximity between distributions, we identify those $n$-point distributions on the unit ball that are least susceptible to scenario reduction, i.e., that have maximum Wasserstein distance to their closest $m$-point distributions for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04072","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":"1701.04072","created_at":"2026-05-18T00:52:47.921350+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.04072v1","created_at":"2026-05-18T00:52:47.921350+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04072","created_at":"2026-05-18T00:52:47.921350+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJS6G7LH553M","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJS6G7LH553MBQUL","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJS6G7LH","created_at":"2026-05-18T12:31:12.930513+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/EJS6G7LH553MBQULWI6UAV2UVM","json":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM.json","graph_json":"https://pith.science/api/pith-number/EJS6G7LH553MBQULWI6UAV2UVM/graph.json","events_json":"https://pith.science/api/pith-number/EJS6G7LH553MBQULWI6UAV2UVM/events.json","paper":"https://pith.science/paper/EJS6G7LH"},"agent_actions":{"view_html":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM","download_json":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM.json","view_paper":"https://pith.science/paper/EJS6G7LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.04072&json=true","fetch_graph":"https://pith.science/api/pith-number/EJS6G7LH553MBQULWI6UAV2UVM/graph.json","fetch_events":"https://pith.science/api/pith-number/EJS6G7LH553MBQULWI6UAV2UVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM/action/storage_attestation","attest_author":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM/action/author_attestation","sign_citation":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM/action/citation_signature","submit_replication":"https://pith.science/pith/EJS6G7LH553MBQULWI6UAV2UVM/action/replication_record"}},"created_at":"2026-05-18T00:52:47.921350+00:00","updated_at":"2026-05-18T00:52:47.921350+00:00"}