{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:AAXPFQB67MFEH3M5DJTJ3WN2BA","short_pith_number":"pith:AAXPFQB6","schema_version":"1.0","canonical_sha256":"002ef2c03efb0a43ed9d1a669dd9ba08242bd4a05bc06b5e50c6bbcceb89b010","source":{"kind":"arxiv","id":"2112.09339","version":2},"attestation_state":"computed","paper":{"title":"Deep Spatially and Temporally Aware Similarity Computation for Road Network Constrained Trajectories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Christian S. Jensen, Lu Chen, Xinjun Zhu, Yunjun Gao, Yuntao Du, Ziquan Fang","submitted_at":"2021-12-17T06:18:04Z","abstract_excerpt":"Trajectory similarity computation has drawn massive attention, as it is core functionality in a wide range of applications such as ride-sharing, traffic analysis, and social recommendation. Motivated by the recent success of deep learning technologies, researchers start devoting efforts to learning-based similarity analyses to overcome the limitations (i.e., high cost and poor adaptability) of traditional methods. Specifically, deep trajectory similarity computation aims to learn a distance function that can evaluate how similar two trajectories are via neural networks. However, existing learn"},"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":"2112.09339","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T06:18:04Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"467bb375decfff35826f2bcb3d7554c455f685c28d2060d22d6f2bba12743395","abstract_canon_sha256":"62ec2fad27e0605e79332324fd57bd14e17f84fc367e0506d4f5ae6d08fe5ac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:00:21.355490Z","signature_b64":"gB6yVYTMeHtEQgZvZ7bFEhGvGj00haBpHBX5r8vNGGrEhsEV2WHx5l9akPbAoYYL5l8U9UV2wxh0JxNUstXTBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"002ef2c03efb0a43ed9d1a669dd9ba08242bd4a05bc06b5e50c6bbcceb89b010","last_reissued_at":"2026-07-05T04:00:21.354993Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:00:21.354993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Spatially and Temporally Aware Similarity Computation for Road Network Constrained Trajectories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LG","authors_text":"Christian S. Jensen, Lu Chen, Xinjun Zhu, Yunjun Gao, Yuntao Du, Ziquan Fang","submitted_at":"2021-12-17T06:18:04Z","abstract_excerpt":"Trajectory similarity computation has drawn massive attention, as it is core functionality in a wide range of applications such as ride-sharing, traffic analysis, and social recommendation. Motivated by the recent success of deep learning technologies, researchers start devoting efforts to learning-based similarity analyses to overcome the limitations (i.e., high cost and poor adaptability) of traditional methods. Specifically, deep trajectory similarity computation aims to learn a distance function that can evaluate how similar two trajectories are via neural networks. However, existing learn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09339","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/2112.09339/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":"2112.09339","created_at":"2026-07-05T04:00:21.355052+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.09339v2","created_at":"2026-07-05T04:00:21.355052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09339","created_at":"2026-07-05T04:00:21.355052+00:00"},{"alias_kind":"pith_short_12","alias_value":"AAXPFQB67MFE","created_at":"2026-07-05T04:00:21.355052+00:00"},{"alias_kind":"pith_short_16","alias_value":"AAXPFQB67MFEH3M5","created_at":"2026-07-05T04:00:21.355052+00:00"},{"alias_kind":"pith_short_8","alias_value":"AAXPFQB6","created_at":"2026-07-05T04:00:21.355052+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/AAXPFQB67MFEH3M5DJTJ3WN2BA","json":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA.json","graph_json":"https://pith.science/api/pith-number/AAXPFQB67MFEH3M5DJTJ3WN2BA/graph.json","events_json":"https://pith.science/api/pith-number/AAXPFQB67MFEH3M5DJTJ3WN2BA/events.json","paper":"https://pith.science/paper/AAXPFQB6"},"agent_actions":{"view_html":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA","download_json":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA.json","view_paper":"https://pith.science/paper/AAXPFQB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.09339&json=true","fetch_graph":"https://pith.science/api/pith-number/AAXPFQB67MFEH3M5DJTJ3WN2BA/graph.json","fetch_events":"https://pith.science/api/pith-number/AAXPFQB67MFEH3M5DJTJ3WN2BA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA/action/storage_attestation","attest_author":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA/action/author_attestation","sign_citation":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA/action/citation_signature","submit_replication":"https://pith.science/pith/AAXPFQB67MFEH3M5DJTJ3WN2BA/action/replication_record"}},"created_at":"2026-07-05T04:00:21.355052+00:00","updated_at":"2026-07-05T04:00:21.355052+00:00"}