{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NP3WEUTFIMOVSYEMCIUYSBCAIT","short_pith_number":"pith:NP3WEUTF","schema_version":"1.0","canonical_sha256":"6bf7625265431d59608c122989044044d35b37ccc064347f7e36d2356e2c3d1a","source":{"kind":"arxiv","id":"2005.10917","version":2},"attestation_state":"computed","paper":{"title":"Succinct Trit-array Trie for Scalable Trajectory Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Keisuke Fujii, Koh Takeuchi, Shunsuke Kanda, Yasuo Tabei","submitted_at":"2020-05-21T21:42:30Z","abstract_excerpt":"Massive datasets of spatial trajectories representing the mobility of a diversity of moving objects are ubiquitous in research and industry. Similarity search of a large collection of trajectories is indispensable for turning these datasets into knowledge. Locality sensitive hashing (LSH) is a powerful technique for fast similarity searches. Recent methods employ LSH and attempt to realize an efficient similarity search of trajectories; however, those methods are inefficient in terms of search time and memory when applied to massive datasets. To address this problem, we present the trajectory-"},"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":"2005.10917","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-21T21:42:30Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"2f313a99482b591c0233d5b28ff0ac4a6cbdedfe638d91db5f9195e396ddf2c6","abstract_canon_sha256":"042ceec66d4503c735f44e33cb5dc23337fe07b920ec55931709178437b9ade4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:10.555179Z","signature_b64":"7si3is8aiWnq0hq6H8sixHsgiU2rQLVhl/vg/gI3xARWXcNG8LMLhf3R9pz+g59Paxv0yCmkqt6d5NwKh0+9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bf7625265431d59608c122989044044d35b37ccc064347f7e36d2356e2c3d1a","last_reissued_at":"2026-07-05T01:37:10.554742Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:10.554742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct Trit-array Trie for Scalable Trajectory Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"cs.DS","authors_text":"Keisuke Fujii, Koh Takeuchi, Shunsuke Kanda, Yasuo Tabei","submitted_at":"2020-05-21T21:42:30Z","abstract_excerpt":"Massive datasets of spatial trajectories representing the mobility of a diversity of moving objects are ubiquitous in research and industry. Similarity search of a large collection of trajectories is indispensable for turning these datasets into knowledge. Locality sensitive hashing (LSH) is a powerful technique for fast similarity searches. Recent methods employ LSH and attempt to realize an efficient similarity search of trajectories; however, those methods are inefficient in terms of search time and memory when applied to massive datasets. To address this problem, we present the trajectory-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.10917","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.10917/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2005.10917","created_at":"2026-07-05T01:37:10.554798+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.10917v2","created_at":"2026-07-05T01:37:10.554798+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.10917","created_at":"2026-07-05T01:37:10.554798+00:00"},{"alias_kind":"pith_short_12","alias_value":"NP3WEUTFIMOV","created_at":"2026-07-05T01:37:10.554798+00:00"},{"alias_kind":"pith_short_16","alias_value":"NP3WEUTFIMOVSYEM","created_at":"2026-07-05T01:37:10.554798+00:00"},{"alias_kind":"pith_short_8","alias_value":"NP3WEUTF","created_at":"2026-07-05T01:37:10.554798+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/NP3WEUTFIMOVSYEMCIUYSBCAIT","json":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT.json","graph_json":"https://pith.science/api/pith-number/NP3WEUTFIMOVSYEMCIUYSBCAIT/graph.json","events_json":"https://pith.science/api/pith-number/NP3WEUTFIMOVSYEMCIUYSBCAIT/events.json","paper":"https://pith.science/paper/NP3WEUTF"},"agent_actions":{"view_html":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT","download_json":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT.json","view_paper":"https://pith.science/paper/NP3WEUTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.10917&json=true","fetch_graph":"https://pith.science/api/pith-number/NP3WEUTFIMOVSYEMCIUYSBCAIT/graph.json","fetch_events":"https://pith.science/api/pith-number/NP3WEUTFIMOVSYEMCIUYSBCAIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT/action/storage_attestation","attest_author":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT/action/author_attestation","sign_citation":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT/action/citation_signature","submit_replication":"https://pith.science/pith/NP3WEUTFIMOVSYEMCIUYSBCAIT/action/replication_record"}},"created_at":"2026-07-05T01:37:10.554798+00:00","updated_at":"2026-07-05T01:37:10.554798+00:00"}