{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7XBU4ZSGQSCKTXQUPTH4D77TMA","short_pith_number":"pith:7XBU4ZSG","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"},"canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","source":{"kind":"arxiv","id":"1511.07412","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07412","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07412v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07412","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"7XBU4ZSGQSCK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XBU4ZSGQSCKTXQU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XBU4ZSG","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7XBU4ZSGQSCKTXQUPTH4D77TMA","target":"record","payload":{"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"},"canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","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"},"source_kind":"arxiv","source_id":"1511.07412","source_version":1,"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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"67nKCRjtCMOtKJwclH4Lco+4HyCe8DWBsCmFi7GA11J6fWpUBCH2k2EBAhfDG0sBKbHxR/bWhA2X9KylSBP9CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:31:54.202896Z"},"content_sha256":"357f6cf713e15a297b309e1e384c34971bb0e5385d994fca0d38c2b8109dee9b","schema_version":"1.0","event_id":"sha256:357f6cf713e15a297b309e1e384c34971bb0e5385d994fca0d38c2b8109dee9b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7XBU4ZSGQSCKTXQUPTH4D77TMA","target":"graph","payload":{"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"},"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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MAEHVXVM8vB+uxKDLcAPr28tPM7cWuKKL/gvA8IqMP2od71iX21qnk1WtX/4lFJisoyP2YzRePQ/HYsrnMqDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:31:54.203236Z"},"content_sha256":"1f120938f315b2622892d09b42b8a4c529ad7c0d1d9bf933a9da5781931745a5","schema_version":"1.0","event_id":"sha256:1f120938f315b2622892d09b42b8a4c529ad7c0d1d9bf933a9da5781931745a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/bundle.json","state_url":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/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-03T06:31:54Z","links":{"resolver":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA","bundle":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/bundle.json","state":"https://pith.science/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7XBU4ZSGQSCKTXQUPTH4D77TMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7XBU4ZSGQSCKTXQUPTH4D77TMA","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":"1194b9cb38d41150b43cb7a01d1a0eb1058e4ef0b9fd50f5a271c60c2c4e24fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T20:48:29Z","title_canon_sha256":"98445cc44765d5727f1942c5e6dfc801e4bdb4ca26659a2965cd01755e7b5705"},"schema_version":"1.0","source":{"id":"1511.07412","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07412","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07412v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07412","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"7XBU4ZSGQSCK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7XBU4ZSGQSCKTXQU","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7XBU4ZSG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:1f120938f315b2622892d09b42b8a4c529ad7c0d1d9bf933a9da5781931745a5","target":"graph","created_at":"2026-05-18T01:26:11Z","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":"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","authors_text":"Evdokia Nikolova, Ger Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T20:48:29Z","title":"Approximation Algorithms for Route Planning with Nonlinear Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07412","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:357f6cf713e15a297b309e1e384c34971bb0e5385d994fca0d38c2b8109dee9b","target":"record","created_at":"2026-05-18T01:26:11Z","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":"1194b9cb38d41150b43cb7a01d1a0eb1058e4ef0b9fd50f5a271c60c2c4e24fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-23T20:48:29Z","title_canon_sha256":"98445cc44765d5727f1942c5e6dfc801e4bdb4ca26659a2965cd01755e7b5705"},"schema_version":"1.0","source":{"id":"1511.07412","kind":"arxiv","version":1}},"canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdc34e66468484a9de147ccfc1fff3603325c3adbdf37b5e310e43d3fd1be327","first_computed_at":"2026-05-18T01:26:11.471348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.471348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CGv47+vfKTUA7XVppNcDNa4SX1MILTzyBFbQHoiK5dOQuh6hQv5bOu8XQA0V0q5uhh4z7FNRvF5pNbja8YJODw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.471909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07412","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:357f6cf713e15a297b309e1e384c34971bb0e5385d994fca0d38c2b8109dee9b","sha256:1f120938f315b2622892d09b42b8a4c529ad7c0d1d9bf933a9da5781931745a5"],"state_sha256":"d6685e4b0e6cf117d59f6a3cec161b9ddfd8b04cbc1a87de550c5fe2eaeb7416"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+d8TS3ZcoKV05nIC9p9xUJHgOtehKyNjtIlYWleNCr64C+Jk/quEKn4szl6Z2XrCNJU9rKm45RVm8+M3nDwDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:31:54.205164Z","bundle_sha256":"7989165840dc4c2bb8adbb812ed2c5e41092fa62442b0510e58abc956b634e73"}}