{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YNO6LI7SC2BJYKOGYJDGNNJCQL","short_pith_number":"pith:YNO6LI7S","schema_version":"1.0","canonical_sha256":"c35de5a3f216829c29c6c24666b52282d2cb8981e3daed3b8b1ee72faad63b50","source":{"kind":"arxiv","id":"1804.11284","version":3},"attestation_state":"computed","paper":{"title":"Simple Distances for Trajectories via Landmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Jeff M. Phillips, Pingfan Tang","submitted_at":"2018-04-30T15:54:23Z","abstract_excerpt":"We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute, and perform well in data analysis tasks. For trajectories, they match and in some cases significantly out-perform all state-of-the-art other metrics, can effortlessly be used in k-means clustering, and directly plugged into approximate nearest neighbor approaches which immediately out-perform the best recent advances in trajectory similarity search by several"},"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":"1804.11284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-04-30T15:54:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3c129dfcec4c08af4e0c9796947efcc003438a317908bcdaa4007a21ca5cf7f9","abstract_canon_sha256":"cdce8acfc3b9c137132a54ef81b34e3c5e07d8b9421c66c3ef91f4309b236809"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:33.342006Z","signature_b64":"CuNxGYkRZpdMwbMNX5gFGL+vYsMate7m4o56lVOBfDO0VdRpqykApzJL7M7hu9yzepUTTY5vfKk2DSS3G0x5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c35de5a3f216829c29c6c24666b52282d2cb8981e3daed3b8b1ee72faad63b50","last_reissued_at":"2026-05-17T23:43:33.341620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:33.341620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simple Distances for Trajectories via Landmarks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CG","authors_text":"Jeff M. Phillips, Pingfan Tang","submitted_at":"2018-04-30T15:54:23Z","abstract_excerpt":"We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute, and perform well in data analysis tasks. For trajectories, they match and in some cases significantly out-perform all state-of-the-art other metrics, can effortlessly be used in k-means clustering, and directly plugged into approximate nearest neighbor approaches which immediately out-perform the best recent advances in trajectory similarity search by several"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.11284","kind":"arxiv","version":3},"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":"1804.11284","created_at":"2026-05-17T23:43:33.341682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.11284v3","created_at":"2026-05-17T23:43:33.341682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.11284","created_at":"2026-05-17T23:43:33.341682+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNO6LI7SC2BJ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNO6LI7SC2BJYKOG","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNO6LI7S","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.02171","citing_title":"Sketched MinDist","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL","json":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL.json","graph_json":"https://pith.science/api/pith-number/YNO6LI7SC2BJYKOGYJDGNNJCQL/graph.json","events_json":"https://pith.science/api/pith-number/YNO6LI7SC2BJYKOGYJDGNNJCQL/events.json","paper":"https://pith.science/paper/YNO6LI7S"},"agent_actions":{"view_html":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL","download_json":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL.json","view_paper":"https://pith.science/paper/YNO6LI7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.11284&json=true","fetch_graph":"https://pith.science/api/pith-number/YNO6LI7SC2BJYKOGYJDGNNJCQL/graph.json","fetch_events":"https://pith.science/api/pith-number/YNO6LI7SC2BJYKOGYJDGNNJCQL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL/action/storage_attestation","attest_author":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL/action/author_attestation","sign_citation":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL/action/citation_signature","submit_replication":"https://pith.science/pith/YNO6LI7SC2BJYKOGYJDGNNJCQL/action/replication_record"}},"created_at":"2026-05-17T23:43:33.341682+00:00","updated_at":"2026-05-17T23:43:33.341682+00:00"}