{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MEUNIJRARSHWTQLIGXJUCRZ4JL","short_pith_number":"pith:MEUNIJRA","canonical_record":{"source":{"id":"1311.3623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T19:38:00Z","cross_cats_sorted":[],"title_canon_sha256":"011ac0869a34e628db7f36baaf27154654775bb8d8dba77bd2b1e596d5d67d45","abstract_canon_sha256":"0360f7debdfecd2c3f04775dcd95c911087932d24cf0383a48a95657f6236722"},"schema_version":"1.0"},"canonical_sha256":"6128d426208c8f69c16835d341473c4aebc0c56eb454dc380b25a5a2bfdcdcae","source":{"kind":"arxiv","id":"1311.3623","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3623","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3623v2","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3623","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"MEUNIJRARSHW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MEUNIJRARSHWTQLI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MEUNIJRA","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MEUNIJRARSHWTQLIGXJUCRZ4JL","target":"record","payload":{"canonical_record":{"source":{"id":"1311.3623","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T19:38:00Z","cross_cats_sorted":[],"title_canon_sha256":"011ac0869a34e628db7f36baaf27154654775bb8d8dba77bd2b1e596d5d67d45","abstract_canon_sha256":"0360f7debdfecd2c3f04775dcd95c911087932d24cf0383a48a95657f6236722"},"schema_version":"1.0"},"canonical_sha256":"6128d426208c8f69c16835d341473c4aebc0c56eb454dc380b25a5a2bfdcdcae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:14.226931Z","signature_b64":"iaIJCJZxeiv44HlJFpZ3NubZ7aLbNBr9hCmJ3TtyK8hrCz9UdgCLsNGCr1HgW/s9FYtUL99zV7UBApFFFghyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6128d426208c8f69c16835d341473c4aebc0c56eb454dc380b25a5a2bfdcdcae","last_reissued_at":"2026-05-18T02:52:14.226222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:14.226222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.3623","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-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAN4XpvLLUABnpY1vjeECC2D4HfHf/OEyWkNWDbnLa3cvR8VYLSPq1po6p7mub0sgrqeTgDkMqoJFGaZbzzOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:23.301516Z"},"content_sha256":"7d868cee2abdd0196fe5b2c334c79d1aa7766ab30700ac6439eb4d7ede90dad5","schema_version":"1.0","event_id":"sha256:7d868cee2abdd0196fe5b2c334c79d1aa7766ab30700ac6439eb4d7ede90dad5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MEUNIJRARSHWTQLIGXJUCRZ4JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Adaptivity Gap of Stochastic Orienteering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikhil Bansal, Viswanath Nagarajan","submitted_at":"2013-11-14T19:38:00Z","abstract_excerpt":"The input to the stochastic orienteering problem consists of a budget $B$ and metric $(V,d)$ where each vertex $v$ has a job with deterministic reward and random processing time (drawn from a known distribution). The processing times are independent across vertices. The goal is to obtain a non-anticipatory policy to run jobs at different vertices, that maximizes expected reward, subject to the total distance traveled plus processing times being at most $B$. An adaptive policy is one that can choose the next vertex to visit based on observed random instantiations. Whereas, a non-adaptive policy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3623","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-18T02:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y0GUlAYbkq6vYxfQEk4yKI1ygjiFHGp+AJvv7L7THUVmX+TdHpfYGOE7Rr29Ug7k7v/E99w2a2d+S2wxEA/+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:46:23.302140Z"},"content_sha256":"641991fdc61e449461e57617623df6ab3ea2bd0efcbb6138d39e75e6add4cee8","schema_version":"1.0","event_id":"sha256:641991fdc61e449461e57617623df6ab3ea2bd0efcbb6138d39e75e6add4cee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/bundle.json","state_url":"https://pith.science/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/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-30T22:46:23Z","links":{"resolver":"https://pith.science/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL","bundle":"https://pith.science/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/bundle.json","state":"https://pith.science/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MEUNIJRARSHWTQLIGXJUCRZ4JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MEUNIJRARSHWTQLIGXJUCRZ4JL","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":"0360f7debdfecd2c3f04775dcd95c911087932d24cf0383a48a95657f6236722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T19:38:00Z","title_canon_sha256":"011ac0869a34e628db7f36baaf27154654775bb8d8dba77bd2b1e596d5d67d45"},"schema_version":"1.0","source":{"id":"1311.3623","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.3623","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1311.3623v2","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3623","created_at":"2026-05-18T02:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"MEUNIJRARSHW","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MEUNIJRARSHWTQLI","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MEUNIJRA","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:641991fdc61e449461e57617623df6ab3ea2bd0efcbb6138d39e75e6add4cee8","target":"graph","created_at":"2026-05-18T02:52:14Z","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":"The input to the stochastic orienteering problem consists of a budget $B$ and metric $(V,d)$ where each vertex $v$ has a job with deterministic reward and random processing time (drawn from a known distribution). The processing times are independent across vertices. The goal is to obtain a non-anticipatory policy to run jobs at different vertices, that maximizes expected reward, subject to the total distance traveled plus processing times being at most $B$. An adaptive policy is one that can choose the next vertex to visit based on observed random instantiations. Whereas, a non-adaptive policy","authors_text":"Nikhil Bansal, Viswanath Nagarajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T19:38:00Z","title":"On the Adaptivity Gap of Stochastic Orienteering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3623","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:7d868cee2abdd0196fe5b2c334c79d1aa7766ab30700ac6439eb4d7ede90dad5","target":"record","created_at":"2026-05-18T02:52:14Z","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":"0360f7debdfecd2c3f04775dcd95c911087932d24cf0383a48a95657f6236722","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-14T19:38:00Z","title_canon_sha256":"011ac0869a34e628db7f36baaf27154654775bb8d8dba77bd2b1e596d5d67d45"},"schema_version":"1.0","source":{"id":"1311.3623","kind":"arxiv","version":2}},"canonical_sha256":"6128d426208c8f69c16835d341473c4aebc0c56eb454dc380b25a5a2bfdcdcae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6128d426208c8f69c16835d341473c4aebc0c56eb454dc380b25a5a2bfdcdcae","first_computed_at":"2026-05-18T02:52:14.226222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:14.226222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iaIJCJZxeiv44HlJFpZ3NubZ7aLbNBr9hCmJ3TtyK8hrCz9UdgCLsNGCr1HgW/s9FYtUL99zV7UBApFFFghyAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:14.226931Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.3623","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d868cee2abdd0196fe5b2c334c79d1aa7766ab30700ac6439eb4d7ede90dad5","sha256:641991fdc61e449461e57617623df6ab3ea2bd0efcbb6138d39e75e6add4cee8"],"state_sha256":"ef965f145cbe6a17870f9ade594afac3899dc6e9e6154d1028ad579a941025d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2BDre5M2LOmj8xzJKf8r95hb2PFZYjou9FstPjMax6EoD6TdGIrwuufY+QkyJ8/IS0EuFBFKLiB9lFWzGL+xBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:46:23.305380Z","bundle_sha256":"76073cfa8757904ab82af748499f0857144140734c66dc03999e7e26b9e9551b"}}