{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JZ4ESDEA7AXOJQ5BT6SCJC565R","short_pith_number":"pith:JZ4ESDEA","schema_version":"1.0","canonical_sha256":"4e78490c80f82ee4c3a19fa4248bbeec46a35d67673e13c4a0e2876f9e49598d","source":{"kind":"arxiv","id":"1310.5249","version":1},"attestation_state":"computed","paper":{"title":"Graph-Based Approaches to Clustering Network-Constrained Trajectory Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabrice Rossi (SAMM), Mohamed Khalil El Mahrsi (LTCI, SAMM)","submitted_at":"2013-10-19T17:24:39Z","abstract_excerpt":"Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network and its influence on evaluating the similarity between trajectories. In this paper, we present an approach to clustering such network-constrained trajectory data. More precisely we aim at discovering groups of road segments that are often travelled by the same trajectories. To achieve this end, we model the interactions between segments w.r.t. their similar"},"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":"1310.5249","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-10-19T17:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"aa4510c8973ab1fb29c6c56dee00aec576d7b16b439e90682f07351e8a01e9af","abstract_canon_sha256":"2dd6c88d4a01e375ad90c243ce061f0e75a96df485a4dc96e2a3fe826a2cef68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.418009Z","signature_b64":"dpRbxrrgNAye5N5Pz52PcwqoKvOStnpI29pk+GoscKfK3NhWEHcCyHiduEy1UJhEeEsdY0WoZkaU8nN007IMAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e78490c80f82ee4c3a19fa4248bbeec46a35d67673e13c4a0e2876f9e49598d","last_reissued_at":"2026-05-18T03:09:46.417236Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.417236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph-Based Approaches to Clustering Network-Constrained Trajectory Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Fabrice Rossi (SAMM), Mohamed Khalil El Mahrsi (LTCI, SAMM)","submitted_at":"2013-10-19T17:24:39Z","abstract_excerpt":"Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network and its influence on evaluating the similarity between trajectories. In this paper, we present an approach to clustering such network-constrained trajectory data. More precisely we aim at discovering groups of road segments that are often travelled by the same trajectories. To achieve this end, we model the interactions between segments w.r.t. their similar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5249","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":""},"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":"1310.5249","created_at":"2026-05-18T03:09:46.417343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5249v1","created_at":"2026-05-18T03:09:46.417343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5249","created_at":"2026-05-18T03:09:46.417343+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZ4ESDEA7AXO","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZ4ESDEA7AXOJQ5B","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZ4ESDEA","created_at":"2026-05-18T12:27:49.015174+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/JZ4ESDEA7AXOJQ5BT6SCJC565R","json":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R.json","graph_json":"https://pith.science/api/pith-number/JZ4ESDEA7AXOJQ5BT6SCJC565R/graph.json","events_json":"https://pith.science/api/pith-number/JZ4ESDEA7AXOJQ5BT6SCJC565R/events.json","paper":"https://pith.science/paper/JZ4ESDEA"},"agent_actions":{"view_html":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R","download_json":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R.json","view_paper":"https://pith.science/paper/JZ4ESDEA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5249&json=true","fetch_graph":"https://pith.science/api/pith-number/JZ4ESDEA7AXOJQ5BT6SCJC565R/graph.json","fetch_events":"https://pith.science/api/pith-number/JZ4ESDEA7AXOJQ5BT6SCJC565R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R/action/storage_attestation","attest_author":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R/action/author_attestation","sign_citation":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R/action/citation_signature","submit_replication":"https://pith.science/pith/JZ4ESDEA7AXOJQ5BT6SCJC565R/action/replication_record"}},"created_at":"2026-05-18T03:09:46.417343+00:00","updated_at":"2026-05-18T03:09:46.417343+00:00"}