{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4J6CDTV3WP42REP3ZDMARPE3RJ","short_pith_number":"pith:4J6CDTV3","schema_version":"1.0","canonical_sha256":"e27c21cebbb3f9a891fbc8d808bc9b8a4c3b23d3c127aabdf7668774d85d9576","source":{"kind":"arxiv","id":"2512.15570","version":2},"attestation_state":"computed","paper":{"title":"Optimal Transport-Based Clustering of Attributed Graphs with an Application to Road Traffic Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ioana Gavra, Ketsia Guichard-Sustowski, Lo\\\"ic Le Marrec","submitted_at":"2025-12-17T16:25:42Z","abstract_excerpt":"In many real-world contexts, such as social or transport networks, data exhibit both structural connectivity and node-level attributes. For example, roads in a transport network can be characterized not only by their connectivity but also by traffic flow or speed profiles. Understanding such systems therefore requires jointly analyzing the network structure and node attributes, a challenge addressed by attributed graph partitioning, which clusters nodes according on both connectivity and attributes. In this work, we adapt transport-based approaches based on Gromov--Wasserstein (GW) discrepancy"},"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":"2512.15570","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ME","submitted_at":"2025-12-17T16:25:42Z","cross_cats_sorted":[],"title_canon_sha256":"188e42eda176928baf1fa46d6849460bd16229d2163fbb3efa0eb7e95a733b81","abstract_canon_sha256":"71dbc9e5ea68ec3a57b186864ee9cc20f48042d0227388d6dba2e4b13424efd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:18:36.287610Z","signature_b64":"SA/dJ0Cri53gujbZ2iAh3p4C/w4dUnilq5UTDN/PPAjkUCQk6P2opeZuKr4grIY5UQMrx/tTtw9RxHvUJk/TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27c21cebbb3f9a891fbc8d808bc9b8a4c3b23d3c127aabdf7668774d85d9576","last_reissued_at":"2026-06-25T01:18:36.287124Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:18:36.287124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Transport-Based Clustering of Attributed Graphs with an Application to Road Traffic Data","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Ioana Gavra, Ketsia Guichard-Sustowski, Lo\\\"ic Le Marrec","submitted_at":"2025-12-17T16:25:42Z","abstract_excerpt":"In many real-world contexts, such as social or transport networks, data exhibit both structural connectivity and node-level attributes. For example, roads in a transport network can be characterized not only by their connectivity but also by traffic flow or speed profiles. Understanding such systems therefore requires jointly analyzing the network structure and node attributes, a challenge addressed by attributed graph partitioning, which clusters nodes according on both connectivity and attributes. In this work, we adapt transport-based approaches based on Gromov--Wasserstein (GW) discrepancy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.15570","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.15570/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":"2512.15570","created_at":"2026-06-25T01:18:36.287182+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.15570v2","created_at":"2026-06-25T01:18:36.287182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.15570","created_at":"2026-06-25T01:18:36.287182+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J6CDTV3WP42","created_at":"2026-06-25T01:18:36.287182+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J6CDTV3WP42REP3","created_at":"2026-06-25T01:18:36.287182+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J6CDTV3","created_at":"2026-06-25T01:18:36.287182+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/4J6CDTV3WP42REP3ZDMARPE3RJ","json":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ.json","graph_json":"https://pith.science/api/pith-number/4J6CDTV3WP42REP3ZDMARPE3RJ/graph.json","events_json":"https://pith.science/api/pith-number/4J6CDTV3WP42REP3ZDMARPE3RJ/events.json","paper":"https://pith.science/paper/4J6CDTV3"},"agent_actions":{"view_html":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ","download_json":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ.json","view_paper":"https://pith.science/paper/4J6CDTV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.15570&json=true","fetch_graph":"https://pith.science/api/pith-number/4J6CDTV3WP42REP3ZDMARPE3RJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4J6CDTV3WP42REP3ZDMARPE3RJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ/action/storage_attestation","attest_author":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ/action/author_attestation","sign_citation":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ/action/citation_signature","submit_replication":"https://pith.science/pith/4J6CDTV3WP42REP3ZDMARPE3RJ/action/replication_record"}},"created_at":"2026-06-25T01:18:36.287182+00:00","updated_at":"2026-06-25T01:18:36.287182+00:00"}