{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DOTJAYEJ6GQR3VXUUJZLSRRO3E","short_pith_number":"pith:DOTJAYEJ","canonical_record":{"source":{"id":"1304.2144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T09:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"ca85e9575af48cb05e3759ba8edf9a68278e13afd6f21a6ad3d7fed7b6bd23a6","abstract_canon_sha256":"3936901e1258b81e6b42947bebcfd5b6b5ae0d7b56223a33659e0f125391048b"},"schema_version":"1.0"},"canonical_sha256":"1ba6906089f1a11dd6f4a272b9462ed912f754b4822e30a41d8353eb3947ad70","source":{"kind":"arxiv","id":"1304.2144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2144","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2144v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2144","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"DOTJAYEJ6GQR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DOTJAYEJ6GQR3VXU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DOTJAYEJ","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DOTJAYEJ6GQR3VXUUJZLSRRO3E","target":"record","payload":{"canonical_record":{"source":{"id":"1304.2144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T09:35:46Z","cross_cats_sorted":[],"title_canon_sha256":"ca85e9575af48cb05e3759ba8edf9a68278e13afd6f21a6ad3d7fed7b6bd23a6","abstract_canon_sha256":"3936901e1258b81e6b42947bebcfd5b6b5ae0d7b56223a33659e0f125391048b"},"schema_version":"1.0"},"canonical_sha256":"1ba6906089f1a11dd6f4a272b9462ed912f754b4822e30a41d8353eb3947ad70","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:43.893621Z","signature_b64":"afcQ42B4trbQkDemyYXTSoG4JG1zoCKiv+GdHo4P3IyltGdo1mWWg/9vPlPlUFm6LwGwCVg0D7MujhWcJkvtDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba6906089f1a11dd6f4a272b9462ed912f754b4822e30a41d8353eb3947ad70","last_reissued_at":"2026-05-18T03:28:43.892939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:43.892939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.2144","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-18T03:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6F06KlMC9j/ceNgXQDOpt0Do4N757r7GeIsjZpmGaRJi7HIeuG2oD2MooHUBm80tsFFUz3Mc7KxNy9EApLv+Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:07.551906Z"},"content_sha256":"93f640a74f7d8531836ea45348faca5b89a932d0a2a2ce74ad8df3ff846aa5fc","schema_version":"1.0","event_id":"sha256:93f640a74f7d8531836ea45348faca5b89a932d0a2a2ce74ad8df3ff846aa5fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DOTJAYEJ6GQR3VXUUJZLSRRO3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Backward Path Growth for Efficient Mobile Sequential Recommendation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heli Sun, Hong Cheng, Jianbin Huang, Qinbao Song, Xuejun Huangfu","submitted_at":"2013-04-08T09:35:46Z","abstract_excerpt":"The problem of mobile sequential recommendation is presented to suggest a route connecting some pick-up points for a taxi driver so that he/she is more likely to get passengers with less travel cost. Essentially, a key challenge of this problem is its high computational complexity. In this paper, we propose a dynamical programming based method to solve this problem. Our method consists of two separate stages: an offline pre-processing stage and an online search stage. The offline stage pre-computes optimal potential sequence candidates from a set of pick-up points, and the online stage selects"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2144","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-18T03:28:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4sGDA39Ht3ZC4pyukd1HB+7LzNwYaj1LjVrq9xqWO0Sd7oQ30n3Oq7yqRWruiOJQURQjAuvDN5TKz7A2QVifAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:51:07.552250Z"},"content_sha256":"50f9c14b39173b8197cb76f8aec0c94cfd44814635034b97556371eaade44b4d","schema_version":"1.0","event_id":"sha256:50f9c14b39173b8197cb76f8aec0c94cfd44814635034b97556371eaade44b4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/bundle.json","state_url":"https://pith.science/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/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-05-28T12:51:07Z","links":{"resolver":"https://pith.science/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E","bundle":"https://pith.science/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/bundle.json","state":"https://pith.science/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOTJAYEJ6GQR3VXUUJZLSRRO3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DOTJAYEJ6GQR3VXUUJZLSRRO3E","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":"3936901e1258b81e6b42947bebcfd5b6b5ae0d7b56223a33659e0f125391048b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T09:35:46Z","title_canon_sha256":"ca85e9575af48cb05e3759ba8edf9a68278e13afd6f21a6ad3d7fed7b6bd23a6"},"schema_version":"1.0","source":{"id":"1304.2144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.2144","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"arxiv_version","alias_value":"1304.2144v1","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.2144","created_at":"2026-05-18T03:28:43Z"},{"alias_kind":"pith_short_12","alias_value":"DOTJAYEJ6GQR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DOTJAYEJ6GQR3VXU","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DOTJAYEJ","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:50f9c14b39173b8197cb76f8aec0c94cfd44814635034b97556371eaade44b4d","target":"graph","created_at":"2026-05-18T03:28:43Z","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":"The problem of mobile sequential recommendation is presented to suggest a route connecting some pick-up points for a taxi driver so that he/she is more likely to get passengers with less travel cost. Essentially, a key challenge of this problem is its high computational complexity. In this paper, we propose a dynamical programming based method to solve this problem. Our method consists of two separate stages: an offline pre-processing stage and an online search stage. The offline stage pre-computes optimal potential sequence candidates from a set of pick-up points, and the online stage selects","authors_text":"Heli Sun, Hong Cheng, Jianbin Huang, Qinbao Song, Xuejun Huangfu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T09:35:46Z","title":"Backward Path Growth for Efficient Mobile Sequential Recommendation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.2144","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:93f640a74f7d8531836ea45348faca5b89a932d0a2a2ce74ad8df3ff846aa5fc","target":"record","created_at":"2026-05-18T03:28:43Z","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":"3936901e1258b81e6b42947bebcfd5b6b5ae0d7b56223a33659e0f125391048b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-08T09:35:46Z","title_canon_sha256":"ca85e9575af48cb05e3759ba8edf9a68278e13afd6f21a6ad3d7fed7b6bd23a6"},"schema_version":"1.0","source":{"id":"1304.2144","kind":"arxiv","version":1}},"canonical_sha256":"1ba6906089f1a11dd6f4a272b9462ed912f754b4822e30a41d8353eb3947ad70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ba6906089f1a11dd6f4a272b9462ed912f754b4822e30a41d8353eb3947ad70","first_computed_at":"2026-05-18T03:28:43.892939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:43.892939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"afcQ42B4trbQkDemyYXTSoG4JG1zoCKiv+GdHo4P3IyltGdo1mWWg/9vPlPlUFm6LwGwCVg0D7MujhWcJkvtDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:43.893621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.2144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93f640a74f7d8531836ea45348faca5b89a932d0a2a2ce74ad8df3ff846aa5fc","sha256:50f9c14b39173b8197cb76f8aec0c94cfd44814635034b97556371eaade44b4d"],"state_sha256":"3e95b4545aab501ea9272341a6d9daeb52bd5780617b50b7c1334e33eeab1853"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpjmDggNK5cmB0gPLNCQCxeNHGvTp8DEupPsJxDko8kKVwVK6C6LlwzV9NMBVojJ5jASYtis0DcGodEyPux9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:51:07.554210Z","bundle_sha256":"1fc1994530bd689e97898c62b2fb8ce30f374bfbc8e5d6957978f056383a2e3b"}}