{"as_of":"2026-08-23T10:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:308eb1a85625b63eb79026714669bd275c776c040b13d36b529d26a02e67d566","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:33:59.484423Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2507.05542/citation-record","integrity":"/paper/2507.05542/integrity","json":"/paper/2507.05542/citation-record.json","paper":"/paper/2507.05542"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:05.295869Z","title":"Vehicle trajectory data mining for artificial intelligence and real-time traffic information extraction,","venue":null,"work_id":"e87b38d9-7c68-4a00-af55-713e4ae6434a","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.207343Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:7ae7f8e8e4724eba5a85904f97d9cb9a568da6057a2fe40645b2ad074ec7105b","observation_id":"962067a2-bcc3-445c-b9d4-80215ea2708e","resolution":{"observed_at":"2026-08-06T19:34:05.366861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:05.144482Z","title":"Travel-time prediction using gaus- sian process regression: A trajectory-based approach,","venue":null,"work_id":"7e6f26be-5234-46b8-93b3-f46ad7bded9d","year":2009},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.275541Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:3dde28bfb3a8ce8d49c5ee81aa56c80b33e83a91e3f9e6b01faac11920840144","observation_id":"169b2d60-0b0a-447c-b1ab-c57b6727839a","resolution":{"observed_at":"2026-08-06T19:34:05.223344Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.958579Z","title":"Chalkboarding: A new spatiotemporal query paradigm for sports play retrieval,","venue":null,"work_id":"cc2c5893-4502-4cbe-9503-926287089589","year":2016},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.332484Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:3c9dea7f3c8062503270f9f9c966d32b205db85226ae377f389ad87f95683ae1","observation_id":"d3bf1ae2-f1ce-482f-bab8-75e56eb5b9f0","resolution":{"observed_at":"2026-08-06T19:34:05.053993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.829030Z","title":"Efficient retrieval of similar time sequences under time warping,","venue":null,"work_id":"f96dd941-0707-42b0-bd35-663b3a2434a4","year":1998},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.388649Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:30aa2bd9c514472fa59db5fa2a843bab8ca3c8b4bae20875d28e14e91e4cc6c7","observation_id":"6935d817-2daa-4b56-a29f-c897d77b3811","resolution":{"observed_at":"2026-08-06T19:34:04.883923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.689016Z","title":"Robust and fast sim- ilarity search for moving object trajectories,","venue":null,"work_id":"e2b0db6c-d382-415f-b053-f00c41e448db","year":2005},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.426496Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:e69dba7a95630d6a8d3d1b43f4f7902fb67fa900b107cb771c9f8e850fd631ca","observation_id":"15488cbf-4da5-401c-a5d1-8791d22709f8","resolution":{"observed_at":"2026-08-06T19:34:04.751732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.552158Z","title":"On the marriage of lp-norms and edit distance,","venue":null,"work_id":"f6ada2c1-a770-42c0-bea7-c7603695ffe7","year":2004},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.522137Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:3e07131869625607588bb5accab5bcd825dfc8cca8f5b305a1efa7bf5a2cbc9b","observation_id":"b0663c39-785f-4d86-aac5-7d3a589a1c0b","resolution":{"observed_at":"2026-08-06T19:34:04.601494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.383809Z","title":"Trass: Efficient trajectory similarity search based on key-value data stores,","venue":null,"work_id":"1fd7ca0f-6c56-4324-9a2f-8c4c458e3180","year":2022},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.669799Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:8a9a8edd0199dffdc59a22604854ba6e12901b54b23907d5679f9fa7d8dc0690","observation_id":"f3ec2314-9b4a-445d-94cd-abd10931907f","resolution":{"observed_at":"2026-08-06T19:34:04.468269Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.193288Z","title":"Distributed in-memory trajectory similarity search and join on road network,","venue":null,"work_id":"75c09528-ba6e-4f3f-9999-e614967bb07b","year":2019},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.790034Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:dfdbef722135ac3b36716551ce9940e8aa0e199d6e21f4ac90d5136a018c32dd","observation_id":"51a55eb1-b847-4b1b-9a15-3b6928e484b2","resolution":{"observed_at":"2026-08-06T19:34:04.252298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.02542","last_updated":"2020-07-14T07:34:08Z","snapshot_observed_at":"2026-08-19T19:10:46.617484Z","submitted_at":"2020-03-05T11:38:21Z","title":"Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning","version":2},"cited_work":{"arxiv_id":"2003.02542","doi":null,"metadata_source":"pith","pith_arxiv_id":"2003.02542","snapshot_observed_at":"2026-08-06T19:33:59.567067Z","title":"Efficient and Effective Similar Subtrajectory Search with Deep Reinforcement Learning","venue":"cs.DB","work_id":"5b200a17-583b-4032-a681-614f8c244d0c","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:56.914504Z"},"links":{"cited_paper":"/paper/2003.02542","citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:c9c5e1092efbbbbaae590f10499e5872b5f55c5999d406af7dd8bfe0c783f94f","observation_id":"b7fe5c35-7313-44fd-b7cb-6902756990ee","resolution":{"observed_at":"2026-08-06T19:33:59.631501Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:04.036867Z","title":"Fast subtrajec- tory similarity search in road networks under weighted edit distance constraints,","venue":null,"work_id":"92bd7b04-6aa8-4dba-88e4-8a7f3f51293f","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.064317Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:705cb98f213b989d602581cf904042d8acecaeff1e36d0647cdbfedefd94e8ee","observation_id":"038fe16c-1e24-4384-bf0d-4fed04ad763d","resolution":{"observed_at":"2026-08-06T19:34:04.119496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:03.889080Z","title":"Distributed subtrajectory join on massive datasets,","venue":null,"work_id":"a049b6ad-5d29-4858-a0f2-48e502890bcb","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.202929Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:a5627d48713a1e55fdeacbcce715405ce7822f566de1e334677b6443e3b3e4b4","observation_id":"3ef26891-8ad1-4b1a-a4e0-214af05ff72b","resolution":{"observed_at":"2026-08-06T19:34:03.956685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:03.721062Z","title":"Efficient and effective similar subtrajectory search: A spatial- aware comprehension approach,","venue":null,"work_id":"d22d0648-fe53-4c6f-9b35-1e51de9ffa86","year":2022},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.324668Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:bb70980005eee4ab7275f497b8df7d9f4c648f651dc0e5702ccf2356652f80dc","observation_id":"3c463b8e-3c26-4c7e-9e0d-1247e7a2dda5","resolution":{"observed_at":"2026-08-06T19:34:03.796795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:03.565603Z","title":"Exact and efficient similar subtrajectory search: Integrating constraints and simplification,","venue":null,"work_id":"3d42a209-564e-486e-9fc4-05a43cd9154f","year":2025},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.408294Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:4c607b82761d0cd31074f98492cbbf74089a33cda77810057c55be3842889fbf","observation_id":"41c07720-848a-4095-bc9c-d12bd66f60fb","resolution":{"observed_at":"2026-08-06T19:34:03.644885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:03.325716Z","title":"Efficient learning-based top-k representative similar subtrajectory query,","venue":null,"work_id":"868e48d7-c3dd-4a51-b376-9c7f174fc011","year":2024},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.487384Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:6f4eb42a474e047e6ad514d863b3344ca4bc72dac10977d9750219538995bcdd","observation_id":"e2191ae4-c9bc-40a4-b702-d1bb0fbf52e8","resolution":{"observed_at":"2026-08-06T19:34:03.457009Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:03.159958Z","title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs,","venue":null,"work_id":"c83fdd97-21ad-4517-af29-384cdbdf4c30","year":2018},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.628107Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:b00255ab143744241eaed23a1bcf539e85e81da935e77ae54982aaf12d8e90cc","observation_id":"2a740b3f-a89f-4278-8707-10632831ab8d","resolution":{"observed_at":"2026-08-06T19:34:03.206539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.950791Z","title":"Efficient and effective similar subtrajectory search with deep reinforce- ment learning,","venue":null,"work_id":"4484d2ea-c77d-4779-87cb-ce73c1160220","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.760342Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:ad97790c7b4127264662dd5ef63972df1050f2b6549fbd77258c6412294a0dd6","observation_id":"fa72d03f-1d44-41d0-babd-ac7218897305","resolution":{"observed_at":"2026-08-06T19:34:03.076834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.817908Z","title":"Ef- ficient non-learning similar subtrajectory search,","venue":null,"work_id":"ff4dc214-7b44-4f0b-ba89-dcad5280cb9e","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.857927Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:8996637d305c1b31013ee8b01c7a362e12a849d28755a376146ac3ec510b2c4f","observation_id":"9ef3d32b-3fe2-4db2-aa53-654ca6e1e859","resolution":{"observed_at":"2026-08-06T19:34:02.871339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.636693Z","title":"Efficient and effective similar subtrajectory search with deep reinforcement learning,","venue":null,"work_id":"892978fb-bfff-410d-9fa1-47beb68cb433","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:57.933109Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:d807302f4b5af5560eb228c51104d6bd136adc245acd63187ecdb1a637068cdc","observation_id":"893235d5-db81-4098-a80f-a948c3ed6f6d","resolution":{"observed_at":"2026-08-06T19:34:02.731659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.501979Z","title":"A methodology for implementing highly concurrent data objects (abstract),","venue":null,"work_id":"c150cde2-6753-48bb-9a0b-da06934593bc","year":1992},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.012650Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:5e072556fabbfd1ef9619c7fd3c5beddfd29638df3e0d8d75167ba0c6730faa3","observation_id":"d9f906cc-f1a5-4620-b32a-9c7ad7feebb2","resolution":{"observed_at":"2026-08-06T19:34:02.560929Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.340942Z","title":"KSQ: top-(k) similarity query on uncertain trajectories,","venue":null,"work_id":"b2d884a1-87c1-47ec-a5c6-4c57a56d139b","year":2013},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.094906Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:f604fe8151de1280c3b5bd8b64dfb6c3981b7b3e4d5e3cb6fd8ce3e0255da215","observation_id":"488243d4-b62a-46b8-9c6d-e22b9ced412d","resolution":{"observed_at":"2026-08-06T19:34:02.396789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.256130Z","title":"REPOSE: distributed top-k trajectory similarity search with local reference point tries,","venue":null,"work_id":"3720b049-67ce-431e-84e1-57ef6350b492","year":2021},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.172215Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:636d663e32b73a932fe4f39573f35d687c997c51d81f01410d89591e983d43d7","observation_id":"43c13c37-acc7-4473-a713-a43fb014714c","resolution":{"observed_at":"2026-08-06T19:34:02.278351Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:02.117063Z","title":"Garden: a real-time processing framework for continu- ous top-k trajectory similarity search,","venue":null,"work_id":"4ccb0fd4-4199-4404-9a7c-1a18d0f1dce3","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.226120Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:f3bb4a6464dfa46fe33649c6216ba75971474b5f2184e2b1b92c576e4c0f481b","observation_id":"3ae255eb-c6a7-4648-8a73-32c979851744","resolution":{"observed_at":"2026-08-06T19:34:02.164247Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.970528Z","title":"Stkst-i: An efficient semantic trajectory search by temporal and semantic keywords,","venue":null,"work_id":"edd996a2-c374-4f14-af06-2d55f40497c9","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.338957Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:fd9c635da7cf07afa19e4b721814d478ff4e5fe22cb480ed2a2eee5448ab7e5a","observation_id":"a67bf3ed-3076-4738-838a-c4292b0c0392","resolution":{"observed_at":"2026-08-06T19:34:02.040408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.826765Z","title":"An effectiveness study on trajectory similarity measures,","venue":null,"work_id":"4b61a369-0546-4d50-96c8-86551317264d","year":2013},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.455330Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:d665cab5a7187b7adbbf8a69b216b06d0b485663a2c18b337b4bd3e5aa18a306","observation_id":"03efc6ed-0898-4313-9c9c-cf345fd294fa","resolution":{"observed_at":"2026-08-06T19:34:01.857496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.698244Z","title":"Top- k community similarity search over large-scale road networks,","venue":null,"work_id":"320ee187-ab2b-4c7a-bb2f-536ba5b33e36","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.511982Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:1ea38d6ddcecdc2ba3bed3043f21fe7bb953e8c5d48a1a80580aabb0d6c4ee0d","observation_id":"5a077e87-5aa2-4f89-9fc9-ea2540d14247","resolution":{"observed_at":"2026-08-06T19:34:01.750406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.565980Z","title":"Rndlp: A distributed framework for supporting continuous k- similarity trajectories search over road network,","venue":null,"work_id":"ef968ae4-8d9f-4bd9-bbad-12d748fcacd1","year":2024},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.590710Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:812403b813a1b77d55ae8b22cdd15dea71920063eca34cf64ae8e55d63ed6642","observation_id":"d1502929-e23b-4d44-beda-707e81739f1b","resolution":{"observed_at":"2026-08-06T19:34:01.631119Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.310142Z","title":"Towards efficient privacy-preserving top-k trajectory similarity query,","venue":null,"work_id":"6677230d-d044-47d9-b479-95e4c21a0e17","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.657351Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:44856a5f5686d24a3952fbec73e2eae1dc823106ad8921ca987b21922c052eec","observation_id":"06fbda63-1f34-48c7-9802-a9a5199adfb2","resolution":{"observed_at":"2026-08-06T19:34:01.454859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:01.104911Z","title":"Continuous trajectory similarity search with result diversification,","venue":null,"work_id":"4d937275-da51-4d6d-838f-8303188aef9f","year":2023},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.699505Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:cd0430bd2939b45aab43bf9fcdd5eb60c56089665dfc6db2a0382a0dc735f4bf","observation_id":"2ec60feb-20f0-4495-a822-f46de0b7968f","resolution":{"observed_at":"2026-08-06T19:34:01.183586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.961038Z","title":"Vehicle trajectory similarity: Models, methods, and ap- plications,","venue":null,"work_id":"8ba15623-2bde-4d7f-a02a-49a2d5449a2f","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.785074Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:63fa85e48bf285ebcdadc94aaa853aa067f3a19ed84d66d4ca89b51f88054657","observation_id":"8e896303-7a31-470c-aa52-df6ff161ff21","resolution":{"observed_at":"2026-08-06T19:34:01.016908Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.685284Z","title":"Trajectory similarity mea- sures,","venue":null,"work_id":"c1af9334-6a9c-4ab9-875f-0e7b85059d29","year":2015},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.870741Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:9ec66d05ad87d1fac19d4edc5d1f50fb9ebfb6600b1764c755d253e59054c3b6","observation_id":"d776bb1c-8e57-4920-bb0a-4ca31c3f2242","resolution":{"observed_at":"2026-08-06T19:34:00.808656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.548509Z","title":"The definition and com- putation of trajectory and subtrajectory similarity,","venue":null,"work_id":"6830b8a4-e20e-4e9c-8ff6-cdc8eeb51988","year":2007},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:58.930482Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:f8ea1dec0fabd86f6b485bc4a78e7dfb6e85ee232697c86313e349740008a8d0","observation_id":"226f6553-f91f-41c7-a552-4be383bcd899","resolution":{"observed_at":"2026-08-06T19:34:00.592360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.418263Z","title":"Similarity measurement of moving object trajectories,","venue":null,"work_id":"f4ffcce8-ba45-4aa3-a6b9-fa030d831314","year":2012},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.038984Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:550dbebb5bb66bb4b86708423bf2fb12241d44fd64035372bea3dea9f9182e11","observation_id":"bfbaaa53-3e40-4bab-94cd-67794b812720","resolution":{"observed_at":"2026-08-06T19:34:00.496298Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.275784Z","title":"A survey of trajectory distance measures and performance evaluation,","venue":null,"work_id":"93559685-bb7d-4e8a-99f0-69602f2f0c3b","year":2020},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.177894Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:8740b6b8a4d0e01a30bfef6679aebdb63e80d11f0687dcdf7bfe0f697cd124bb","observation_id":"92b232a1-3438-44a2-964b-1be7ea2235f6","resolution":{"observed_at":"2026-08-06T19:34:00.352383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:34:00.153664Z","title":"Gaia open dataset,","venue":null,"work_id":"acdb1b71-9cd9-416e-8545-21c5638e09c8","year":2019},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.294269Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:e0c4d85b9d60b0aacb6d9f8bc8451764f3f27abfc71a3cb15eb632e9f5626fa0","observation_id":"fe01d05b-bf41-4b79-aa1b-c57bd1334d1c","resolution":{"observed_at":"2026-08-06T19:34:00.192830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:33:59.977065Z","title":"Tmn: Trajectory matching networks for predicting similarity,","venue":null,"work_id":"18abfd55-9ca4-456c-8bfe-7d831fddfffa","year":2022},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.373998Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:ed90721b670f9a3a2ba921aa4ff85fc124b27b9487305b4efb9f21e65fd9d642","observation_id":"c1e1aaf6-9258-4b85-b5d3-3297fc5d3452","resolution":{"observed_at":"2026-08-06T19:34:00.054979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:33:59.836778Z","title":"Computing trajectory similarity in linear time: A generic seed-guided neural metric learning approach,","venue":null,"work_id":"77934f1d-4a2f-429a-a12d-b2089bd97da3","year":2019},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.420583Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:970f0a4a758c00576895e1c0bb5cae2ad2a2deb6397f8ba91ade9aab4a22c534","observation_id":"08c1484b-56c7-4acb-a3ac-5a159164ddc5","resolution":{"observed_at":"2026-08-06T19:33:59.884249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:33:59.696491Z","title":"T3s: Effective representation learning for tra- jectory similarity computation,","venue":null,"work_id":"de14ef1a-b9f9-4fcb-9661-8cea729be0ca","year":2021},"citing_paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T19:33:59.484423Z"},"links":{"citing_paper":"/paper/2507.05542"},"observation_digest":"sha256:4d0824d474bb84323026b03d5926f2b9173444e11017bc0c1f0c2ec2d66029d2","observation_id":"42609d91-373c-467c-a981-d5ed0dae2250","resolution":{"observed_at":"2026-08-06T19:33:59.752048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.05542","last_updated":"2025-07-07T23:50:17Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-23T04:39:59.568158Z","submitted_at":"2025-07-07T23:50:17Z","title":"GTRSS: Graph-based Top-$k$ Representative Similar Subtrajectory Query"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":36},"total_outbound_references":37},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2507.05542."}