{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CGMGJ6TZSA36EXBYDQM2GXVQJK","short_pith_number":"pith:CGMGJ6TZ","canonical_record":{"source":{"id":"1511.01281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-04T10:47:29Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"1dda4247ddbe1a7436431949aaad5a8bb4b6a2afdf6d0a60279e891d421e0421","abstract_canon_sha256":"40a2c626d7f6390b5d9274aa11867cc5b003ca0463ccc227554072676b7a769c"},"schema_version":"1.0"},"canonical_sha256":"119864fa799037e25c381c19a35eb04aaaa2972f5a1e3f32a0cf416ee21074e6","source":{"kind":"arxiv","id":"1511.01281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01281","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01281v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01281","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"CGMGJ6TZSA36","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CGMGJ6TZSA36EXBY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CGMGJ6TZ","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CGMGJ6TZSA36EXBYDQM2GXVQJK","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-04T10:47:29Z","cross_cats_sorted":["cs.DB","cs.LG"],"title_canon_sha256":"1dda4247ddbe1a7436431949aaad5a8bb4b6a2afdf6d0a60279e891d421e0421","abstract_canon_sha256":"40a2c626d7f6390b5d9274aa11867cc5b003ca0463ccc227554072676b7a769c"},"schema_version":"1.0"},"canonical_sha256":"119864fa799037e25c381c19a35eb04aaaa2972f5a1e3f32a0cf416ee21074e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:47.590489Z","signature_b64":"dosZFpxlj7uGJyjLkI7grkYwl7d6MWqP3SYcK6lawTFoH5qTctA4xl/Evx1HklD4ivq509DQCwma7hyeQ0aHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119864fa799037e25c381c19a35eb04aaaa2972f5a1e3f32a0cf416ee21074e6","last_reissued_at":"2026-05-18T01:27:47.589971Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:47.589971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01281","source_version":1,"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-18T01:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njq5/L9bTW0piSTPqVpwDhduGonyvhWSYve5bhaRF2hMk3nvJyl1enO9MRxDDDf8yiz5CuTl+Jy5t/27IArmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:12:41.657707Z"},"content_sha256":"cad89f11fb04ebaca5f6051d32b52a5eeb2e43eb06a51fc4c514a153477a30d4","schema_version":"1.0","event_id":"sha256:cad89f11fb04ebaca5f6051d32b52a5eeb2e43eb06a51fc4c514a153477a30d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CGMGJ6TZSA36EXBYDQM2GXVQJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Co-Clustering Network-Constrained Trajectory Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.LG"],"primary_cat":"stat.ML","authors_text":"Fabrice Rossi (SAMM), Marc Boull\\'e, Mohamed Khalil El Mahrsi (LTCI, Romain Guigour\\`es (SAMM), SAMM)","submitted_at":"2015-11-04T10:47:29Z","abstract_excerpt":"Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajectories of vehicles whose movement is restricted by the underlying road network. We model relations between these trajectories and road segments as a bipartite graph and we try to cluster its vertices. We demonstrate our approaches on synthetic data and show how it could be useful"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01281","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"},"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-18T01:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgKct5tPMFeKEBRsYgVltvULtNRh8hIh18+XeDRHfg1KJN+V7CnxeoUkqb6YOj8iCiw9fPaBOglAVciuRSKEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:12:41.658380Z"},"content_sha256":"157fb959457b96ac2298ae50a3790fc0a4eeb19cd35535dd7552b1e845af8b01","schema_version":"1.0","event_id":"sha256:157fb959457b96ac2298ae50a3790fc0a4eeb19cd35535dd7552b1e845af8b01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/bundle.json","state_url":"https://pith.science/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/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-26T05:12:41Z","links":{"resolver":"https://pith.science/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK","bundle":"https://pith.science/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/bundle.json","state":"https://pith.science/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGMGJ6TZSA36EXBYDQM2GXVQJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CGMGJ6TZSA36EXBYDQM2GXVQJK","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":"40a2c626d7f6390b5d9274aa11867cc5b003ca0463ccc227554072676b7a769c","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-04T10:47:29Z","title_canon_sha256":"1dda4247ddbe1a7436431949aaad5a8bb4b6a2afdf6d0a60279e891d421e0421"},"schema_version":"1.0","source":{"id":"1511.01281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01281","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01281v1","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01281","created_at":"2026-05-18T01:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"CGMGJ6TZSA36","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CGMGJ6TZSA36EXBY","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CGMGJ6TZ","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:157fb959457b96ac2298ae50a3790fc0a4eeb19cd35535dd7552b1e845af8b01","target":"graph","created_at":"2026-05-18T01:27:47Z","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":"Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajectories of vehicles whose movement is restricted by the underlying road network. We model relations between these trajectories and road segments as a bipartite graph and we try to cluster its vertices. We demonstrate our approaches on synthetic data and show how it could be useful","authors_text":"Fabrice Rossi (SAMM), Marc Boull\\'e, Mohamed Khalil El Mahrsi (LTCI, Romain Guigour\\`es (SAMM), SAMM)","cross_cats":["cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-04T10:47:29Z","title":"Co-Clustering Network-Constrained Trajectory Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01281","kind":"arxiv","version":1},"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:cad89f11fb04ebaca5f6051d32b52a5eeb2e43eb06a51fc4c514a153477a30d4","target":"record","created_at":"2026-05-18T01:27:47Z","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":"40a2c626d7f6390b5d9274aa11867cc5b003ca0463ccc227554072676b7a769c","cross_cats_sorted":["cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-11-04T10:47:29Z","title_canon_sha256":"1dda4247ddbe1a7436431949aaad5a8bb4b6a2afdf6d0a60279e891d421e0421"},"schema_version":"1.0","source":{"id":"1511.01281","kind":"arxiv","version":1}},"canonical_sha256":"119864fa799037e25c381c19a35eb04aaaa2972f5a1e3f32a0cf416ee21074e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119864fa799037e25c381c19a35eb04aaaa2972f5a1e3f32a0cf416ee21074e6","first_computed_at":"2026-05-18T01:27:47.589971Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:47.589971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dosZFpxlj7uGJyjLkI7grkYwl7d6MWqP3SYcK6lawTFoH5qTctA4xl/Evx1HklD4ivq509DQCwma7hyeQ0aHDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:47.590489Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad89f11fb04ebaca5f6051d32b52a5eeb2e43eb06a51fc4c514a153477a30d4","sha256:157fb959457b96ac2298ae50a3790fc0a4eeb19cd35535dd7552b1e845af8b01"],"state_sha256":"425ccf9f87a394c0e389da63fef3cc963c64c4514d4e9e82626a8998dd5cdfde"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpXkwnXIodf6GN6pWJSIhv8WCgabJPcJwojRXXChDGeiB22oKeMVE47loMvkGXStlCZHCUy3Fv4alHvU6JlUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:12:41.661586Z","bundle_sha256":"e5c2d835d63ff631de996c9e2b9f6044cd066069507130b4e5942d298b80508b"}}