{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SJ46TS7FRZNDYZ4U36ZNVEK6R7","short_pith_number":"pith:SJ46TS7F","schema_version":"1.0","canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","source":{"kind":"arxiv","id":"2207.08779","version":2},"attestation_state":"computed","paper":{"title":"Simplifying Clustering with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Filippo Maria Bianchi","submitted_at":"2022-07-18T17:36:54Z","abstract_excerpt":"The objective functions used in spectral clustering are usually composed of two terms: i) a term that minimizes the local quadratic variation of the cluster assignments on the graph and; ii) a term that balances the clustering partition and helps avoiding degenerate solutions. This paper shows that a graph neural network, equipped with suitable message passing layers, can generate good cluster assignments by optimizing only a balancing term. Results on attributed graph datasets show the effectiveness of the proposed approach in terms of clustering performance and computation time."},"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":"2207.08779","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T17:36:54Z","cross_cats_sorted":[],"title_canon_sha256":"b6735af2bc4e74c0913771aaf6551c487854fe183651db0f4a1195cec0278782","abstract_canon_sha256":"4a0fe7cb57c0aa458d0b88a1c23a45c9c4f22b78a31c5414b6ecc977e0cbdb54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:35.952229Z","signature_b64":"xsnkERAWRvABS4RySttD84lnoUPbOATahseUd4m5YDPuE6fyy3GRFHdboJd2JH4Wa5waF1LAWAlj6fu8mzRSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","last_reissued_at":"2026-07-05T05:19:35.951749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:35.951749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Clustering with Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Filippo Maria Bianchi","submitted_at":"2022-07-18T17:36:54Z","abstract_excerpt":"The objective functions used in spectral clustering are usually composed of two terms: i) a term that minimizes the local quadratic variation of the cluster assignments on the graph and; ii) a term that balances the clustering partition and helps avoiding degenerate solutions. This paper shows that a graph neural network, equipped with suitable message passing layers, can generate good cluster assignments by optimizing only a balancing term. Results on attributed graph datasets show the effectiveness of the proposed approach in terms of clustering performance and computation time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08779","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/2207.08779/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":"2207.08779","created_at":"2026-07-05T05:19:35.951829+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.08779v2","created_at":"2026-07-05T05:19:35.951829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08779","created_at":"2026-07-05T05:19:35.951829+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ46TS7FRZND","created_at":"2026-07-05T05:19:35.951829+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ46TS7FRZNDYZ4U","created_at":"2026-07-05T05:19:35.951829+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ46TS7F","created_at":"2026-07-05T05:19:35.951829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.12642","citing_title":"Torch Geometric Pool: the PyTorch library for pooling in Graph Neural Networks","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7","json":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7.json","graph_json":"https://pith.science/api/pith-number/SJ46TS7FRZNDYZ4U36ZNVEK6R7/graph.json","events_json":"https://pith.science/api/pith-number/SJ46TS7FRZNDYZ4U36ZNVEK6R7/events.json","paper":"https://pith.science/paper/SJ46TS7F"},"agent_actions":{"view_html":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7","download_json":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7.json","view_paper":"https://pith.science/paper/SJ46TS7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.08779&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ46TS7FRZNDYZ4U36ZNVEK6R7/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ46TS7FRZNDYZ4U36ZNVEK6R7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/action/storage_attestation","attest_author":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/action/author_attestation","sign_citation":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/action/citation_signature","submit_replication":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/action/replication_record"}},"created_at":"2026-07-05T05:19:35.951829+00:00","updated_at":"2026-07-05T05:19:35.951829+00:00"}