{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6XS5K3RIKRRIILDW6SJOSIG4S3","short_pith_number":"pith:6XS5K3RI","schema_version":"1.0","canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","source":{"kind":"arxiv","id":"1704.05303","version":2},"attestation_state":"computed","paper":{"title":"The Robot Routing Problem for Collecting Aggregate Stochastic Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Ivan Gavran, Rayna Dimitrova, Rupak Majumdar, Sadegh Esmaeil Zadeh Soudjani, Vinayak S. Prabhu","submitted_at":"2017-04-18T12:32:19Z","abstract_excerpt":"We propose a new model for formalizing reward collection problems on graphs with dynamically generated rewards which may appear and disappear based on a stochastic model. The *robot routing problem* is modeled as a graph whose nodes are stochastic processes generating potential rewards over discrete time. The rewards are generated according to the stochastic process, but at each step, an existing reward disappears with a given probability. The edges in the graph encode the (unit-distance) paths between the rewards' locations. On visiting a node, the robot collects the accumulated reward at 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":"1704.05303","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-18T12:32:19Z","cross_cats_sorted":["cs.CC","cs.DS","cs.GT","math.OC"],"title_canon_sha256":"afdca1031a3d235bd3929fd7f58ec4cb8c512cc42f3a212579ca5f6a5dc1398d","abstract_canon_sha256":"08fb30322909af16e1bf8c76df294dc48f9bc1e331f39be80cdc550fae269107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.072214Z","signature_b64":"MxBlE55+6id/G/HWXlyOeEjaRvTEoaHlhraqpZNj0qpGGFix/zk79RLjVI1CEiWf2iOrvsRmqTbxue8jLPlRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","last_reissued_at":"2026-05-18T00:40:13.071645Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.071645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Robot Routing Problem for Collecting Aggregate Stochastic Rewards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Ivan Gavran, Rayna Dimitrova, Rupak Majumdar, Sadegh Esmaeil Zadeh Soudjani, Vinayak S. Prabhu","submitted_at":"2017-04-18T12:32:19Z","abstract_excerpt":"We propose a new model for formalizing reward collection problems on graphs with dynamically generated rewards which may appear and disappear based on a stochastic model. The *robot routing problem* is modeled as a graph whose nodes are stochastic processes generating potential rewards over discrete time. The rewards are generated according to the stochastic process, but at each step, an existing reward disappears with a given probability. The edges in the graph encode the (unit-distance) paths between the rewards' locations. On visiting a node, the robot collects the accumulated reward at the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05303","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":""},"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":"1704.05303","created_at":"2026-05-18T00:40:13.071722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.05303v2","created_at":"2026-05-18T00:40:13.071722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05303","created_at":"2026-05-18T00:40:13.071722+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XS5K3RIKRRI","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XS5K3RIKRRIILDW","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XS5K3RI","created_at":"2026-05-18T12:31:03.183658+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/6XS5K3RIKRRIILDW6SJOSIG4S3","json":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3.json","graph_json":"https://pith.science/api/pith-number/6XS5K3RIKRRIILDW6SJOSIG4S3/graph.json","events_json":"https://pith.science/api/pith-number/6XS5K3RIKRRIILDW6SJOSIG4S3/events.json","paper":"https://pith.science/paper/6XS5K3RI"},"agent_actions":{"view_html":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3","download_json":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3.json","view_paper":"https://pith.science/paper/6XS5K3RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.05303&json=true","fetch_graph":"https://pith.science/api/pith-number/6XS5K3RIKRRIILDW6SJOSIG4S3/graph.json","fetch_events":"https://pith.science/api/pith-number/6XS5K3RIKRRIILDW6SJOSIG4S3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/action/storage_attestation","attest_author":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/action/author_attestation","sign_citation":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/action/citation_signature","submit_replication":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/action/replication_record"}},"created_at":"2026-05-18T00:40:13.071722+00:00","updated_at":"2026-05-18T00:40:13.071722+00:00"}