{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3","short_pith_number":"pith:EKPC4E7H","schema_version":"1.0","canonical_sha256":"229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d","source":{"kind":"arxiv","id":"1810.05357","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.05357","created_at":"2026-05-18T00:03:30.852996+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05357v1","created_at":"2026-05-18T00:03:30.852996+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05357","created_at":"2026-05-18T00:03:30.852996+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKPC4E7HH5CP","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKPC4E7HH5CPK2JY","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKPC4E7H","created_at":"2026-05-18T12:32:22.470017+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/EKPC4E7HH5CPK2JYVY4JKKX4E3","json":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3.json","graph_json":"https://pith.science/api/pith-number/EKPC4E7HH5CPK2JYVY4JKKX4E3/graph.json","events_json":"https://pith.science/api/pith-number/EKPC4E7HH5CPK2JYVY4JKKX4E3/events.json","paper":"https://pith.science/paper/EKPC4E7H"},"agent_actions":{"view_html":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3","download_json":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3.json","view_paper":"https://pith.science/paper/EKPC4E7H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05357&json=true","fetch_graph":"https://pith.science/api/pith-number/EKPC4E7HH5CPK2JYVY4JKKX4E3/graph.json","fetch_events":"https://pith.science/api/pith-number/EKPC4E7HH5CPK2JYVY4JKKX4E3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/action/storage_attestation","attest_author":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/action/author_attestation","sign_citation":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/action/citation_signature","submit_replication":"https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3/action/replication_record"}},"created_at":"2026-05-18T00:03:30.852996+00:00","updated_at":"2026-05-18T00:03:30.852996+00:00"}