{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WCBADRK4BBLYDBDM6KKEYFSBM7","short_pith_number":"pith:WCBADRK4","schema_version":"1.0","canonical_sha256":"b08201c55c085781846cf2944c164167e6d528ab0eb05e105940395275724815","source":{"kind":"arxiv","id":"2405.19761","version":2},"attestation_state":"computed","paper":{"title":"Revisiting CNNs for Trajectory Similarity Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongxiang Zhang, Gang Chen, Huan Li, Linzhu Yu, Sai Wu, Zhihao Chang","submitted_at":"2024-05-30T07:16:03Z","abstract_excerpt":"Similarity search is a fundamental but expensive operator in querying trajectory data, due to its quadratic complexity of distance computation. To mitigate the computational burden for long trajectories, neural networks have been widely employed for similarity learning and each trajectory is encoded as a high-dimensional vector for similarity search with linear complexity. Given the sequential nature of trajectory data, previous efforts have been primarily devoted to the utilization of RNNs or Transformers.\n  In this paper, we argue that the common practice of treating trajectory as sequential"},"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":"2405.19761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-05-30T07:16:03Z","cross_cats_sorted":[],"title_canon_sha256":"614e5e1945b5e24e41b3ce14d50e5544ee024f33b361ca95a15a4393b90ff591","abstract_canon_sha256":"4b2522bd0061679319093a1587e97f70aa725a2c9e1ead9e1f5d294ea8bd59e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:03.414753Z","signature_b64":"mA90iz7MAItA6ZOmwNTRNsDnxpksrzVLGTcZvFw7jd5qqNq8xunC5vWIlOXNtC2o13UQrMu9QBeXR0QumXiuBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b08201c55c085781846cf2944c164167e6d528ab0eb05e105940395275724815","last_reissued_at":"2026-07-05T09:31:03.414249Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:03.414249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting CNNs for Trajectory Similarity Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dongxiang Zhang, Gang Chen, Huan Li, Linzhu Yu, Sai Wu, Zhihao Chang","submitted_at":"2024-05-30T07:16:03Z","abstract_excerpt":"Similarity search is a fundamental but expensive operator in querying trajectory data, due to its quadratic complexity of distance computation. To mitigate the computational burden for long trajectories, neural networks have been widely employed for similarity learning and each trajectory is encoded as a high-dimensional vector for similarity search with linear complexity. Given the sequential nature of trajectory data, previous efforts have been primarily devoted to the utilization of RNNs or Transformers.\n  In this paper, we argue that the common practice of treating trajectory as sequential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19761","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/2405.19761/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":"2405.19761","created_at":"2026-07-05T09:31:03.414307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19761v2","created_at":"2026-07-05T09:31:03.414307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19761","created_at":"2026-07-05T09:31:03.414307+00:00"},{"alias_kind":"pith_short_12","alias_value":"WCBADRK4BBLY","created_at":"2026-07-05T09:31:03.414307+00:00"},{"alias_kind":"pith_short_16","alias_value":"WCBADRK4BBLYDBDM","created_at":"2026-07-05T09:31:03.414307+00:00"},{"alias_kind":"pith_short_8","alias_value":"WCBADRK4","created_at":"2026-07-05T09:31:03.414307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08273","citing_title":"Efficient Prompt Learning for Traffic Forecasting","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7","json":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7.json","graph_json":"https://pith.science/api/pith-number/WCBADRK4BBLYDBDM6KKEYFSBM7/graph.json","events_json":"https://pith.science/api/pith-number/WCBADRK4BBLYDBDM6KKEYFSBM7/events.json","paper":"https://pith.science/paper/WCBADRK4"},"agent_actions":{"view_html":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7","download_json":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7.json","view_paper":"https://pith.science/paper/WCBADRK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19761&json=true","fetch_graph":"https://pith.science/api/pith-number/WCBADRK4BBLYDBDM6KKEYFSBM7/graph.json","fetch_events":"https://pith.science/api/pith-number/WCBADRK4BBLYDBDM6KKEYFSBM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7/action/storage_attestation","attest_author":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7/action/author_attestation","sign_citation":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7/action/citation_signature","submit_replication":"https://pith.science/pith/WCBADRK4BBLYDBDM6KKEYFSBM7/action/replication_record"}},"created_at":"2026-07-05T09:31:03.414307+00:00","updated_at":"2026-07-05T09:31:03.414307+00:00"}