{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DLLUFWA3W2LZHXYDIDKWHYIWES","short_pith_number":"pith:DLLUFWA3","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"},"canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","source":{"kind":"arxiv","id":"1808.10705","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10705","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10705v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10705","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"DLLUFWA3W2LZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DLLUFWA3W2LZHXYD","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DLLUFWA3","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DLLUFWA3W2LZHXYDIDKWHYIWES","target":"record","payload":{"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"},"canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","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"},"source_kind":"arxiv","source_id":"1808.10705","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-18T00:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gm7pF8aIa9hxAgMFt9fxnFQvK3OVcGCIXw19IFiEsDamzAQkrmJojo5BeDcDWUWMINU36kA7mSTvzL5mEfnbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:40.312112Z"},"content_sha256":"1f4e46971b45e234cc416dc3405a06de4ce776bf934090010da15cfba639b684","schema_version":"1.0","event_id":"sha256:1f4e46971b45e234cc416dc3405a06de4ce776bf934090010da15cfba639b684"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DLLUFWA3W2LZHXYDIDKWHYIWES","target":"graph","payload":{"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"},"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:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fq3T6az6CTqGQMTzAKKmcFo3dYPp9roTrl+wcoBldyIuyExdqU8NvebLUqjHxT7KNd6nWifez4I7pG8pVWfhAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:27:40.312470Z"},"content_sha256":"2ce09604c8638221fd17cdb3f89c5881ed1ce4f04249172aa22faf11cc498eb5","schema_version":"1.0","event_id":"sha256:2ce09604c8638221fd17cdb3f89c5881ed1ce4f04249172aa22faf11cc498eb5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/bundle.json","state_url":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/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-28T07:27:40Z","links":{"resolver":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES","bundle":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/bundle.json","state":"https://pith.science/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DLLUFWA3W2LZHXYDIDKWHYIWES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DLLUFWA3W2LZHXYDIDKWHYIWES","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":"0ac3674e35ab530104d456e0d072b44e0df4d7716350b5abd98eae7874a168db","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T12:24:01Z","title_canon_sha256":"1028f63b7aecc19c93e7636fabe24fa85e8fb9d8f7f31bac7633040ace72abbf"},"schema_version":"1.0","source":{"id":"1808.10705","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10705","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10705v1","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10705","created_at":"2026-05-18T00:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"DLLUFWA3W2LZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DLLUFWA3W2LZHXYD","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DLLUFWA3","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:2ce09604c8638221fd17cdb3f89c5881ed1ce4f04249172aa22faf11cc498eb5","target":"graph","created_at":"2026-05-18T00:06:45Z","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 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","authors_text":"Jonathan P. Epperlein, Julien Monteil, Mingming Liu, Robert Shorten, Sergiy Zhuk, Yingqi Gu","cross_cats":["math.PR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T12:24:01Z","title":"Bayesian Classifier for Route Prediction with Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10705","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:1f4e46971b45e234cc416dc3405a06de4ce776bf934090010da15cfba639b684","target":"record","created_at":"2026-05-18T00:06:45Z","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":"0ac3674e35ab530104d456e0d072b44e0df4d7716350b5abd98eae7874a168db","cross_cats_sorted":["math.PR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T12:24:01Z","title_canon_sha256":"1028f63b7aecc19c93e7636fabe24fa85e8fb9d8f7f31bac7633040ace72abbf"},"schema_version":"1.0","source":{"id":"1808.10705","kind":"arxiv","version":1}},"canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ad742d81bb69793df0340d563e11624aa9e5bac9c41234e0311db01dec9e456","first_computed_at":"2026-05-18T00:06:45.039540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:45.039540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VM6zMkAOjx3WYxqGtZjiOGAmKmts5R3EmjMPO4G9lh+tzJtuqpqM7ojRVKeuPFL7O8glRYfsWk/7Hfvb8XymAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:45.040081Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10705","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f4e46971b45e234cc416dc3405a06de4ce776bf934090010da15cfba639b684","sha256:2ce09604c8638221fd17cdb3f89c5881ed1ce4f04249172aa22faf11cc498eb5"],"state_sha256":"172e46bef92d55111ce3dbc779bdb4808dfd0dad5d6ac27797ff83d9c1d04a88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wfXKyrvEKrecIUQhrCQgcYH/y2UDZr0A72CVhYmzHTmvuM/rUf6DVx5G1dpB08hPqOb3jeMcAU/lWWy95pGHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:27:40.314429Z","bundle_sha256":"78053448082392923887f086ea3b43de309d19699eb2f3b75b28cc2c930fc373"}}