{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D5JUQ2JBD5JOY466ZLLJGDOB7M","short_pith_number":"pith:D5JUQ2JB","canonical_record":{"source":{"id":"2402.07845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:53:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c81c6ed14a965e192996a73ad569aeb46a750108509113bc53c1cdcd526f8ebf","abstract_canon_sha256":"f14112bcb0a7e625ff97550fd3b9972075c8dd794fe590b2f35f4da8a6a889e3"},"schema_version":"1.0"},"canonical_sha256":"1f534869211f52ec73decad6930dc1fb1dbfccea710ad26608477e9ee589ea43","source":{"kind":"arxiv","id":"2402.07845","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07845","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07845v2","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07845","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"D5JUQ2JBD5JO","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_16","alias_value":"D5JUQ2JBD5JOY466","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_8","alias_value":"D5JUQ2JB","created_at":"2026-07-05T07:47:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D5JUQ2JBD5JOY466ZLLJGDOB7M","target":"record","payload":{"canonical_record":{"source":{"id":"2402.07845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:53:43Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c81c6ed14a965e192996a73ad569aeb46a750108509113bc53c1cdcd526f8ebf","abstract_canon_sha256":"f14112bcb0a7e625ff97550fd3b9972075c8dd794fe590b2f35f4da8a6a889e3"},"schema_version":"1.0"},"canonical_sha256":"1f534869211f52ec73decad6930dc1fb1dbfccea710ad26608477e9ee589ea43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:47:09.149981Z","signature_b64":"OzoilvuG5fNdZeJqsrhn7Ht2lUgeM8qLuSOmUm/lLPHq8tZbk/oB2kbHyRF1ycp18BajZ7s+wUzG0ARCVccVDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f534869211f52ec73decad6930dc1fb1dbfccea710ad26608477e9ee589ea43","last_reissued_at":"2026-07-05T07:47:09.149506Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:47:09.149506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.07845","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-05T07:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e0qkRz/0QtwUh+Sx090pK59qz6CRxaF3IKnjpIYeOHAg0aR/LCaq51hQCLvjFx+6w3Kwawjy7ql0Xab2qvJaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:27:57.222284Z"},"content_sha256":"e3111ee3e690118362421b929e2ad273c1f5ee53b3172e37ea120e5970b10f63","schema_version":"1.0","event_id":"sha256:e3111ee3e690118362421b929e2ad273c1f5ee53b3172e37ea120e5970b10f63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D5JUQ2JBD5JOY466ZLLJGDOB7M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unsupervised Optimisation of GNNs for Node Clustering","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ryan McConville, William Leeney","submitted_at":"2024-02-12T17:53:43Z","abstract_excerpt":"Graph Neural Networks (GNNs) can be trained to detect communities within a graph by learning from the duality of feature and connectivity information. Currently, the common approach for optimisation of GNNs is to use comparisons to ground-truth for hyperparameter tuning and model selection. In this work, we show that nodes can be clustered into communities with GNNs by solely optimising for modularity, without any comparison to ground-truth. Although modularity is a graph partitioning quality metric, we show that this can be used to optimise GNNs that also encode features without a drop in per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07845","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/2402.07845/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-05T07:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D18VqPzYOo4pGEgBP1zqkUQjbOVPjOPKU6xsnRYXcmB0n2+X6nJ+74QgWFzNsp+ZoABhFC14zRKAzWp5W+a7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T03:27:57.222615Z"},"content_sha256":"eccd95a36b93b37dd2e4b2d73b83b1d8130e1ebde07dc699ddebe551054b8e55","schema_version":"1.0","event_id":"sha256:eccd95a36b93b37dd2e4b2d73b83b1d8130e1ebde07dc699ddebe551054b8e55"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/bundle.json","state_url":"https://pith.science/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/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-21T03:27:57Z","links":{"resolver":"https://pith.science/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M","bundle":"https://pith.science/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/bundle.json","state":"https://pith.science/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5JUQ2JBD5JOY466ZLLJGDOB7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D5JUQ2JBD5JOY466ZLLJGDOB7M","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":"f14112bcb0a7e625ff97550fd3b9972075c8dd794fe590b2f35f4da8a6a889e3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:53:43Z","title_canon_sha256":"c81c6ed14a965e192996a73ad569aeb46a750108509113bc53c1cdcd526f8ebf"},"schema_version":"1.0","source":{"id":"2402.07845","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.07845","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"2402.07845v2","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.07845","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"D5JUQ2JBD5JO","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_16","alias_value":"D5JUQ2JBD5JOY466","created_at":"2026-07-05T07:47:09Z"},{"alias_kind":"pith_short_8","alias_value":"D5JUQ2JB","created_at":"2026-07-05T07:47:09Z"}],"graph_snapshots":[{"event_id":"sha256:eccd95a36b93b37dd2e4b2d73b83b1d8130e1ebde07dc699ddebe551054b8e55","target":"graph","created_at":"2026-07-05T07:47:09Z","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/2402.07845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Neural Networks (GNNs) can be trained to detect communities within a graph by learning from the duality of feature and connectivity information. Currently, the common approach for optimisation of GNNs is to use comparisons to ground-truth for hyperparameter tuning and model selection. In this work, we show that nodes can be clustered into communities with GNNs by solely optimising for modularity, without any comparison to ground-truth. Although modularity is a graph partitioning quality metric, we show that this can be used to optimise GNNs that also encode features without a drop in per","authors_text":"Ryan McConville, William Leeney","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:53:43Z","title":"Unsupervised Optimisation of GNNs for Node Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.07845","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:e3111ee3e690118362421b929e2ad273c1f5ee53b3172e37ea120e5970b10f63","target":"record","created_at":"2026-07-05T07:47:09Z","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":"f14112bcb0a7e625ff97550fd3b9972075c8dd794fe590b2f35f4da8a6a889e3","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-02-12T17:53:43Z","title_canon_sha256":"c81c6ed14a965e192996a73ad569aeb46a750108509113bc53c1cdcd526f8ebf"},"schema_version":"1.0","source":{"id":"2402.07845","kind":"arxiv","version":2}},"canonical_sha256":"1f534869211f52ec73decad6930dc1fb1dbfccea710ad26608477e9ee589ea43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f534869211f52ec73decad6930dc1fb1dbfccea710ad26608477e9ee589ea43","first_computed_at":"2026-07-05T07:47:09.149506Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:47:09.149506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OzoilvuG5fNdZeJqsrhn7Ht2lUgeM8qLuSOmUm/lLPHq8tZbk/oB2kbHyRF1ycp18BajZ7s+wUzG0ARCVccVDw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:47:09.149981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.07845","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3111ee3e690118362421b929e2ad273c1f5ee53b3172e37ea120e5970b10f63","sha256:eccd95a36b93b37dd2e4b2d73b83b1d8130e1ebde07dc699ddebe551054b8e55"],"state_sha256":"f7372cf3bbd28ce04f75988ec8579bd5851107ecdfc17454a06f86987df8ea57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ItiVdU2qThPasO6nApR7fWFZwoMgdDzaL+jnYqwsiHCz0kEtwxVzZG4eZhRX3g+nkIdeJYbkRILEwU36HPsNCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T03:27:57.225846Z","bundle_sha256":"436514e780b7658635a73e2377559b0559a00136a558425584e6e1d09ebaeca6"}}