{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:26JRASAFQVL56NYT6DKPVBBQ7I","short_pith_number":"pith:26JRASAF","canonical_record":{"source":{"id":"1804.03504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-03-15T08:30:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ec9af204fd68a754793a9b6158b04b690fb173a90acadbc9b79108fb82443d08","abstract_canon_sha256":"8521e26580dc4ddecffa59856415280501fe9ff18d732fe0ac4324ea3eaa80b3"},"schema_version":"1.0"},"canonical_sha256":"d7931048058557df3713f0d4fa8430fa3f1bfd7392dfde84fca1e15530da985b","source":{"kind":"arxiv","id":"1804.03504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03504","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03504v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03504","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"26JRASAFQVL5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"26JRASAFQVL56NYT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"26JRASAF","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:26JRASAFQVL56NYT6DKPVBBQ7I","target":"record","payload":{"canonical_record":{"source":{"id":"1804.03504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-03-15T08:30:22Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"ec9af204fd68a754793a9b6158b04b690fb173a90acadbc9b79108fb82443d08","abstract_canon_sha256":"8521e26580dc4ddecffa59856415280501fe9ff18d732fe0ac4324ea3eaa80b3"},"schema_version":"1.0"},"canonical_sha256":"d7931048058557df3713f0d4fa8430fa3f1bfd7392dfde84fca1e15530da985b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:47.934992Z","signature_b64":"Z/cHqe9fnrc9RW7gma4GQ2013/aoYC1FLU2MF0CwaLUkKQnwEEoisG7N6L/rGk64SsoSGKiXA6vVsQpkuF5/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7931048058557df3713f0d4fa8430fa3f1bfd7392dfde84fca1e15530da985b","last_reissued_at":"2026-05-18T00:18:47.934099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:47.934099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.03504","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NG8E3a94AGuUHUxhQ9FOhgXczy5KmfVM5e2MZb/YvL7tbA+yBRhSjYxGaDrcUcoBekd/mIfkkdrvtJsThASLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:29:22.432041Z"},"content_sha256":"b8dc2ffe3454ac9eb53cc5daee936a348c8263103b18f207d87c41b3144e94f0","schema_version":"1.0","event_id":"sha256:b8dc2ffe3454ac9eb53cc5daee936a348c8263103b18f207d87c41b3144e94f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:26JRASAFQVL56NYT6DKPVBBQ7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hidden Markov Model for Route and Destination Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Giovanni Russo, Julien Monteil, Martin Mevissen, Robert Shorten, Yassine Lassoued, Yingqi Gu","submitted_at":"2018-03-15T08:30:22Z","abstract_excerpt":"We present a simple model and algorithm for predicting driver destinations and routes, based on the input of the latest road links visited as part of an ongoing trip. The algorithm may be used to predict any clusters previously observed in a driver's trip history. It assumes that the driver's historical trips are grouped into clusters sharing similar patterns. Given a new trip, the algorithm attempts to predict the cluster in which the trip belongs. The proposed algorithm has low temporal complexity. In addition, it does not require the transition and emission matrices of the Markov chain to b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03504","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:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qzh8haRkyKmHo+/+kwRIpH82lO/mwSFiiypaMJ0HmgmtLJ22gf5Y/eMOZRM+87yFlxg3i7Kql31ir7MdM0qjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:29:22.432403Z"},"content_sha256":"001ab03274cce1bb24ab8c23b70b5876b121f631144b9e9b8d5fd5cb821d2b80","schema_version":"1.0","event_id":"sha256:001ab03274cce1bb24ab8c23b70b5876b121f631144b9e9b8d5fd5cb821d2b80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26JRASAFQVL56NYT6DKPVBBQ7I/bundle.json","state_url":"https://pith.science/pith/26JRASAFQVL56NYT6DKPVBBQ7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26JRASAFQVL56NYT6DKPVBBQ7I/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-28T06:29:22Z","links":{"resolver":"https://pith.science/pith/26JRASAFQVL56NYT6DKPVBBQ7I","bundle":"https://pith.science/pith/26JRASAFQVL56NYT6DKPVBBQ7I/bundle.json","state":"https://pith.science/pith/26JRASAFQVL56NYT6DKPVBBQ7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26JRASAFQVL56NYT6DKPVBBQ7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:26JRASAFQVL56NYT6DKPVBBQ7I","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":"8521e26580dc4ddecffa59856415280501fe9ff18d732fe0ac4324ea3eaa80b3","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-03-15T08:30:22Z","title_canon_sha256":"ec9af204fd68a754793a9b6158b04b690fb173a90acadbc9b79108fb82443d08"},"schema_version":"1.0","source":{"id":"1804.03504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03504","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03504v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03504","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"26JRASAFQVL5","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"26JRASAFQVL56NYT","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"26JRASAF","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:001ab03274cce1bb24ab8c23b70b5876b121f631144b9e9b8d5fd5cb821d2b80","target":"graph","created_at":"2026-05-18T00:18:47Z","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 a simple model and algorithm for predicting driver destinations and routes, based on the input of the latest road links visited as part of an ongoing trip. The algorithm may be used to predict any clusters previously observed in a driver's trip history. It assumes that the driver's historical trips are grouped into clusters sharing similar patterns. Given a new trip, the algorithm attempts to predict the cluster in which the trip belongs. The proposed algorithm has low temporal complexity. In addition, it does not require the transition and emission matrices of the Markov chain to b","authors_text":"Giovanni Russo, Julien Monteil, Martin Mevissen, Robert Shorten, Yassine Lassoued, Yingqi Gu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-03-15T08:30:22Z","title":"A Hidden Markov Model for Route and Destination Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03504","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:b8dc2ffe3454ac9eb53cc5daee936a348c8263103b18f207d87c41b3144e94f0","target":"record","created_at":"2026-05-18T00:18:47Z","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":"8521e26580dc4ddecffa59856415280501fe9ff18d732fe0ac4324ea3eaa80b3","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-03-15T08:30:22Z","title_canon_sha256":"ec9af204fd68a754793a9b6158b04b690fb173a90acadbc9b79108fb82443d08"},"schema_version":"1.0","source":{"id":"1804.03504","kind":"arxiv","version":1}},"canonical_sha256":"d7931048058557df3713f0d4fa8430fa3f1bfd7392dfde84fca1e15530da985b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7931048058557df3713f0d4fa8430fa3f1bfd7392dfde84fca1e15530da985b","first_computed_at":"2026-05-18T00:18:47.934099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:47.934099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z/cHqe9fnrc9RW7gma4GQ2013/aoYC1FLU2MF0CwaLUkKQnwEEoisG7N6L/rGk64SsoSGKiXA6vVsQpkuF5/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:47.934992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8dc2ffe3454ac9eb53cc5daee936a348c8263103b18f207d87c41b3144e94f0","sha256:001ab03274cce1bb24ab8c23b70b5876b121f631144b9e9b8d5fd5cb821d2b80"],"state_sha256":"619cf5cb6ea8e2f1387c135f13232eb92a26efffefcaefe8b7b247e869a59bbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ffnh68JFPKq+7B8rcuh2KGbIP4nn/RS13uR1dLP4pbw965WLqooKfREZVzs9XIvzsQONm8x0GF/ssKpzUYulBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:29:22.434308Z","bundle_sha256":"a46e35f809fc90d1727f1b9de465553cfe0a3800e585827d99bbdeb7ce9b286d"}}