{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UU6TNSK3BQTHYNCUEAAOMH65BQ","short_pith_number":"pith:UU6TNSK3","canonical_record":{"source":{"id":"1711.04595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-08T06:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"0299d77c9266f189906d134f967fc9120c070f82cbabb6cd5de249d59b515d78","abstract_canon_sha256":"2fbd0a141211c00f937ca087126564d66203836a9b3d6d441a456d063c5b5e35"},"schema_version":"1.0"},"canonical_sha256":"a53d36c95b0c267c34542000e61fdd0c2f8b13eb8a28581587430a9b059ac127","source":{"kind":"arxiv","id":"1711.04595","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04595","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04595v2","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04595","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"UU6TNSK3BQTH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UU6TNSK3BQTHYNCU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UU6TNSK3","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UU6TNSK3BQTHYNCUEAAOMH65BQ","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-08T06:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"0299d77c9266f189906d134f967fc9120c070f82cbabb6cd5de249d59b515d78","abstract_canon_sha256":"2fbd0a141211c00f937ca087126564d66203836a9b3d6d441a456d063c5b5e35"},"schema_version":"1.0"},"canonical_sha256":"a53d36c95b0c267c34542000e61fdd0c2f8b13eb8a28581587430a9b059ac127","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:11.421137Z","signature_b64":"fF9xq22sUhC1fzIO9UjcV8hXEi2XFg0ofwxaBwo6N+f68h6PqY53hwWbjPLm/Mc/8lf+2+SwJcMv49boxYl7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53d36c95b0c267c34542000e61fdd0c2f8b13eb8a28581587430a9b059ac127","last_reissued_at":"2026-05-18T00:11:11.420525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:11.420525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04595","source_version":2,"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-18T00:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6w1QdoHbdnWz0hviHgchV9vSq4fpZCkwIDS6L9KbxPZ888u0EdX4QT6JsCQ9rsaGEJXPRAXkJW+ejfNoBc7gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:22.955842Z"},"content_sha256":"1dbe95cf79d89da359ee52fdb7b5c0c9ddf0834f794b390593e430a61124798d","schema_version":"1.0","event_id":"sha256:1dbe95cf79d89da359ee52fdb7b5c0c9ddf0834f794b390593e430a61124798d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UU6TNSK3BQTHYNCUEAAOMH65BQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Destination Prediction Based on Route Choices with Transition Matrix Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Heli Sun, Jianbin Huang, Xiaolin Jia, Zhongmeng Zhao, Zhou Yang, Ziyu Guan","submitted_at":"2017-11-08T06:40:28Z","abstract_excerpt":"Destination prediction is an essential task in a variety of mobile applications. In this paper, we optimize the matrix operation and adapt a semi-lazy framework to improve the prediction accuracy and efficiency of a state-of-the-art approach. To this end, we employ efficient dynamic-programming by devising several data constructs including Efficient Transition Probability and Transition Probabilities with Detours that are capable of pinpointing the minimum amount of computation. We prove that our method achieves one order of cut in both time and space complexity. The experimental results on re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04595","kind":"arxiv","version":2},"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-18T00:11:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mDIftl4GP3v0TwSsgJZld8B1OZZP0wEyIDmOvjqZrATQ3h5ruD1Z4jI9Z+ez/abbC7Gt2TqK/gIXmzOaB/spDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:37:22.956527Z"},"content_sha256":"a28a223d434538e0e30d137d83da333da50ef469642ef3cedb5ea7951905bcd1","schema_version":"1.0","event_id":"sha256:a28a223d434538e0e30d137d83da333da50ef469642ef3cedb5ea7951905bcd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/bundle.json","state_url":"https://pith.science/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/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-28T22:37:22Z","links":{"resolver":"https://pith.science/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ","bundle":"https://pith.science/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/bundle.json","state":"https://pith.science/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UU6TNSK3BQTHYNCUEAAOMH65BQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UU6TNSK3BQTHYNCUEAAOMH65BQ","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":"2fbd0a141211c00f937ca087126564d66203836a9b3d6d441a456d063c5b5e35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-08T06:40:28Z","title_canon_sha256":"0299d77c9266f189906d134f967fc9120c070f82cbabb6cd5de249d59b515d78"},"schema_version":"1.0","source":{"id":"1711.04595","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04595","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04595v2","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04595","created_at":"2026-05-18T00:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"UU6TNSK3BQTH","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UU6TNSK3BQTHYNCU","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UU6TNSK3","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:a28a223d434538e0e30d137d83da333da50ef469642ef3cedb5ea7951905bcd1","target":"graph","created_at":"2026-05-18T00:11: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":"Destination prediction is an essential task in a variety of mobile applications. In this paper, we optimize the matrix operation and adapt a semi-lazy framework to improve the prediction accuracy and efficiency of a state-of-the-art approach. To this end, we employ efficient dynamic-programming by devising several data constructs including Efficient Transition Probability and Transition Probabilities with Detours that are capable of pinpointing the minimum amount of computation. We prove that our method achieves one order of cut in both time and space complexity. The experimental results on re","authors_text":"Heli Sun, Jianbin Huang, Xiaolin Jia, Zhongmeng Zhao, Zhou Yang, Ziyu Guan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-08T06:40:28Z","title":"Efficient Destination Prediction Based on Route Choices with Transition Matrix Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04595","kind":"arxiv","version":2},"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:1dbe95cf79d89da359ee52fdb7b5c0c9ddf0834f794b390593e430a61124798d","target":"record","created_at":"2026-05-18T00:11: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":"2fbd0a141211c00f937ca087126564d66203836a9b3d6d441a456d063c5b5e35","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-11-08T06:40:28Z","title_canon_sha256":"0299d77c9266f189906d134f967fc9120c070f82cbabb6cd5de249d59b515d78"},"schema_version":"1.0","source":{"id":"1711.04595","kind":"arxiv","version":2}},"canonical_sha256":"a53d36c95b0c267c34542000e61fdd0c2f8b13eb8a28581587430a9b059ac127","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a53d36c95b0c267c34542000e61fdd0c2f8b13eb8a28581587430a9b059ac127","first_computed_at":"2026-05-18T00:11:11.420525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:11.420525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fF9xq22sUhC1fzIO9UjcV8hXEi2XFg0ofwxaBwo6N+f68h6PqY53hwWbjPLm/Mc/8lf+2+SwJcMv49boxYl7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:11.421137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04595","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dbe95cf79d89da359ee52fdb7b5c0c9ddf0834f794b390593e430a61124798d","sha256:a28a223d434538e0e30d137d83da333da50ef469642ef3cedb5ea7951905bcd1"],"state_sha256":"35772d210c9549f7e43e46d5df2baeac597f582754873fb3ea3ade1336e360ec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X8wtMPdP6vyhCwoNVmhJSG35THl0eAND8Ob8uJnh0XmXXGZZ9r+kkQMAE5vkC56PACG8mq/5O7o703/u3egSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:37:22.959997Z","bundle_sha256":"980d5d820ec8433e715f67faacaba2e1d4fed6802f01c175bbad0cc35b66fef8"}}