{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AK2TIRL4I3XFVS6SYFRU5WUSFZ","short_pith_number":"pith:AK2TIRL4","schema_version":"1.0","canonical_sha256":"02b534457c46ee5acbd2c1634eda922e72bd1080e52c11f4f7aa268b9f79123b","source":{"kind":"arxiv","id":"2409.04653","version":2},"attestation_state":"computed","paper":{"title":"Solving Stochastic Orienteering Problems with Chance Constraints Using a GNN Powered Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Marcos Abel Zuzu\\'arregui, Stefano Carpin","submitted_at":"2024-09-06T23:31:01Z","abstract_excerpt":"Leveraging the power of a graph neural network (GNN) with message passing, we present a Monte Carlo Tree Search (MCTS) method to solve stochastic orienteering problems with chance constraints. While adhering to an assigned travel budget the algorithm seeks to maximize collected reward while incurring stochastic travel costs. In this context, the acceptable probability of exceeding the assigned budget is expressed as a chance constraint. Our MCTS solution is an online and anytime algorithm alternating planning and execution that determines the next vertex to visit by continuously monitoring the"},"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":"2409.04653","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-06T23:31:01Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"53e9de11b2072a04b3976c4f81da707d71e56385048be6496ffc957488dd8b9d","abstract_canon_sha256":"d77a607057dbd64afe62c42b65c37b74b900375db02d346186095afadbaa1f8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:41.542717Z","signature_b64":"I0pp+rj8N9lrNBgfbCVDuT0SV8rMVHNg85RKgbS8kWxJNzWkqdYSZdYOA19AAphSwV0IpNMQ13iDT6vcFhFEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02b534457c46ee5acbd2c1634eda922e72bd1080e52c11f4f7aa268b9f79123b","last_reissued_at":"2026-07-05T11:54:41.542242Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:41.542242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Stochastic Orienteering Problems with Chance Constraints Using a GNN Powered Monte Carlo Tree Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Marcos Abel Zuzu\\'arregui, Stefano Carpin","submitted_at":"2024-09-06T23:31:01Z","abstract_excerpt":"Leveraging the power of a graph neural network (GNN) with message passing, we present a Monte Carlo Tree Search (MCTS) method to solve stochastic orienteering problems with chance constraints. While adhering to an assigned travel budget the algorithm seeks to maximize collected reward while incurring stochastic travel costs. In this context, the acceptable probability of exceeding the assigned budget is expressed as a chance constraint. Our MCTS solution is an online and anytime algorithm alternating planning and execution that determines the next vertex to visit by continuously monitoring the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04653","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/2409.04653/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":"2409.04653","created_at":"2026-07-05T11:54:41.542305+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04653v2","created_at":"2026-07-05T11:54:41.542305+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04653","created_at":"2026-07-05T11:54:41.542305+00:00"},{"alias_kind":"pith_short_12","alias_value":"AK2TIRL4I3XF","created_at":"2026-07-05T11:54:41.542305+00:00"},{"alias_kind":"pith_short_16","alias_value":"AK2TIRL4I3XFVS6S","created_at":"2026-07-05T11:54:41.542305+00:00"},{"alias_kind":"pith_short_8","alias_value":"AK2TIRL4","created_at":"2026-07-05T11:54:41.542305+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18514","citing_title":"N(CO)$^2$: Neural Combinatorial Optimization with Chance Constraints to Solve Stochastic Orienteering","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ","json":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ.json","graph_json":"https://pith.science/api/pith-number/AK2TIRL4I3XFVS6SYFRU5WUSFZ/graph.json","events_json":"https://pith.science/api/pith-number/AK2TIRL4I3XFVS6SYFRU5WUSFZ/events.json","paper":"https://pith.science/paper/AK2TIRL4"},"agent_actions":{"view_html":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ","download_json":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ.json","view_paper":"https://pith.science/paper/AK2TIRL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04653&json=true","fetch_graph":"https://pith.science/api/pith-number/AK2TIRL4I3XFVS6SYFRU5WUSFZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AK2TIRL4I3XFVS6SYFRU5WUSFZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ/action/storage_attestation","attest_author":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ/action/author_attestation","sign_citation":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ/action/citation_signature","submit_replication":"https://pith.science/pith/AK2TIRL4I3XFVS6SYFRU5WUSFZ/action/replication_record"}},"created_at":"2026-07-05T11:54:41.542305+00:00","updated_at":"2026-07-05T11:54:41.542305+00:00"}