{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4NESH2WAHAJZRDLMDBZZ3M2VPR","short_pith_number":"pith:4NESH2WA","schema_version":"1.0","canonical_sha256":"e34923eac03813988d6c18739db3557c40869d69de6f8b81c1ce9fc0fcd287c3","source":{"kind":"arxiv","id":"2507.05542","version":1},"attestation_state":"computed","paper":{"title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kunming Wang, Liping Wang, Mingchang Ge, Xuemin Lin, Yuang Zhang","submitted_at":"2025-07-07T23:50:17Z","abstract_excerpt":"Trajectory mining has attracted significant attention. This paper addresses the Top-k Representative Similar Subtrajectory Query (TRSSQ) problem, which aims to find the k most representative subtrajectories similar to a query. Existing methods rely on costly filtering-validation frameworks, resulting in slow response times. Addressing this, we propose GTRSS, a novel Graph-based Top-k Representative Similar Subtrajectory Query framework. During the offline phase, GTRSS builds a dual-layer graph index that clusters trajectories containing similar representative subtrajectories. In the online pha"},"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":"2507.05542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2025-07-07T23:50:17Z","cross_cats_sorted":[],"title_canon_sha256":"9c729bedecd5119996ed2ef9c808b293325211dde4082677cb15524e6032e6d5","abstract_canon_sha256":"bb0a89e68bc6084c57b0d2f4b4525183d440369fff01d1a2fc056c837c46890b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:32.098861Z","signature_b64":"3Za239p77amVYga5bMephKbQJDvaxD08uMo1kb3bGhcWczow3R6SvTshBzIh537gJNAgbGk/8cnRbzbNgDXlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e34923eac03813988d6c18739db3557c40869d69de6f8b81c1ce9fc0fcd287c3","last_reissued_at":"2026-07-05T11:33:32.098436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:32.098436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Kunming Wang, Liping Wang, Mingchang Ge, Xuemin Lin, Yuang Zhang","submitted_at":"2025-07-07T23:50:17Z","abstract_excerpt":"Trajectory mining has attracted significant attention. This paper addresses the Top-k Representative Similar Subtrajectory Query (TRSSQ) problem, which aims to find the k most representative subtrajectories similar to a query. Existing methods rely on costly filtering-validation frameworks, resulting in slow response times. Addressing this, we propose GTRSS, a novel Graph-based Top-k Representative Similar Subtrajectory Query framework. During the offline phase, GTRSS builds a dual-layer graph index that clusters trajectories containing similar representative subtrajectories. In the online pha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05542","kind":"arxiv","version":1},"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/2507.05542/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":"2507.05542","created_at":"2026-07-05T11:33:32.098493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05542v1","created_at":"2026-07-05T11:33:32.098493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05542","created_at":"2026-07-05T11:33:32.098493+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NESH2WAHAJZ","created_at":"2026-07-05T11:33:32.098493+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NESH2WAHAJZRDLM","created_at":"2026-07-05T11:33:32.098493+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NESH2WA","created_at":"2026-07-05T11:33:32.098493+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/4NESH2WAHAJZRDLMDBZZ3M2VPR","json":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR.json","graph_json":"https://pith.science/api/pith-number/4NESH2WAHAJZRDLMDBZZ3M2VPR/graph.json","events_json":"https://pith.science/api/pith-number/4NESH2WAHAJZRDLMDBZZ3M2VPR/events.json","paper":"https://pith.science/paper/4NESH2WA"},"agent_actions":{"view_html":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR","download_json":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR.json","view_paper":"https://pith.science/paper/4NESH2WA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05542&json=true","fetch_graph":"https://pith.science/api/pith-number/4NESH2WAHAJZRDLMDBZZ3M2VPR/graph.json","fetch_events":"https://pith.science/api/pith-number/4NESH2WAHAJZRDLMDBZZ3M2VPR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR/action/storage_attestation","attest_author":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR/action/author_attestation","sign_citation":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR/action/citation_signature","submit_replication":"https://pith.science/pith/4NESH2WAHAJZRDLMDBZZ3M2VPR/action/replication_record"}},"created_at":"2026-07-05T11:33:32.098493+00:00","updated_at":"2026-07-05T11:33:32.098493+00:00"}