{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:JN54SWEDSAWTRGIHWPINCDEFZT","short_pith_number":"pith:JN54SWED","schema_version":"1.0","canonical_sha256":"4b7bc95883902d389907b3d0d10c85ccc0939039a5eb47b42ec2777fec549761","source":{"kind":"arxiv","id":"1210.4874","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Stochastic Orienteering Problems for Risk-Aware Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Duc Thien Nguyen, Hoong Chuin LAU, Huaxing Chen, Pradeep Varakantham, William Yeoh","submitted_at":"2012-10-16T17:42:27Z","abstract_excerpt":"Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations travel times between cities are assumed to be time independent and the route provided is independent of the risk preference (with respect to violating the deadline) of the user. To address these issues, we make the follow"},"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":"1210.4874","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:42:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5ad0a1cf4a4accba73a6cabe2a3e3ae5bf8f6b4ff8b7b0b9f2f2aa6fb3c3ee7b","abstract_canon_sha256":"851adf48c9f4c3f37fcd7bb4a72296a3ac42286b8268337ec902b908931d4635"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.270528Z","signature_b64":"WZh+cXUCgb0WBgTyHrqEmPdbwFF2BcT6DOfupqIVHw4PQd6TSd+AgiGO5G6ArvKMVawrRVZszLhdJaVzeejNCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b7bc95883902d389907b3d0d10c85ccc0939039a5eb47b42ec2777fec549761","last_reissued_at":"2026-05-18T03:42:55.269799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.269799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Stochastic Orienteering Problems for Risk-Aware Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.AI","authors_text":"Duc Thien Nguyen, Hoong Chuin LAU, Huaxing Chen, Pradeep Varakantham, William Yeoh","submitted_at":"2012-10-16T17:42:27Z","abstract_excerpt":"Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a given deadline. OPs and their extensions with stochastic travel times (SOPs) have been used to model vehicle routing problems and tourist trip design problems. However, they suffer from two limitations travel times between cities are assumed to be time independent and the route provided is independent of the risk preference (with respect to violating the deadline) of the user. To address these issues, we make the follow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4874","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":"1210.4874","created_at":"2026-05-18T03:42:55.269928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4874v1","created_at":"2026-05-18T03:42:55.269928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4874","created_at":"2026-05-18T03:42:55.269928+00:00"},{"alias_kind":"pith_short_12","alias_value":"JN54SWEDSAWT","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"JN54SWEDSAWTRGIH","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"JN54SWED","created_at":"2026-05-18T12:27:11.947152+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/JN54SWEDSAWTRGIHWPINCDEFZT","json":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT.json","graph_json":"https://pith.science/api/pith-number/JN54SWEDSAWTRGIHWPINCDEFZT/graph.json","events_json":"https://pith.science/api/pith-number/JN54SWEDSAWTRGIHWPINCDEFZT/events.json","paper":"https://pith.science/paper/JN54SWED"},"agent_actions":{"view_html":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT","download_json":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT.json","view_paper":"https://pith.science/paper/JN54SWED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4874&json=true","fetch_graph":"https://pith.science/api/pith-number/JN54SWEDSAWTRGIHWPINCDEFZT/graph.json","fetch_events":"https://pith.science/api/pith-number/JN54SWEDSAWTRGIHWPINCDEFZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT/action/storage_attestation","attest_author":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT/action/author_attestation","sign_citation":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT/action/citation_signature","submit_replication":"https://pith.science/pith/JN54SWEDSAWTRGIHWPINCDEFZT/action/replication_record"}},"created_at":"2026-05-18T03:42:55.269928+00:00","updated_at":"2026-05-18T03:42:55.269928+00:00"}