{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6XS5K3RIKRRIILDW6SJOSIG4S3","short_pith_number":"pith:6XS5K3RI","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"},"canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","source":{"kind":"arxiv","id":"1704.05303","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05303","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05303v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05303","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"6XS5K3RIKRRI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XS5K3RIKRRIILDW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XS5K3RI","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6XS5K3RIKRRIILDW6SJOSIG4S3","target":"record","payload":{"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"},"canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","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"},"source_kind":"arxiv","source_id":"1704.05303","source_version":2,"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-05-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oo8LbcbZG8KeEV7Gxf7J5Dm6oBxbX4q+mU+2++oUaIZCI9/GjD/r0ILj8D3k25q3XjMA+vnoRlvJ6aJ2ACXjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:47.558069Z"},"content_sha256":"545ef76d703dd24fe354ddf266873daa2e222ff000b297dbee233e24933979f8","schema_version":"1.0","event_id":"sha256:545ef76d703dd24fe354ddf266873daa2e222ff000b297dbee233e24933979f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6XS5K3RIKRRIILDW6SJOSIG4S3","target":"graph","payload":{"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"},"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-05-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iUe6huMIOz/62A3HVsHzhYMcNtJZ69HjL4T9ERuQ6GgSswMuVe1IdBbsxRQpaPylXXdKdE17a3oBjxa6+oVjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:50:47.558443Z"},"content_sha256":"9c0f3834a8cbc49f60d76b42280c7f58927f828f9fc65c9350160f57ddba7292","schema_version":"1.0","event_id":"sha256:9c0f3834a8cbc49f60d76b42280c7f58927f828f9fc65c9350160f57ddba7292"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/bundle.json","state_url":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/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-05-27T11:50:47Z","links":{"resolver":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3","bundle":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/bundle.json","state":"https://pith.science/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XS5K3RIKRRIILDW6SJOSIG4S3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6XS5K3RIKRRIILDW6SJOSIG4S3","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":"08fb30322909af16e1bf8c76df294dc48f9bc1e331f39be80cdc550fae269107","cross_cats_sorted":["cs.CC","cs.DS","cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-18T12:32:19Z","title_canon_sha256":"afdca1031a3d235bd3929fd7f58ec4cb8c512cc42f3a212579ca5f6a5dc1398d"},"schema_version":"1.0","source":{"id":"1704.05303","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05303","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05303v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05303","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"6XS5K3RIKRRI","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6XS5K3RIKRRIILDW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6XS5K3RI","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:9c0f3834a8cbc49f60d76b42280c7f58927f828f9fc65c9350160f57ddba7292","target":"graph","created_at":"2026-05-18T00:40:13Z","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"},"paper":{"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","authors_text":"Ivan Gavran, Rayna Dimitrova, Rupak Majumdar, Sadegh Esmaeil Zadeh Soudjani, Vinayak S. Prabhu","cross_cats":["cs.CC","cs.DS","cs.GT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-18T12:32:19Z","title":"The Robot Routing Problem for Collecting Aggregate Stochastic Rewards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05303","kind":"arxiv","version":2},"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:545ef76d703dd24fe354ddf266873daa2e222ff000b297dbee233e24933979f8","target":"record","created_at":"2026-05-18T00:40:13Z","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":"08fb30322909af16e1bf8c76df294dc48f9bc1e331f39be80cdc550fae269107","cross_cats_sorted":["cs.CC","cs.DS","cs.GT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-04-18T12:32:19Z","title_canon_sha256":"afdca1031a3d235bd3929fd7f58ec4cb8c512cc42f3a212579ca5f6a5dc1398d"},"schema_version":"1.0","source":{"id":"1704.05303","kind":"arxiv","version":2}},"canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e5d56e285462842c76f492e920dc96ce25701702870b1fac56c3fc05d725c0","first_computed_at":"2026-05-18T00:40:13.071645Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:13.071645Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MxBlE55+6id/G/HWXlyOeEjaRvTEoaHlhraqpZNj0qpGGFix/zk79RLjVI1CEiWf2iOrvsRmqTbxue8jLPlRCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:13.072214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05303","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:545ef76d703dd24fe354ddf266873daa2e222ff000b297dbee233e24933979f8","sha256:9c0f3834a8cbc49f60d76b42280c7f58927f828f9fc65c9350160f57ddba7292"],"state_sha256":"b92964bef9502278cbea1465e219c1d0611312642df62f9de09052a2c1938069"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HnZ8gE1EHD6SiJXZ5OzdXcYr+dBZHV57mJ/IV7fNPwQ60TQbit2u5NGEuk9ywKkVXS6IZH0OEdXOeiTYpb/ZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:50:47.560789Z","bundle_sha256":"43537cf7e0160c558367c710d43f969539efaf5f1ad4290106d6285bb652eacc"}}