{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:L733DNL4FFIDMIMRLTLULKMLOS","short_pith_number":"pith:L733DNL4","canonical_record":{"source":{"id":"1604.08464","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-04-28T15:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"8e0552bc4033973809853be887d10939670a66c8c1511ad9b65d1b1e81f9b2a2","abstract_canon_sha256":"1266fd553e05dcf27600ae9c5be0c8e8b897a4e309c36fceebb3bca1baf5c9b3"},"schema_version":"1.0"},"canonical_sha256":"5ff7b1b57c29503621915cd745a98b7492aa11134f106abaa19f2f19e8ff1067","source":{"kind":"arxiv","id":"1604.08464","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08464","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08464v3","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08464","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"L733DNL4FFID","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L733DNL4FFIDMIMR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L733DNL4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:L733DNL4FFIDMIMRLTLULKMLOS","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08464","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-04-28T15:27:44Z","cross_cats_sorted":[],"title_canon_sha256":"8e0552bc4033973809853be887d10939670a66c8c1511ad9b65d1b1e81f9b2a2","abstract_canon_sha256":"1266fd553e05dcf27600ae9c5be0c8e8b897a4e309c36fceebb3bca1baf5c9b3"},"schema_version":"1.0"},"canonical_sha256":"5ff7b1b57c29503621915cd745a98b7492aa11134f106abaa19f2f19e8ff1067","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.483826Z","signature_b64":"b/U9WyjU7lG7pRFiPIwDxXtrSar3ryHtlBs/ADbxYcHbnM4QmG42X8icuynkvpsgS5QhvE6hf5k7UnYXFptYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ff7b1b57c29503621915cd745a98b7492aa11134f106abaa19f2f19e8ff1067","last_reissued_at":"2026-05-18T00:09:42.483165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.483165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08464","source_version":3,"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:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qReBWK590EHXic6dHT02U/Htg9WMq1eHysTirYx5wEb5WLwDRobcWcP1sb/SDfwOo4edo9OHv62wjqUH+HCtCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:52:21.569894Z"},"content_sha256":"a608afce1cde0b50b5b9ea0f94ea16e08e603aa3f85aee92890d72118a0e5aa2","schema_version":"1.0","event_id":"sha256:a608afce1cde0b50b5b9ea0f94ea16e08e603aa3f85aee92890d72118a0e5aa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:L733DNL4FFIDMIMRLTLULKMLOS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Exact Algorithm for a Fuel-Constrained Autonomous Vehicle Path Planning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Kaarthik Sundar, Saravanan Venkatachalam, Sivakumar Rathinam","submitted_at":"2016-04-28T15:27:44Z","abstract_excerpt":"This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where $m$ vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at the depot, such that each target is visited by at least one vehicle, the vehicles never run out of fuel while traversing their routes, and the total travel cost of all the routes is a minimum. We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08464","kind":"arxiv","version":3},"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:09:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRNO4pSytcRcrJyQfmkf/X8YBIusCHbPdBulxd0ZzcXWPlZGUEueT6MslQaLSwXpCO9AZLn+JV3tphPmX9XNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:52:21.570246Z"},"content_sha256":"63738bdeb58cb9d7ddeb882a7da320b553f1b27d529cc5eedaa7a1eb5ce4ed17","schema_version":"1.0","event_id":"sha256:63738bdeb58cb9d7ddeb882a7da320b553f1b27d529cc5eedaa7a1eb5ce4ed17"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L733DNL4FFIDMIMRLTLULKMLOS/bundle.json","state_url":"https://pith.science/pith/L733DNL4FFIDMIMRLTLULKMLOS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L733DNL4FFIDMIMRLTLULKMLOS/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-06-02T16:52:21Z","links":{"resolver":"https://pith.science/pith/L733DNL4FFIDMIMRLTLULKMLOS","bundle":"https://pith.science/pith/L733DNL4FFIDMIMRLTLULKMLOS/bundle.json","state":"https://pith.science/pith/L733DNL4FFIDMIMRLTLULKMLOS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L733DNL4FFIDMIMRLTLULKMLOS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:L733DNL4FFIDMIMRLTLULKMLOS","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":"1266fd553e05dcf27600ae9c5be0c8e8b897a4e309c36fceebb3bca1baf5c9b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-04-28T15:27:44Z","title_canon_sha256":"8e0552bc4033973809853be887d10939670a66c8c1511ad9b65d1b1e81f9b2a2"},"schema_version":"1.0","source":{"id":"1604.08464","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08464","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08464v3","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08464","created_at":"2026-05-18T00:09:42Z"},{"alias_kind":"pith_short_12","alias_value":"L733DNL4FFID","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"L733DNL4FFIDMIMR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"L733DNL4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:63738bdeb58cb9d7ddeb882a7da320b553f1b27d529cc5eedaa7a1eb5ce4ed17","target":"graph","created_at":"2026-05-18T00:09:42Z","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":"This paper addresses a fuel-constrained, autonomous vehicle path planning problem in the presence of multiple refueling stations. We are given a set of targets, a set of refueling stations, and a depot where $m$ vehicles are stationed. The vehicles are allowed to refuel at any refueling station, and the objective of the problem is to determine a route for each vehicle starting and terminating at the depot, such that each target is visited by at least one vehicle, the vehicles never run out of fuel while traversing their routes, and the total travel cost of all the routes is a minimum. We prese","authors_text":"Kaarthik Sundar, Saravanan Venkatachalam, Sivakumar Rathinam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-04-28T15:27:44Z","title":"An Exact Algorithm for a Fuel-Constrained Autonomous Vehicle Path Planning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08464","kind":"arxiv","version":3},"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:a608afce1cde0b50b5b9ea0f94ea16e08e603aa3f85aee92890d72118a0e5aa2","target":"record","created_at":"2026-05-18T00:09:42Z","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":"1266fd553e05dcf27600ae9c5be0c8e8b897a4e309c36fceebb3bca1baf5c9b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-04-28T15:27:44Z","title_canon_sha256":"8e0552bc4033973809853be887d10939670a66c8c1511ad9b65d1b1e81f9b2a2"},"schema_version":"1.0","source":{"id":"1604.08464","kind":"arxiv","version":3}},"canonical_sha256":"5ff7b1b57c29503621915cd745a98b7492aa11134f106abaa19f2f19e8ff1067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ff7b1b57c29503621915cd745a98b7492aa11134f106abaa19f2f19e8ff1067","first_computed_at":"2026-05-18T00:09:42.483165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:42.483165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b/U9WyjU7lG7pRFiPIwDxXtrSar3ryHtlBs/ADbxYcHbnM4QmG42X8icuynkvpsgS5QhvE6hf5k7UnYXFptYAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:42.483826Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08464","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a608afce1cde0b50b5b9ea0f94ea16e08e603aa3f85aee92890d72118a0e5aa2","sha256:63738bdeb58cb9d7ddeb882a7da320b553f1b27d529cc5eedaa7a1eb5ce4ed17"],"state_sha256":"66b9f2e12d9a8551a4b2cd86e9ffa45efbb81b56dfc5910974ecdc16df7309b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QyzomVLgL+wiPWUBmTuSqUFwnPqR5uWYj+6SnSVbohUMuRYdcV2VVUdU8CgCj03ewwUdG0GVjWlmISgd83qKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:52:21.572155Z","bundle_sha256":"1da1258d689be9c42d472b29b893d5b3de1b156639809354d01a7ea228830efa"}}