{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:54ZNB4I3KTPGOWLV7DRKKEIY34","short_pith_number":"pith:54ZNB4I3","schema_version":"1.0","canonical_sha256":"ef32d0f11b54de675975f8e2a51118df1e3c799255b7392d9163a3bac651ee7b","source":{"kind":"arxiv","id":"2105.11005","version":2},"attestation_state":"computed","paper":{"title":"On the Value of Multistage Risk-Averse Stochastic Facility Location With or Without Prioritization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Siqian Shen, Xian Yu","submitted_at":"2021-05-23T19:34:29Z","abstract_excerpt":"We consider a multiperiod stochastic capacitated facility location problem under uncertain demand and budget in each period. Using a scenario tree representation of the uncertainties, we formulate a multistage stochastic integer program to dynamically locate facilities in each period and compare it with a two-stage approach that determines the facility locations up front. In the multistage model, in each stage, a decision maker optimizes facility locations and recourse flows from open facilities to demand sites, to minimize certain risk measures of the cost associated with current facility loc"},"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":"2105.11005","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-05-23T19:34:29Z","cross_cats_sorted":[],"title_canon_sha256":"1f1b1b3b3ace5b6202030c72dbcb742f7dec72af026cdd40d45a5d9ce58934de","abstract_canon_sha256":"93a55283b0452cc3d1c093702435148833fb9c975da7a9e8f9008eddd053c247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:45.081053Z","signature_b64":"PG3mTKtUMDXLGZWFtBAml9F72P2FlNnHnEGB1mz5XPMTJTZfV7WBCD9UFzjNHKLpPgNHLSZ5/HiCB8qxukD9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef32d0f11b54de675975f8e2a51118df1e3c799255b7392d9163a3bac651ee7b","last_reissued_at":"2026-07-05T04:40:45.080641Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:45.080641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Value of Multistage Risk-Averse Stochastic Facility Location With or Without Prioritization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Siqian Shen, Xian Yu","submitted_at":"2021-05-23T19:34:29Z","abstract_excerpt":"We consider a multiperiod stochastic capacitated facility location problem under uncertain demand and budget in each period. Using a scenario tree representation of the uncertainties, we formulate a multistage stochastic integer program to dynamically locate facilities in each period and compare it with a two-stage approach that determines the facility locations up front. In the multistage model, in each stage, a decision maker optimizes facility locations and recourse flows from open facilities to demand sites, to minimize certain risk measures of the cost associated with current facility loc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.11005","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/2105.11005/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":"2105.11005","created_at":"2026-07-05T04:40:45.080697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.11005v2","created_at":"2026-07-05T04:40:45.080697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.11005","created_at":"2026-07-05T04:40:45.080697+00:00"},{"alias_kind":"pith_short_12","alias_value":"54ZNB4I3KTPG","created_at":"2026-07-05T04:40:45.080697+00:00"},{"alias_kind":"pith_short_16","alias_value":"54ZNB4I3KTPGOWLV","created_at":"2026-07-05T04:40:45.080697+00:00"},{"alias_kind":"pith_short_8","alias_value":"54ZNB4I3","created_at":"2026-07-05T04:40:45.080697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01524","citing_title":"Flexible and Reliable Network Design for Emerging Transportation Services: Multi-stage Stochastic Programming Approach","ref_index":69,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34","json":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34.json","graph_json":"https://pith.science/api/pith-number/54ZNB4I3KTPGOWLV7DRKKEIY34/graph.json","events_json":"https://pith.science/api/pith-number/54ZNB4I3KTPGOWLV7DRKKEIY34/events.json","paper":"https://pith.science/paper/54ZNB4I3"},"agent_actions":{"view_html":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34","download_json":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34.json","view_paper":"https://pith.science/paper/54ZNB4I3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.11005&json=true","fetch_graph":"https://pith.science/api/pith-number/54ZNB4I3KTPGOWLV7DRKKEIY34/graph.json","fetch_events":"https://pith.science/api/pith-number/54ZNB4I3KTPGOWLV7DRKKEIY34/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34/action/storage_attestation","attest_author":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34/action/author_attestation","sign_citation":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34/action/citation_signature","submit_replication":"https://pith.science/pith/54ZNB4I3KTPGOWLV7DRKKEIY34/action/replication_record"}},"created_at":"2026-07-05T04:40:45.080697+00:00","updated_at":"2026-07-05T04:40:45.080697+00:00"}