{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:T4H755WOMUPRBWUF3UJ2B3V4W4","short_pith_number":"pith:T4H755WO","canonical_record":{"source":{"id":"1205.2172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T07:02:20Z","cross_cats_sorted":["cs.LG","physics.data-an"],"title_canon_sha256":"dcd8912bb5cc11e501c81d0146b25abb31333c7ecd1540aec0aa874b3e636a95","abstract_canon_sha256":"15a000b3123890c746f8da79e3c1c714f4c5795099d35b254b382d855f4d1a26"},"schema_version":"1.0"},"canonical_sha256":"9f0ffef6ce651f10da85dd13a0eebcb72bc8fd02aa8e5d8b8134ce2439c2d8cc","source":{"kind":"arxiv","id":"1205.2172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2172","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2172v2","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2172","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"T4H755WOMUPR","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T4H755WOMUPRBWUF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T4H755WO","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:T4H755WOMUPRBWUF3UJ2B3V4W4","target":"record","payload":{"canonical_record":{"source":{"id":"1205.2172","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T07:02:20Z","cross_cats_sorted":["cs.LG","physics.data-an"],"title_canon_sha256":"dcd8912bb5cc11e501c81d0146b25abb31333c7ecd1540aec0aa874b3e636a95","abstract_canon_sha256":"15a000b3123890c746f8da79e3c1c714f4c5795099d35b254b382d855f4d1a26"},"schema_version":"1.0"},"canonical_sha256":"9f0ffef6ce651f10da85dd13a0eebcb72bc8fd02aa8e5d8b8134ce2439c2d8cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:02.387833Z","signature_b64":"NVNW31YiaOnW4hlZ+9Vz8iSkQTO/G8uBZnpSAkc/5B7VjQo5Tpc2MZGEyTDQhVqyMY8nZNI7j5/lArfxREy1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f0ffef6ce651f10da85dd13a0eebcb72bc8fd02aa8e5d8b8134ce2439c2d8cc","last_reissued_at":"2026-05-18T03:44:02.387192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:02.387192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.2172","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxVdKLY2LTxFMPgYcn/BsHN34kLhXLwmqAWUjQluy5yjEixuDQNMd8DleFPAqiohOvssXAWe3AEjILynA8L2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:46:19.219778Z"},"content_sha256":"f6fcf5616ddd8a31ad16491300fd127f8eb0ed1e20a6ed289ebe89bf28410e2a","schema_version":"1.0","event_id":"sha256:f6fcf5616ddd8a31ad16491300fd127f8eb0ed1e20a6ed289ebe89bf28410e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:T4H755WOMUPRBWUF3UJ2B3V4W4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modularity-Based Clustering for Network-Constrained Trajectories","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","physics.data-an"],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi (SAMM), Mohamed Khalil El Mahrsi (LTCI)","submitted_at":"2012-05-10T07:02:20Z","abstract_excerpt":"We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental study shows the superiority of the proposed approach over classic hierarchical clustering and gives a brief insight to visualization of the clustering results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2172","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:44:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oe/NI10CgwBvX8LCsLD2xQJHPft0kqUxpoGWwOZp5EESbdoye9stFkYZsiHkTktRrOFK/C2sb2kzrGYKUjChDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:46:19.220148Z"},"content_sha256":"198acc4bd1e04560298df57ac6d815fad7e910bf087d7c4fbd9100dbad6b2483","schema_version":"1.0","event_id":"sha256:198acc4bd1e04560298df57ac6d815fad7e910bf087d7c4fbd9100dbad6b2483"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/bundle.json","state_url":"https://pith.science/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:46:19Z","links":{"resolver":"https://pith.science/pith/T4H755WOMUPRBWUF3UJ2B3V4W4","bundle":"https://pith.science/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/bundle.json","state":"https://pith.science/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4H755WOMUPRBWUF3UJ2B3V4W4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:T4H755WOMUPRBWUF3UJ2B3V4W4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"15a000b3123890c746f8da79e3c1c714f4c5795099d35b254b382d855f4d1a26","cross_cats_sorted":["cs.LG","physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T07:02:20Z","title_canon_sha256":"dcd8912bb5cc11e501c81d0146b25abb31333c7ecd1540aec0aa874b3e636a95"},"schema_version":"1.0","source":{"id":"1205.2172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.2172","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"arxiv_version","alias_value":"1205.2172v2","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2172","created_at":"2026-05-18T03:44:02Z"},{"alias_kind":"pith_short_12","alias_value":"T4H755WOMUPR","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"T4H755WOMUPRBWUF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"T4H755WO","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:198acc4bd1e04560298df57ac6d815fad7e910bf087d7c4fbd9100dbad6b2483","target":"graph","created_at":"2026-05-18T03:44:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present a novel clustering approach for moving object trajectories that are constrained by an underlying road network. The approach builds a similarity graph based on these trajectories then uses modularity-optimization hiearchical graph clustering to regroup trajectories with similar profiles. Our experimental study shows the superiority of the proposed approach over classic hierarchical clustering and gives a brief insight to visualization of the clustering results.","authors_text":"Fabrice Rossi (SAMM), Mohamed Khalil El Mahrsi (LTCI)","cross_cats":["cs.LG","physics.data-an"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T07:02:20Z","title":"Modularity-Based Clustering for Network-Constrained Trajectories"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2172","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f6fcf5616ddd8a31ad16491300fd127f8eb0ed1e20a6ed289ebe89bf28410e2a","target":"record","created_at":"2026-05-18T03:44:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"15a000b3123890c746f8da79e3c1c714f4c5795099d35b254b382d855f4d1a26","cross_cats_sorted":["cs.LG","physics.data-an"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-10T07:02:20Z","title_canon_sha256":"dcd8912bb5cc11e501c81d0146b25abb31333c7ecd1540aec0aa874b3e636a95"},"schema_version":"1.0","source":{"id":"1205.2172","kind":"arxiv","version":2}},"canonical_sha256":"9f0ffef6ce651f10da85dd13a0eebcb72bc8fd02aa8e5d8b8134ce2439c2d8cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f0ffef6ce651f10da85dd13a0eebcb72bc8fd02aa8e5d8b8134ce2439c2d8cc","first_computed_at":"2026-05-18T03:44:02.387192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:02.387192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NVNW31YiaOnW4hlZ+9Vz8iSkQTO/G8uBZnpSAkc/5B7VjQo5Tpc2MZGEyTDQhVqyMY8nZNI7j5/lArfxREy1Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:02.387833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.2172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6fcf5616ddd8a31ad16491300fd127f8eb0ed1e20a6ed289ebe89bf28410e2a","sha256:198acc4bd1e04560298df57ac6d815fad7e910bf087d7c4fbd9100dbad6b2483"],"state_sha256":"16a311ab2548a803b3b651cf0eed35edc78cadebf746b47127381c47c34a63ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/5tLo4WgdM3KiQ2i+53B+BXlBgv0im62GoxXsrsPMACYIZxw3cATixvT0VewZq32KPOCWOwJJfqBlg99sAGCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:46:19.222102Z","bundle_sha256":"d6c41756dcfd5206da5e2fd2d0642d52a7c6f4c8765ec5a09689950e4f5aecce"}}