{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:SJ46TS7FRZNDYZ4U36ZNVEK6R7","short_pith_number":"pith:SJ46TS7F","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"},"canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","source":{"kind":"arxiv","id":"2207.08779","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.08779","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.08779v2","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08779","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"SJ46TS7FRZND","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"SJ46TS7FRZNDYZ4U","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"SJ46TS7F","created_at":"2026-07-05T05:19:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:SJ46TS7FRZNDYZ4U36ZNVEK6R7","target":"record","payload":{"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"},"canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","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"},"source_kind":"arxiv","source_id":"2207.08779","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-07-05T05:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i5oUoGk6JIh/dwNJLGXo1/NxSN0u2Th54lu2B4fDti7X9Tf6J1IR8VVVUgWMQlE2kbGkHtq1tjgzI8JvrIAMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:25:37.797506Z"},"content_sha256":"4cacca5bdfa4e268c1dd8fd20142cf05c11e9aade18b8e8b4e63d5b9c3fcee8b","schema_version":"1.0","event_id":"sha256:4cacca5bdfa4e268c1dd8fd20142cf05c11e9aade18b8e8b4e63d5b9c3fcee8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:SJ46TS7FRZNDYZ4U36ZNVEK6R7","target":"graph","payload":{"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"},"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-07-05T05:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O55IHOowvubptNVRQVbWc6N+kg/UsGh2UW90HBl5bu+j++JvOxmtXDZzfTDOp1lrgX16x732W8QnHneon5ARDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T06:25:37.798560Z"},"content_sha256":"a42b911497abcb6be808c2903542522a17db4476f8a1bfc6976a481ac84d8c8a","schema_version":"1.0","event_id":"sha256:a42b911497abcb6be808c2903542522a17db4476f8a1bfc6976a481ac84d8c8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/bundle.json","state_url":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/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-08-19T06:25:37Z","links":{"resolver":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7","bundle":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/bundle.json","state":"https://pith.science/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJ46TS7FRZNDYZ4U36ZNVEK6R7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:SJ46TS7FRZNDYZ4U36ZNVEK6R7","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":"4a0fe7cb57c0aa458d0b88a1c23a45c9c4f22b78a31c5414b6ecc977e0cbdb54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T17:36:54Z","title_canon_sha256":"b6735af2bc4e74c0913771aaf6551c487854fe183651db0f4a1195cec0278782"},"schema_version":"1.0","source":{"id":"2207.08779","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.08779","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"2207.08779v2","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.08779","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"SJ46TS7FRZND","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"SJ46TS7FRZNDYZ4U","created_at":"2026-07-05T05:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"SJ46TS7F","created_at":"2026-07-05T05:19:35Z"}],"graph_snapshots":[{"event_id":"sha256:a42b911497abcb6be808c2903542522a17db4476f8a1bfc6976a481ac84d8c8a","target":"graph","created_at":"2026-07-05T05:19:35Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.08779/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Filippo Maria Bianchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T17:36:54Z","title":"Simplifying Clustering with Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.08779","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:4cacca5bdfa4e268c1dd8fd20142cf05c11e9aade18b8e8b4e63d5b9c3fcee8b","target":"record","created_at":"2026-07-05T05:19:35Z","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":"4a0fe7cb57c0aa458d0b88a1c23a45c9c4f22b78a31c5414b6ecc977e0cbdb54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-18T17:36:54Z","title_canon_sha256":"b6735af2bc4e74c0913771aaf6551c487854fe183651db0f4a1195cec0278782"},"schema_version":"1.0","source":{"id":"2207.08779","kind":"arxiv","version":2}},"canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9279e9cbe58e5a3c6794dfb2da915e8ff89d5cd04373774df52d819230f5894c","first_computed_at":"2026-07-05T05:19:35.951749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:19:35.951749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xsnkERAWRvABS4RySttD84lnoUPbOATahseUd4m5YDPuE6fyy3GRFHdboJd2JH4Wa5waF1LAWAlj6fu8mzRSCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:19:35.952229Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.08779","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cacca5bdfa4e268c1dd8fd20142cf05c11e9aade18b8e8b4e63d5b9c3fcee8b","sha256:a42b911497abcb6be808c2903542522a17db4476f8a1bfc6976a481ac84d8c8a"],"state_sha256":"5127e08ccbb6a4abb81f7a351af51e14dd0fa483b60c342245b1757f994e1a3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uolO0nSaV2eG3rD7AJYimd0ujWnlWmjzEe3WdzJPWL/RYXWQSttYGG0Ly8NCHy1mT+cTOaoSM74fiGZK09yDDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T06:25:37.808322Z","bundle_sha256":"f024d75e757b221eef190f5b837d9a9db503e08a9411a34638ec59399ce25fd1"}}