{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UPISJMKZAMIQFC6T2MUW2U4MLE","short_pith_number":"pith:UPISJMKZ","schema_version":"1.0","canonical_sha256":"a3d124b1590311028bd3d3296d538c5938d0afd095320ce56d249e79b67e1c5d","source":{"kind":"arxiv","id":"2412.13592","version":2},"attestation_state":"computed","paper":{"title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Etienne Lasalle (OCKHAM), M\\`arton Karsai (CEU), Paulo Gon\\c{c}alves (OCKHAM), Pierre Borgnat (Phys-ENS), R\\'emi Gribonval (OCKHAM), R\\'emi Vaudaine (OCKHAM), Titouan Vayer (OCKHAM)","submitted_at":"2024-12-18T08:15:55Z","abstract_excerpt":"Clustering the nodes of a graph is a cornerstone of graph analysis and has been extensively studied. However, some popular methods are not suitable for very large graphs: e.g., spectral clustering requires the computation of the spectral decomposition of the Laplacian matrix, which is not applicable for large graphs with a large number of communities. This work introduces PASCO, an overlay that accelerates clustering algorithms. Our method consists of three steps: 1-We compute several independent small graphs representing the input graph by applying an efficient and structure-preserving coarse"},"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":"2412.13592","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-18T08:15:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dc364e7a211a5a20233e41d5287a233f97b94c45c08cf8052124656618b73601","abstract_canon_sha256":"166df80d317e7188a089ded0db1d9f2195ec287a461c6c5bfa23497fd8df90ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:20:07.098294Z","signature_b64":"kB7/BeDcXHtIAsbBIBMDKa0DIESVEG+fFIfaT57fCJkbOURGw/6121969qnPU1Qewb0tqIGglUMSt/y+J2waCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3d124b1590311028bd3d3296d538c5938d0afd095320ce56d249e79b67e1c5d","last_reissued_at":"2026-07-05T11:20:07.097730Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:20:07.097730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PASCO (PArallel Structured COarsening): an overlay to speed up graph clustering algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Etienne Lasalle (OCKHAM), M\\`arton Karsai (CEU), Paulo Gon\\c{c}alves (OCKHAM), Pierre Borgnat (Phys-ENS), R\\'emi Gribonval (OCKHAM), R\\'emi Vaudaine (OCKHAM), Titouan Vayer (OCKHAM)","submitted_at":"2024-12-18T08:15:55Z","abstract_excerpt":"Clustering the nodes of a graph is a cornerstone of graph analysis and has been extensively studied. However, some popular methods are not suitable for very large graphs: e.g., spectral clustering requires the computation of the spectral decomposition of the Laplacian matrix, which is not applicable for large graphs with a large number of communities. This work introduces PASCO, an overlay that accelerates clustering algorithms. Our method consists of three steps: 1-We compute several independent small graphs representing the input graph by applying an efficient and structure-preserving coarse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.13592","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/2412.13592/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":"2412.13592","created_at":"2026-07-05T11:20:07.097806+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.13592v2","created_at":"2026-07-05T11:20:07.097806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.13592","created_at":"2026-07-05T11:20:07.097806+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPISJMKZAMIQ","created_at":"2026-07-05T11:20:07.097806+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPISJMKZAMIQFC6T","created_at":"2026-07-05T11:20:07.097806+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPISJMKZ","created_at":"2026-07-05T11:20:07.097806+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/UPISJMKZAMIQFC6T2MUW2U4MLE","json":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE.json","graph_json":"https://pith.science/api/pith-number/UPISJMKZAMIQFC6T2MUW2U4MLE/graph.json","events_json":"https://pith.science/api/pith-number/UPISJMKZAMIQFC6T2MUW2U4MLE/events.json","paper":"https://pith.science/paper/UPISJMKZ"},"agent_actions":{"view_html":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE","download_json":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE.json","view_paper":"https://pith.science/paper/UPISJMKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.13592&json=true","fetch_graph":"https://pith.science/api/pith-number/UPISJMKZAMIQFC6T2MUW2U4MLE/graph.json","fetch_events":"https://pith.science/api/pith-number/UPISJMKZAMIQFC6T2MUW2U4MLE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE/action/storage_attestation","attest_author":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE/action/author_attestation","sign_citation":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE/action/citation_signature","submit_replication":"https://pith.science/pith/UPISJMKZAMIQFC6T2MUW2U4MLE/action/replication_record"}},"created_at":"2026-07-05T11:20:07.097806+00:00","updated_at":"2026-07-05T11:20:07.097806+00:00"}