{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7XBU4ZSGQSCKTXQUPTH4D77TMA","short_pith_number":"pith:7XBU4ZSG","schema_version":"1.0","canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","source":{"kind":"arxiv","id":"1511.07412","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Route Planning with Nonlinear Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Evdokia Nikolova, Ger Yang","submitted_at":"2015-11-23T20:48:29Z","abstract_excerpt":"We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs to capture a penalty for early arrival. It is known that as nonlinearity arises, the problem becomes NP-hard and little is known about computing optimal solutions when in addition there is no monotonicity guarantee. We show that an approximately optimal non-simple path can be efficiently computed under some natural constraints. In particular, we provide a f"},"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":"1511.07412","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T20:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"98445cc44765d5727f1942c5e6dfc801e4bdb4ca26659a2965cd01755e7b5705","abstract_canon_sha256":"1194b9cb38d41150b43cb7a01d1a0eb1058e4ef0b9fd50f5a271c60c2c4e24fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.471909Z","signature_b64":"CGv47+vfKTUA7XVppNcDNa4SX1MILTzyBFbQHoiK5dOQuh6hQv5bOu8XQA0V0q5uhh4z7FNRvF5pNbja8YJODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","last_reissued_at":"2026-05-18T01:26:11.471348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.471348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Route Planning with Nonlinear Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Evdokia Nikolova, Ger Yang","submitted_at":"2015-11-23T20:48:29Z","abstract_excerpt":"We consider optimal route planning when the objective function is a general nonlinear and non-monotonic function. Such an objective models user behavior more accurately, for example, when a user is risk-averse, or the utility function needs to capture a penalty for early arrival. It is known that as nonlinearity arises, the problem becomes NP-hard and little is known about computing optimal solutions when in addition there is no monotonicity guarantee. We show that an approximately optimal non-simple path can be efficiently computed under some natural constraints. In particular, we provide a f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07412","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":"1511.07412","created_at":"2026-05-18T01:26:11.471439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07412v1","created_at":"2026-05-18T01:26:11.471439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07412","created_at":"2026-05-18T01:26:11.471439+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XBU4ZSGQSCK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XBU4ZSGQSCKTXQU","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XBU4ZSG","created_at":"2026-05-18T12:29:10.953037+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/7XBU4ZSGQSCKTXQUPTH4D77TMA","json":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA.json","graph_json":"https://pith.science/api/pith-number/7XBU4ZSGQSCKTXQUPTH4D77TMA/graph.json","events_json":"https://pith.science/api/pith-number/7XBU4ZSGQSCKTXQUPTH4D77TMA/events.json","paper":"https://pith.science/paper/7XBU4ZSG"},"agent_actions":{"view_html":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA","download_json":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA.json","view_paper":"https://pith.science/paper/7XBU4ZSG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07412&json=true","fetch_graph":"https://pith.science/api/pith-number/7XBU4ZSGQSCKTXQUPTH4D77TMA/graph.json","fetch_events":"https://pith.science/api/pith-number/7XBU4ZSGQSCKTXQUPTH4D77TMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/action/storage_attestation","attest_author":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/action/author_attestation","sign_citation":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/action/citation_signature","submit_replication":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/action/replication_record"}},"created_at":"2026-05-18T01:26:11.471439+00:00","updated_at":"2026-05-18T01:26:11.471439+00:00"}