{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TAKKDXYPA7TW7F4VD7N2KCDCYP","short_pith_number":"pith:TAKKDXYP","schema_version":"1.0","canonical_sha256":"9814a1df0f07e76f97951fdba50862c3de6961a5012df500527f8301a6ef1bea","source":{"kind":"arxiv","id":"1401.6478","version":1},"attestation_state":"computed","paper":{"title":"Energy-aware Vehicle Routing in Networks with Charging Nodes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Sepideh Pourazarm, Tao Wang","submitted_at":"2014-01-25T00:12:05Z","abstract_excerpt":"We study the problem of routing vehicles with energy constraints through a network where there are at least some charging nodes. We seek to minimize the total elapsed time for vehicles to reach their destinations by determining routes as well as recharging amounts when the vehicles do not have adequate energy for the entire journey. For a single vehicle, we formulate a mixed-integer nonlinear programming (MINLP) problem and derive properties of the optimal solution allowing it to be decomposed into two simpler problems. For a multi-vehicle problem, where traffic congestion effects are included"},"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":"1401.6478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-01-25T00:12:05Z","cross_cats_sorted":[],"title_canon_sha256":"39c10487b2df139e5846f8cc54458a43377786555bf48611e3a35da1ac839e5c","abstract_canon_sha256":"ca3ffe49d22fb4ff7f671d6ea836334cdbfbec3f745940e41f56bf7f28f43b8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:01.696268Z","signature_b64":"w7rWCi14n4IcBAoPfW5WBfTmxIZKMkGqM+0uE94vaFFZ0yyypbbX4+J6Ls0HBkM/MYeXbdHIH3DvAtSoSf4kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9814a1df0f07e76f97951fdba50862c3de6961a5012df500527f8301a6ef1bea","last_reissued_at":"2026-05-18T03:01:01.695469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:01.695469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-aware Vehicle Routing in Networks with Charging Nodes","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Sepideh Pourazarm, Tao Wang","submitted_at":"2014-01-25T00:12:05Z","abstract_excerpt":"We study the problem of routing vehicles with energy constraints through a network where there are at least some charging nodes. We seek to minimize the total elapsed time for vehicles to reach their destinations by determining routes as well as recharging amounts when the vehicles do not have adequate energy for the entire journey. For a single vehicle, we formulate a mixed-integer nonlinear programming (MINLP) problem and derive properties of the optimal solution allowing it to be decomposed into two simpler problems. For a multi-vehicle problem, where traffic congestion effects are included"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6478","kind":"arxiv","version":1},"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":"1401.6478","created_at":"2026-05-18T03:01:01.695613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6478v1","created_at":"2026-05-18T03:01:01.695613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6478","created_at":"2026-05-18T03:01:01.695613+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAKKDXYPA7TW","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAKKDXYPA7TW7F4V","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAKKDXYP","created_at":"2026-05-18T12:28:49.207871+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/TAKKDXYPA7TW7F4VD7N2KCDCYP","json":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP.json","graph_json":"https://pith.science/api/pith-number/TAKKDXYPA7TW7F4VD7N2KCDCYP/graph.json","events_json":"https://pith.science/api/pith-number/TAKKDXYPA7TW7F4VD7N2KCDCYP/events.json","paper":"https://pith.science/paper/TAKKDXYP"},"agent_actions":{"view_html":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP","download_json":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP.json","view_paper":"https://pith.science/paper/TAKKDXYP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6478&json=true","fetch_graph":"https://pith.science/api/pith-number/TAKKDXYPA7TW7F4VD7N2KCDCYP/graph.json","fetch_events":"https://pith.science/api/pith-number/TAKKDXYPA7TW7F4VD7N2KCDCYP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP/action/storage_attestation","attest_author":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP/action/author_attestation","sign_citation":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP/action/citation_signature","submit_replication":"https://pith.science/pith/TAKKDXYPA7TW7F4VD7N2KCDCYP/action/replication_record"}},"created_at":"2026-05-18T03:01:01.695613+00:00","updated_at":"2026-05-18T03:01:01.695613+00:00"}