{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZB2MVV52TJ4XDKK7LAY4CHK3GY","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":"98fd601f6febea3f39e056e94163d457047561026cf511bb2cdb6eb3dc82996c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T08:09:28Z","title_canon_sha256":"4ddb3a3c3757705b34306696f3d1a17d5c9caca0b9f4a64219dde9e2a0423057"},"schema_version":"1.0","source":{"id":"1706.00195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.00195","created_at":"2026-05-18T00:43:14Z"},{"alias_kind":"arxiv_version","alias_value":"1706.00195v1","created_at":"2026-05-18T00:43:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.00195","created_at":"2026-05-18T00:43:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZB2MVV52TJ4X","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZB2MVV52TJ4XDKK7","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZB2MVV52","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:ae116c4260e781541b2480e9292527a6c92cab4a494739fe33fcaa8208867901","target":"graph","created_at":"2026-05-18T00:43: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":"In the gas station problem we want to find the cheapest path between two vertices of an $n$-vertex graph. Our car has a specific fuel capacity and at each vertex we can fill our car with gas, with the fuel cost depending on the vertex. Furthermore, we are allowed at most $\\Delta$ stops for refuelling.\n  In this short paper we provide an algorithm solving the problem in $O(\\Delta n^2 + n^2\\log{n})$ steps improving an earlier result by Khuller, Malekian and Mestre.","authors_text":"Demetres Christofides, Kleitos Papadopoulos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T08:09:28Z","title":"A fast algorithm for the gas station problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.00195","kind":"arxiv","version":1},"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:b6e139d35c0f7f0cbdcf17fe68b1f4ecadf935d8f862a90edb4c058ef80c9ab7","target":"record","created_at":"2026-05-18T00:43: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":"98fd601f6febea3f39e056e94163d457047561026cf511bb2cdb6eb3dc82996c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-01T08:09:28Z","title_canon_sha256":"4ddb3a3c3757705b34306696f3d1a17d5c9caca0b9f4a64219dde9e2a0423057"},"schema_version":"1.0","source":{"id":"1706.00195","kind":"arxiv","version":1}},"canonical_sha256":"c874cad7ba9a7971a95f5831c11d5b363df5fe534721b047e049c8d112cd959d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c874cad7ba9a7971a95f5831c11d5b363df5fe534721b047e049c8d112cd959d","first_computed_at":"2026-05-18T00:43:14.785815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:14.785815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RgJUok5+oU0CRJvZMgd9DtCXd3+RTxCgW76yDEL7EhGnpKuNke9JogyHZeDG3qxyfBEvueIxuf7ytIk7bHKGAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:14.786514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.00195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6e139d35c0f7f0cbdcf17fe68b1f4ecadf935d8f862a90edb4c058ef80c9ab7","sha256:ae116c4260e781541b2480e9292527a6c92cab4a494739fe33fcaa8208867901"],"state_sha256":"f9c7275e1bcf905232a99233a62b7516c75931aa93f430e1a3d6246ab4dab4c4"}