{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:JSCO4WBF56556UA5K6DZATSXCW","short_pith_number":"pith:JSCO4WBF","canonical_record":{"source":{"id":"2009.10894","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-23T01:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"67c9393cc55caddd2db50899216fac3126ec38db5640c1b04b6f6ead3df1a845","abstract_canon_sha256":"6feea1501b387b694e837fc2e7a590a80dc07ef1ef7154928e5c581a8c2fdb46"},"schema_version":"1.0"},"canonical_sha256":"4c84ee5825efbbdf501d5787904e5715b9000123d8e57ba320f1ea97285a0da7","source":{"kind":"arxiv","id":"2009.10894","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10894","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10894v5","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10894","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"JSCO4WBF5655","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_16","alias_value":"JSCO4WBF56556UA5","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_8","alias_value":"JSCO4WBF","created_at":"2026-07-05T03:58:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:JSCO4WBF56556UA5K6DZATSXCW","target":"record","payload":{"canonical_record":{"source":{"id":"2009.10894","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-23T01:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"67c9393cc55caddd2db50899216fac3126ec38db5640c1b04b6f6ead3df1a845","abstract_canon_sha256":"6feea1501b387b694e837fc2e7a590a80dc07ef1ef7154928e5c581a8c2fdb46"},"schema_version":"1.0"},"canonical_sha256":"4c84ee5825efbbdf501d5787904e5715b9000123d8e57ba320f1ea97285a0da7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:58:44.984125Z","signature_b64":"7dLr8745aAzw9DJktQavzBTQZRMkWa2qnjpoOXBrcZHsEYNGjp2Lo0+3tU/QwUDlpT+Tu/mW1eyDm5VGb7fSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c84ee5825efbbdf501d5787904e5715b9000123d8e57ba320f1ea97285a0da7","last_reissued_at":"2026-07-05T03:58:44.983710Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:58:44.983710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.10894","source_version":5,"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-07-05T03:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2AIghq9wAK1j0ifp44+21ZHEWq56QqF5oVdJeWySgnRo4bspFN4wX3lFQr/EO+yZNTkkR1WtePVJUzKkY6mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:07:52.791962Z"},"content_sha256":"5a6cb7027f4cea92c83e9965e30bcaa9ab1b2e09cc1a6a8eaaaeed7e5a0ccf85","schema_version":"1.0","event_id":"sha256:5a6cb7027f4cea92c83e9965e30bcaa9ab1b2e09cc1a6a8eaaaeed7e5a0ccf85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:JSCO4WBF56556UA5K6DZATSXCW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributionally Robust Optimization Approaches for a Stochastic Mobile Facility Fleet Sizing, Routing, and Scheduling Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Karmel S. Shehadeh","submitted_at":"2020-09-23T01:51:55Z","abstract_excerpt":"We propose two distributionally robust optimization (DRO) models for a mobile facility (MF) fleet sizing, routing, and scheduling problem (MFRSP) with time-dependent and random demand, as well as methodologies for solving these models. Specifically, given a set of MFs, a planning horizon, and a service region, our models aim to find the number of MFs to use (i.e., fleet size) within the planning horizon and a route and schedule for each MF in the fleet. The objective is to minimize the fixed cost of establishing the MF fleet plus a risk measure (expectation or mean conditional value-at-risk) o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10894","kind":"arxiv","version":5},"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/2009.10894/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"},"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-07-05T03:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CSGt8Dsr256w6VaVSWuUwj7eZPXERSE98yyvOtZxm6efNECgamPJyk67eY8r8HeQ8tsDyKpa/8Zz5wJXazNoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:07:52.792359Z"},"content_sha256":"5cab37f9f3b3f077ba0d17747bb971b06436d48ba567828d6dae8e970171bc29","schema_version":"1.0","event_id":"sha256:5cab37f9f3b3f077ba0d17747bb971b06436d48ba567828d6dae8e970171bc29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSCO4WBF56556UA5K6DZATSXCW/bundle.json","state_url":"https://pith.science/pith/JSCO4WBF56556UA5K6DZATSXCW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSCO4WBF56556UA5K6DZATSXCW/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-07-07T05:07:52Z","links":{"resolver":"https://pith.science/pith/JSCO4WBF56556UA5K6DZATSXCW","bundle":"https://pith.science/pith/JSCO4WBF56556UA5K6DZATSXCW/bundle.json","state":"https://pith.science/pith/JSCO4WBF56556UA5K6DZATSXCW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSCO4WBF56556UA5K6DZATSXCW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JSCO4WBF56556UA5K6DZATSXCW","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":"6feea1501b387b694e837fc2e7a590a80dc07ef1ef7154928e5c581a8c2fdb46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-23T01:51:55Z","title_canon_sha256":"67c9393cc55caddd2db50899216fac3126ec38db5640c1b04b6f6ead3df1a845"},"schema_version":"1.0","source":{"id":"2009.10894","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.10894","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"2009.10894v5","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10894","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"JSCO4WBF5655","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_16","alias_value":"JSCO4WBF56556UA5","created_at":"2026-07-05T03:58:44Z"},{"alias_kind":"pith_short_8","alias_value":"JSCO4WBF","created_at":"2026-07-05T03:58:44Z"}],"graph_snapshots":[{"event_id":"sha256:5cab37f9f3b3f077ba0d17747bb971b06436d48ba567828d6dae8e970171bc29","target":"graph","created_at":"2026-07-05T03:58:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.10894/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose two distributionally robust optimization (DRO) models for a mobile facility (MF) fleet sizing, routing, and scheduling problem (MFRSP) with time-dependent and random demand, as well as methodologies for solving these models. Specifically, given a set of MFs, a planning horizon, and a service region, our models aim to find the number of MFs to use (i.e., fleet size) within the planning horizon and a route and schedule for each MF in the fleet. The objective is to minimize the fixed cost of establishing the MF fleet plus a risk measure (expectation or mean conditional value-at-risk) o","authors_text":"Karmel S. Shehadeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-23T01:51:55Z","title":"Distributionally Robust Optimization Approaches for a Stochastic Mobile Facility Fleet Sizing, Routing, and Scheduling Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10894","kind":"arxiv","version":5},"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:5a6cb7027f4cea92c83e9965e30bcaa9ab1b2e09cc1a6a8eaaaeed7e5a0ccf85","target":"record","created_at":"2026-07-05T03:58:44Z","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":"6feea1501b387b694e837fc2e7a590a80dc07ef1ef7154928e5c581a8c2fdb46","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-09-23T01:51:55Z","title_canon_sha256":"67c9393cc55caddd2db50899216fac3126ec38db5640c1b04b6f6ead3df1a845"},"schema_version":"1.0","source":{"id":"2009.10894","kind":"arxiv","version":5}},"canonical_sha256":"4c84ee5825efbbdf501d5787904e5715b9000123d8e57ba320f1ea97285a0da7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c84ee5825efbbdf501d5787904e5715b9000123d8e57ba320f1ea97285a0da7","first_computed_at":"2026-07-05T03:58:44.983710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:58:44.983710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dLr8745aAzw9DJktQavzBTQZRMkWa2qnjpoOXBrcZHsEYNGjp2Lo0+3tU/QwUDlpT+Tu/mW1eyDm5VGb7fSAg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:58:44.984125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.10894","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5a6cb7027f4cea92c83e9965e30bcaa9ab1b2e09cc1a6a8eaaaeed7e5a0ccf85","sha256:5cab37f9f3b3f077ba0d17747bb971b06436d48ba567828d6dae8e970171bc29"],"state_sha256":"ea673a63cf1c25439092e65871e47d7985d893769b8eb4526009b318239dcf40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7GseDn9aCkC9o6yCIXdhF8G4VfCyG21AZwmk+RU0VGv+4Z2vxHDpbHGG8cVBStF9lrdRHBPrYTFG3FJwi3oBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:07:52.794577Z","bundle_sha256":"44cdedbf7bea56544f76f621dad0c0863c5ab1b4af05e7056aecfa35a4a8d779"}}