{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DLLUFWA3W2LZHXYDIDKWHYIWES","short_pith_number":"pith:DLLUFWA3","schema_version":"1.0","canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","source":{"kind":"arxiv","id":"1808.10705","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Classifier for Route Prediction with Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan P. Epperlein, Julien Monteil, Mingming Liu, Robert Shorten, Sergiy Zhuk, Yingqi Gu","submitted_at":"2018-08-31T12:24:01Z","abstract_excerpt":"We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. Russo, R. Shorten, and M. Mevissen, \"Hidden Markov model for route and destination prediction,\" in IEEE International Conference on Intelligent Transportation Systems, 2017]. In the presented framework, known journey patterns are modelled as stochastic processes, emitting the road segments visited during the journey, and the ongoing journey is predicted by updating the posterior"},"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":"1808.10705","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T12:24:01Z","cross_cats_sorted":["math.PR","stat.ML"],"title_canon_sha256":"1028f63b7aecc19c93e7636fabe24fa85e8fb9d8f7f31bac7633040ace72abbf","abstract_canon_sha256":"0ac3674e35ab530104d456e0d072b44e0df4d7716350b5abd98eae7874a168db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:45.040081Z","signature_b64":"VM6zMkAOjx3WYxqGtZjiOGAmKmts5R3EmjMPO4G9lh+tzJtuqpqM7ojRVKeuPFL7O8glRYfsWk/7Hfvb8XymAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","last_reissued_at":"2026-05-18T00:06:45.039540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:45.039540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Classifier for Route Prediction with Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jonathan P. Epperlein, Julien Monteil, Mingming Liu, Robert Shorten, Sergiy Zhuk, Yingqi Gu","submitted_at":"2018-08-31T12:24:01Z","abstract_excerpt":"We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. Russo, R. Shorten, and M. Mevissen, \"Hidden Markov model for route and destination prediction,\" in IEEE International Conference on Intelligent Transportation Systems, 2017]. In the presented framework, known journey patterns are modelled as stochastic processes, emitting the road segments visited during the journey, and the ongoing journey is predicted by updating the posterior"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10705","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":"1808.10705","created_at":"2026-05-18T00:06:45.039639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.10705v1","created_at":"2026-05-18T00:06:45.039639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10705","created_at":"2026-05-18T00:06:45.039639+00:00"},{"alias_kind":"pith_short_12","alias_value":"DLLUFWA3W2LZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DLLUFWA3W2LZHXYD","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DLLUFWA3","created_at":"2026-05-18T12:32:19.392346+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/DLLUFWA3W2LZHXYDIDKWHYIWES","json":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES.json","graph_json":"https://pith.science/api/pith-number/DLLUFWA3W2LZHXYDIDKWHYIWES/graph.json","events_json":"https://pith.science/api/pith-number/DLLUFWA3W2LZHXYDIDKWHYIWES/events.json","paper":"https://pith.science/paper/DLLUFWA3"},"agent_actions":{"view_html":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES","download_json":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES.json","view_paper":"https://pith.science/paper/DLLUFWA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.10705&json=true","fetch_graph":"https://pith.science/api/pith-number/DLLUFWA3W2LZHXYDIDKWHYIWES/graph.json","fetch_events":"https://pith.science/api/pith-number/DLLUFWA3W2LZHXYDIDKWHYIWES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/action/storage_attestation","attest_author":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/action/author_attestation","sign_citation":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/action/citation_signature","submit_replication":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/action/replication_record"}},"created_at":"2026-05-18T00:06:45.039639+00:00","updated_at":"2026-05-18T00:06:45.039639+00:00"}