{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VN52X3S4ZH2TSXX5OYADFSABK4","short_pith_number":"pith:VN52X3S4","schema_version":"1.0","canonical_sha256":"ab7babee5cc9f5395efd760032c80157105a8af671e7acf635a2d4a391f1f7e4","source":{"kind":"arxiv","id":"1208.5801","version":2},"attestation_state":"computed","paper":{"title":"Vector Field k-Means: Clustering Trajectories by Fitting Multiple Vector Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlos Scheidegger, Claudio Silva, James T. Klosowski, Nivan Ferreira","submitted_at":"2012-08-28T21:51:36Z","abstract_excerpt":"Scientists study trajectory data to understand trends in movement patterns, such as human mobility for traffic analysis and urban planning. There is a pressing need for scalable and efficient techniques for analyzing this data and discovering the underlying patterns. In this paper, we introduce a novel technique which we call vector-field $k$-means.\n  The central idea of our approach is to use vector fields to induce a similarity notion between trajectories. Other clustering algorithms seek a representative trajectory that best describes each cluster, much like $k$-means identifies a represent"},"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":"1208.5801","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-08-28T21:51:36Z","cross_cats_sorted":[],"title_canon_sha256":"29eb423676ebbc619d00a2582925ae5ff744e504bdbee02901bd4df84db9616c","abstract_canon_sha256":"6aac6e01902c29ae3cd4bd0ec27c67f9c1d73bdcd6b5f874719f21a91c96db44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:33.953710Z","signature_b64":"jvbhJHDTN+zlsUqJYsqa6jy5QNNJ85iDw9oxD6t1SXugSTTQxUUCIT0jTgcRukS+atnxpp74KTwaQwl21m8KDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab7babee5cc9f5395efd760032c80157105a8af671e7acf635a2d4a391f1f7e4","last_reissued_at":"2026-05-18T03:46:33.951936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:33.951936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Vector Field k-Means: Clustering Trajectories by Fitting Multiple Vector Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlos Scheidegger, Claudio Silva, James T. Klosowski, Nivan Ferreira","submitted_at":"2012-08-28T21:51:36Z","abstract_excerpt":"Scientists study trajectory data to understand trends in movement patterns, such as human mobility for traffic analysis and urban planning. There is a pressing need for scalable and efficient techniques for analyzing this data and discovering the underlying patterns. In this paper, we introduce a novel technique which we call vector-field $k$-means.\n  The central idea of our approach is to use vector fields to induce a similarity notion between trajectories. Other clustering algorithms seek a representative trajectory that best describes each cluster, much like $k$-means identifies a represent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5801","kind":"arxiv","version":2},"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":"1208.5801","created_at":"2026-05-18T03:46:33.952474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.5801v2","created_at":"2026-05-18T03:46:33.952474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5801","created_at":"2026-05-18T03:46:33.952474+00:00"},{"alias_kind":"pith_short_12","alias_value":"VN52X3S4ZH2T","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VN52X3S4ZH2TSXX5","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VN52X3S4","created_at":"2026-05-18T12:27:25.539911+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/VN52X3S4ZH2TSXX5OYADFSABK4","json":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4.json","graph_json":"https://pith.science/api/pith-number/VN52X3S4ZH2TSXX5OYADFSABK4/graph.json","events_json":"https://pith.science/api/pith-number/VN52X3S4ZH2TSXX5OYADFSABK4/events.json","paper":"https://pith.science/paper/VN52X3S4"},"agent_actions":{"view_html":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4","download_json":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4.json","view_paper":"https://pith.science/paper/VN52X3S4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.5801&json=true","fetch_graph":"https://pith.science/api/pith-number/VN52X3S4ZH2TSXX5OYADFSABK4/graph.json","fetch_events":"https://pith.science/api/pith-number/VN52X3S4ZH2TSXX5OYADFSABK4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4/action/storage_attestation","attest_author":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4/action/author_attestation","sign_citation":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4/action/citation_signature","submit_replication":"https://pith.science/pith/VN52X3S4ZH2TSXX5OYADFSABK4/action/replication_record"}},"created_at":"2026-05-18T03:46:33.952474+00:00","updated_at":"2026-05-18T03:46:33.952474+00:00"}