{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C5YC2WFS2XRG2C6GC4ZQ4PDYCY","short_pith_number":"pith:C5YC2WFS","canonical_record":{"source":{"id":"1802.07980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T11:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"c93ecbb5e91a319b6723828bb83d6508d19bda4654a82306e463fd9c45b99b3b","abstract_canon_sha256":"4330e18f07382433a8ec9c40be84c1b1890ba7b0e284c7438ad461ed9203fccb"},"schema_version":"1.0"},"canonical_sha256":"17702d58b2d5e26d0bc617330e3c78160daced763b052c21c97ea1303d9cdb92","source":{"kind":"arxiv","id":"1802.07980","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07980","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07980v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07980","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"C5YC2WFS2XRG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5YC2WFS2XRG2C6G","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5YC2WFS","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C5YC2WFS2XRG2C6GC4ZQ4PDYCY","target":"record","payload":{"canonical_record":{"source":{"id":"1802.07980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T11:11:07Z","cross_cats_sorted":[],"title_canon_sha256":"c93ecbb5e91a319b6723828bb83d6508d19bda4654a82306e463fd9c45b99b3b","abstract_canon_sha256":"4330e18f07382433a8ec9c40be84c1b1890ba7b0e284c7438ad461ed9203fccb"},"schema_version":"1.0"},"canonical_sha256":"17702d58b2d5e26d0bc617330e3c78160daced763b052c21c97ea1303d9cdb92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:48.478851Z","signature_b64":"v2DiyI6odVTruwI3Sw/FbQpULucpRtCro/VhAzZgVDU6UrP8TpAa28l9ZLPBRwp6fj/O6WUOLbh/uIY2/cveDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17702d58b2d5e26d0bc617330e3c78160daced763b052c21c97ea1303d9cdb92","last_reissued_at":"2026-05-18T00:22:48.478189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:48.478189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.07980","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:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5eT8IFGH3KpiJ3UK8YeIQ/2vsS+nPkogJ0D9rqZyvMhP0d57taIB6gBa8gGZ31qZo0zXIm0XBXQzfGA+j2nGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:35:38.479176Z"},"content_sha256":"536ad84cadf6d5caded61e52116fa61ce8eee2b1492decf67a90ff95a8dba7cc","schema_version":"1.0","event_id":"sha256:536ad84cadf6d5caded61e52116fa61ce8eee2b1492decf67a90ff95a8dba7cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C5YC2WFS2XRG2C6GC4ZQ4PDYCY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Route with Sparse Trajectory Sets---Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bin Yang, Chenjuan Guo, Christian S. Jensen, Jilin Hu","submitted_at":"2018-02-22T11:11:07Z","abstract_excerpt":"Motivated by the increasing availability of vehicle trajectory data, we propose learn-to-route, a comprehensive trajectory-based routing solution. Specifically, we first construct a graph-like structure from trajectories as the routing infrastructure. Second, we enable trajectory-based routing given an arbitrary (source, destination) pair.\n  In the first step, given a road network and a collection of trajectories, we propose a trajectory-based clustering method that identifies regions in a road network. If a pair of regions are connected by trajectories, we maintain the paths used by these tra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07980","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:22:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKxGdlde+EGSrjMvfa7Iui7n14nkg/mMCEFt17uB2eRQC8Fb1q1WQQihJZFM+dIcXOICQoQdmC1JqhZJAyQkDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T18:35:38.479550Z"},"content_sha256":"0ccf515f5975e730081df14ef7aeaa037e68f3e18fca2d68890ccf632bb5e3d5","schema_version":"1.0","event_id":"sha256:0ccf515f5975e730081df14ef7aeaa037e68f3e18fca2d68890ccf632bb5e3d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/bundle.json","state_url":"https://pith.science/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/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-06-03T18:35:38Z","links":{"resolver":"https://pith.science/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY","bundle":"https://pith.science/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/bundle.json","state":"https://pith.science/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5YC2WFS2XRG2C6GC4ZQ4PDYCY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C5YC2WFS2XRG2C6GC4ZQ4PDYCY","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":"4330e18f07382433a8ec9c40be84c1b1890ba7b0e284c7438ad461ed9203fccb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T11:11:07Z","title_canon_sha256":"c93ecbb5e91a319b6723828bb83d6508d19bda4654a82306e463fd9c45b99b3b"},"schema_version":"1.0","source":{"id":"1802.07980","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.07980","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"arxiv_version","alias_value":"1802.07980v1","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07980","created_at":"2026-05-18T00:22:48Z"},{"alias_kind":"pith_short_12","alias_value":"C5YC2WFS2XRG","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5YC2WFS2XRG2C6G","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5YC2WFS","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:0ccf515f5975e730081df14ef7aeaa037e68f3e18fca2d68890ccf632bb5e3d5","target":"graph","created_at":"2026-05-18T00:22:48Z","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":"Motivated by the increasing availability of vehicle trajectory data, we propose learn-to-route, a comprehensive trajectory-based routing solution. Specifically, we first construct a graph-like structure from trajectories as the routing infrastructure. Second, we enable trajectory-based routing given an arbitrary (source, destination) pair.\n  In the first step, given a road network and a collection of trajectories, we propose a trajectory-based clustering method that identifies regions in a road network. If a pair of regions are connected by trajectories, we maintain the paths used by these tra","authors_text":"Bin Yang, Chenjuan Guo, Christian S. Jensen, Jilin Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T11:11:07Z","title":"Learning to Route with Sparse Trajectory Sets---Extended Version"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07980","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:536ad84cadf6d5caded61e52116fa61ce8eee2b1492decf67a90ff95a8dba7cc","target":"record","created_at":"2026-05-18T00:22:48Z","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":"4330e18f07382433a8ec9c40be84c1b1890ba7b0e284c7438ad461ed9203fccb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-22T11:11:07Z","title_canon_sha256":"c93ecbb5e91a319b6723828bb83d6508d19bda4654a82306e463fd9c45b99b3b"},"schema_version":"1.0","source":{"id":"1802.07980","kind":"arxiv","version":1}},"canonical_sha256":"17702d58b2d5e26d0bc617330e3c78160daced763b052c21c97ea1303d9cdb92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17702d58b2d5e26d0bc617330e3c78160daced763b052c21c97ea1303d9cdb92","first_computed_at":"2026-05-18T00:22:48.478189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:48.478189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2DiyI6odVTruwI3Sw/FbQpULucpRtCro/VhAzZgVDU6UrP8TpAa28l9ZLPBRwp6fj/O6WUOLbh/uIY2/cveDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:48.478851Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.07980","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:536ad84cadf6d5caded61e52116fa61ce8eee2b1492decf67a90ff95a8dba7cc","sha256:0ccf515f5975e730081df14ef7aeaa037e68f3e18fca2d68890ccf632bb5e3d5"],"state_sha256":"901722666b9a9a56aac2efc796f8a361d50fadee039744ed6f8dc8edf4594620"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/lnRFfqwoImkejLApt29OIIXUsfNp0ZHT6xiE+5ZcZaBTq0Jy1Zqd5oolNrOFxlbNzRBCgFQqWAvQwpTc2SBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T18:35:38.481565Z","bundle_sha256":"1e8555e72e84a11d3f5b2802b33447c391a9fb9622e675fc7b5978e261acc2d9"}}