{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3","short_pith_number":"pith:EKPC4E7H","canonical_record":{"source":{"id":"1810.05357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-12T05:02:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4679fac360828752ad3b96b928e208a6f0574a720733829cd4f032987cccc42","abstract_canon_sha256":"142e1d006c14225c9957c2342832a088959d8cfbfe4d543c8dd6fa5335740370"},"schema_version":"1.0"},"canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","source":{"kind":"arxiv","id":"1810.05357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05357","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05357v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05357","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"EKPC4E7HH5CP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKPC4E7HH5CPK2JY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKPC4E7H","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-12T05:02:29Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b4679fac360828752ad3b96b928e208a6f0574a720733829cd4f032987cccc42","abstract_canon_sha256":"142e1d006c14225c9957c2342832a088959d8cfbfe4d543c8dd6fa5335740370"},"schema_version":"1.0"},"canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:30.853603Z","signature_b64":"wk4A4eUmlPdduY5P8Jg8BDtG7RXwQbZDVg38af0zFfGvmZgneHA4PIUoYQLIoVcWBO0aHbU+cQonss76SeFxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","last_reissued_at":"2026-05-18T00:03:30.852892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:30.852892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05357","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k+JdIgQdNUTmaKZlbfCYJ8SffbUwQoMV9J6xLnttd9EI3cn9hEt2HWRBDr6e58N1Rn0ZnjdDO+4UDlC+OaglBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:50:15.043103Z"},"content_sha256":"ac002c6806a992f658f905e62c34bee972c227562afda07f70ee8fcd9f4886fb","schema_version":"1.0","event_id":"sha256:ac002c6806a992f658f905e62c34bee972c227562afda07f70ee8fcd9f4886fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On The Equivalence of Tries and Dendrograms - Efficient Hierarchical Clustering of Traffic Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DB","authors_text":"Chia-Tung Kuo, Ian Davidson","submitted_at":"2018-10-12T05:02:29Z","abstract_excerpt":"The widespread use of GPS-enabled devices generates voluminous and continuous amounts of traffic data but analyzing such data for interpretable and actionable insights poses challenges. A hierarchical clustering of the trips has many uses such as discovering shortest paths, common routes and often traversed areas. However, hierarchical clustering typically has time complexity of $O(n^2 \\log n)$ where $n$ is the number of instances, and is difficult to scale to large data sets associated with GPS data. Furthermore, incremental hierarchical clustering is still a developing area. Prefix trees (al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05357","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:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ippavqqf0IG5RYMlOTO86flf+U03qoGh2+TmEBsnl6aZWiduLV/aDcRckHhkBwo7PwJ5wvsP7sZekFPa91C7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T13:50:15.043496Z"},"content_sha256":"3411c574cd36ed4711b41372f0281630e1ee94b02176fa2bdeaf18abbe64ddec","schema_version":"1.0","event_id":"sha256:3411c574cd36ed4711b41372f0281630e1ee94b02176fa2bdeaf18abbe64ddec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/bundle.json","state_url":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/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-30T13:50:15Z","links":{"resolver":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3","bundle":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/bundle.json","state":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3","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":"142e1d006c14225c9957c2342832a088959d8cfbfe4d543c8dd6fa5335740370","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-12T05:02:29Z","title_canon_sha256":"b4679fac360828752ad3b96b928e208a6f0574a720733829cd4f032987cccc42"},"schema_version":"1.0","source":{"id":"1810.05357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05357","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05357v1","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05357","created_at":"2026-05-18T00:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"EKPC4E7HH5CP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EKPC4E7HH5CPK2JY","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EKPC4E7H","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:3411c574cd36ed4711b41372f0281630e1ee94b02176fa2bdeaf18abbe64ddec","target":"graph","created_at":"2026-05-18T00:03:30Z","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":"The widespread use of GPS-enabled devices generates voluminous and continuous amounts of traffic data but analyzing such data for interpretable and actionable insights poses challenges. A hierarchical clustering of the trips has many uses such as discovering shortest paths, common routes and often traversed areas. However, hierarchical clustering typically has time complexity of $O(n^2 \\log n)$ where $n$ is the number of instances, and is difficult to scale to large data sets associated with GPS data. Furthermore, incremental hierarchical clustering is still a developing area. Prefix trees (al","authors_text":"Chia-Tung Kuo, Ian Davidson","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-12T05:02:29Z","title":"On The Equivalence of Tries and Dendrograms - Efficient Hierarchical Clustering of Traffic Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05357","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:ac002c6806a992f658f905e62c34bee972c227562afda07f70ee8fcd9f4886fb","target":"record","created_at":"2026-05-18T00:03:30Z","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":"142e1d006c14225c9957c2342832a088959d8cfbfe4d543c8dd6fa5335740370","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2018-10-12T05:02:29Z","title_canon_sha256":"b4679fac360828752ad3b96b928e208a6f0574a720733829cd4f032987cccc42"},"schema_version":"1.0","source":{"id":"1810.05357","kind":"arxiv","version":1}},"canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","first_computed_at":"2026-05-18T00:03:30.852892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:30.852892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wk4A4eUmlPdduY5P8Jg8BDtG7RXwQbZDVg38af0zFfGvmZgneHA4PIUoYQLIoVcWBO0aHbU+cQonss76SeFxAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:30.853603Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac002c6806a992f658f905e62c34bee972c227562afda07f70ee8fcd9f4886fb","sha256:3411c574cd36ed4711b41372f0281630e1ee94b02176fa2bdeaf18abbe64ddec"],"state_sha256":"0196e1dbb4cd01e3eb0e13abd389eb947645659cdf506ac47681b7208110b500"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rJHAPGev/FCixBC6Y1FIg2SAQRttw1j52cGkFa1xmZgxcFseEjN9ooZNJS4WtsSmwPLoTe1ZiVfSVdrXNI75Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T13:50:15.045534Z","bundle_sha256":"c3b7dd30bc7cea50cf43448694c7d979c2ef360e4df231b14d56924819c569b6"}}