{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:A6O6FCDNLVWJTTC6B7MU4N3PI4","short_pith_number":"pith:A6O6FCDN","schema_version":"1.0","canonical_sha256":"079de2886d5d6c99cc5e0fd94e376f4735c304e4b1c40d5f388b9ce9dc05cbf1","source":{"kind":"arxiv","id":"1701.00090","version":3},"attestation_state":"computed","paper":{"title":"Two-stage robust optimization for orienteering problem with stochastic weights","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felix T.S. Chan, Kenji Terada, Ke Shang, Liangjun Ke, Stephen Karungaru, Zuren Feng","submitted_at":"2016-12-31T11:25:25Z","abstract_excerpt":"In this paper, the two-stage orienteering problem with stochastic weights (OPSW) is considered, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem is recourse action to make sure that the length constraint is satisfied after the uncertainty is realized. Two recourse models are introduced based on two different uncertainty realization ways, one is based on sequentially realized weights which leads to the recourse model proposed by Evers et al. (2014) and the other is based on concurrently realized weights which leads to a new recourse mo"},"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.00090","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-12-31T11:25:25Z","cross_cats_sorted":[],"title_canon_sha256":"164e597335d0d8fd46c8e82c9d2c17d5a2213a2755f5248d55859a9ddb755396","abstract_canon_sha256":"b4c67455acae4040526752c7f17cb2358c09c304c95617fbe6a55e4752270870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:26.175822Z","signature_b64":"1LCX2e70ZOzKerDPj3m6sSIsDjN1uyKX/7BtU2HSwV4Y6JiHbauSs+5E4MrqTRQap868+OiapdHlHlCwwEXwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"079de2886d5d6c99cc5e0fd94e376f4735c304e4b1c40d5f388b9ce9dc05cbf1","last_reissued_at":"2026-05-18T00:46:26.175212Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:26.175212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-stage robust optimization for orienteering problem with stochastic weights","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Felix T.S. Chan, Kenji Terada, Ke Shang, Liangjun Ke, Stephen Karungaru, Zuren Feng","submitted_at":"2016-12-31T11:25:25Z","abstract_excerpt":"In this paper, the two-stage orienteering problem with stochastic weights (OPSW) is considered, where the first-stage problem is to plan a path under the uncertain environment and the second-stage problem is recourse action to make sure that the length constraint is satisfied after the uncertainty is realized. Two recourse models are introduced based on two different uncertainty realization ways, one is based on sequentially realized weights which leads to the recourse model proposed by Evers et al. (2014) and the other is based on concurrently realized weights which leads to a new recourse mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00090","kind":"arxiv","version":3},"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.00090","created_at":"2026-05-18T00:46:26.175305+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00090v3","created_at":"2026-05-18T00:46:26.175305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00090","created_at":"2026-05-18T00:46:26.175305+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6O6FCDNLVWJ","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6O6FCDNLVWJTTC6","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6O6FCDN","created_at":"2026-05-18T12:30:04.600751+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/A6O6FCDNLVWJTTC6B7MU4N3PI4","json":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4.json","graph_json":"https://pith.science/api/pith-number/A6O6FCDNLVWJTTC6B7MU4N3PI4/graph.json","events_json":"https://pith.science/api/pith-number/A6O6FCDNLVWJTTC6B7MU4N3PI4/events.json","paper":"https://pith.science/paper/A6O6FCDN"},"agent_actions":{"view_html":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4","download_json":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4.json","view_paper":"https://pith.science/paper/A6O6FCDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00090&json=true","fetch_graph":"https://pith.science/api/pith-number/A6O6FCDNLVWJTTC6B7MU4N3PI4/graph.json","fetch_events":"https://pith.science/api/pith-number/A6O6FCDNLVWJTTC6B7MU4N3PI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4/action/storage_attestation","attest_author":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4/action/author_attestation","sign_citation":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4/action/citation_signature","submit_replication":"https://pith.science/pith/A6O6FCDNLVWJTTC6B7MU4N3PI4/action/replication_record"}},"created_at":"2026-05-18T00:46:26.175305+00:00","updated_at":"2026-05-18T00:46:26.175305+00:00"}