{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:32ZLT4YQSR52R2EZGAHFDGBPIO","short_pith_number":"pith:32ZLT4YQ","canonical_record":{"source":{"id":"2310.01267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T15:08:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5a3b8009c87267f1233e2b4c74b6fad8ef74d5956fac82650e71052d8c0936d1","abstract_canon_sha256":"96b6d4ff69637bad6f5c6d13091febf4a0d2c3928c72747610ecc1b5f4f4a732"},"schema_version":"1.0"},"canonical_sha256":"deb2b9f310947ba8e899300e51982f43804dd42a701e17058ce7baa33144f12c","source":{"kind":"arxiv","id":"2310.01267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01267","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01267v2","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01267","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"32ZLT4YQSR52","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"32ZLT4YQSR52R2EZ","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"32ZLT4YQ","created_at":"2026-07-05T08:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:32ZLT4YQSR52R2EZGAHFDGBPIO","target":"record","payload":{"canonical_record":{"source":{"id":"2310.01267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T15:08:52Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"5a3b8009c87267f1233e2b4c74b6fad8ef74d5956fac82650e71052d8c0936d1","abstract_canon_sha256":"96b6d4ff69637bad6f5c6d13091febf4a0d2c3928c72747610ecc1b5f4f4a732"},"schema_version":"1.0"},"canonical_sha256":"deb2b9f310947ba8e899300e51982f43804dd42a701e17058ce7baa33144f12c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:17.694137Z","signature_b64":"nhZ0kzYs2LYuoW+QtLGflJll+UeWfw2BqB9I4+SF8q0pSVPmAocsttHkdJk+FDg0yKK0uUvK3Sx+4wDB7V5iCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb2b9f310947ba8e899300e51982f43804dd42a701e17058ce7baa33144f12c","last_reissued_at":"2026-07-05T08:29:17.693662Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:17.693662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.01267","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-05T08:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+FwIjPCSahHDrU8kbEAE5dIHc89T3HJheMNycehbp/EnGCsmJ5blDDKuFIqQmpLnGSeV/YptzAGwfOZuWfECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:18:45.733079Z"},"content_sha256":"23ca70e6122f1f73ca60f48017a017536205819aa931bf62e87c5a386d38951e","schema_version":"1.0","event_id":"sha256:23ca70e6122f1f73ca60f48017a017536205819aa931bf62e87c5a386d38951e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:32ZLT4YQSR52R2EZGAHFDGBPIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ben Finkelshtein, \\.Ismail \\.Ilkan Ceylan, Michael Bronstein, Xingyue Huang","submitted_at":"2023-10-02T15:08:52Z","abstract_excerpt":"Graph neural networks are popular architectures for graph machine learning, based on iterative computation of node representations of an input graph through a series of invariant transformations. A large class of graph neural networks follow a standard message-passing paradigm: at every layer, each node state is updated based on an aggregate of messages from its neighborhood. In this work, we propose a novel framework for training graph neural networks, where every node is viewed as a player that can choose to either 'listen', 'broadcast', 'listen and broadcast', or to 'isolate'. The standard "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01267","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/2310.01267/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-05T08:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU7WUxWfsNc3Xp1xZKhXP1lu2SsPlOhFlQTRA4IrE7N39oO5Z2L9rSKKWL1tfUWRWZtmKaisCbpvOYewk2BsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T12:18:45.733603Z"},"content_sha256":"d37911f29238813036ff8e4f1cdd8a2814e6ea4643bd6d8456661812e2da7ffa","schema_version":"1.0","event_id":"sha256:d37911f29238813036ff8e4f1cdd8a2814e6ea4643bd6d8456661812e2da7ffa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/bundle.json","state_url":"https://pith.science/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/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-07T12:18:45Z","links":{"resolver":"https://pith.science/pith/32ZLT4YQSR52R2EZGAHFDGBPIO","bundle":"https://pith.science/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/bundle.json","state":"https://pith.science/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32ZLT4YQSR52R2EZGAHFDGBPIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:32ZLT4YQSR52R2EZGAHFDGBPIO","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":"96b6d4ff69637bad6f5c6d13091febf4a0d2c3928c72747610ecc1b5f4f4a732","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T15:08:52Z","title_canon_sha256":"5a3b8009c87267f1233e2b4c74b6fad8ef74d5956fac82650e71052d8c0936d1"},"schema_version":"1.0","source":{"id":"2310.01267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.01267","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"2310.01267v2","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.01267","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"32ZLT4YQSR52","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"32ZLT4YQSR52R2EZ","created_at":"2026-07-05T08:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"32ZLT4YQ","created_at":"2026-07-05T08:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:d37911f29238813036ff8e4f1cdd8a2814e6ea4643bd6d8456661812e2da7ffa","target":"graph","created_at":"2026-07-05T08:29:17Z","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/2310.01267/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks are popular architectures for graph machine learning, based on iterative computation of node representations of an input graph through a series of invariant transformations. A large class of graph neural networks follow a standard message-passing paradigm: at every layer, each node state is updated based on an aggregate of messages from its neighborhood. In this work, we propose a novel framework for training graph neural networks, where every node is viewed as a player that can choose to either 'listen', 'broadcast', 'listen and broadcast', or to 'isolate'. The standard ","authors_text":"Ben Finkelshtein, \\.Ismail \\.Ilkan Ceylan, Michael Bronstein, Xingyue Huang","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T15:08:52Z","title":"Cooperative Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.01267","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:23ca70e6122f1f73ca60f48017a017536205819aa931bf62e87c5a386d38951e","target":"record","created_at":"2026-07-05T08:29:17Z","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":"96b6d4ff69637bad6f5c6d13091febf4a0d2c3928c72747610ecc1b5f4f4a732","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-02T15:08:52Z","title_canon_sha256":"5a3b8009c87267f1233e2b4c74b6fad8ef74d5956fac82650e71052d8c0936d1"},"schema_version":"1.0","source":{"id":"2310.01267","kind":"arxiv","version":2}},"canonical_sha256":"deb2b9f310947ba8e899300e51982f43804dd42a701e17058ce7baa33144f12c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deb2b9f310947ba8e899300e51982f43804dd42a701e17058ce7baa33144f12c","first_computed_at":"2026-07-05T08:29:17.693662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:17.693662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nhZ0kzYs2LYuoW+QtLGflJll+UeWfw2BqB9I4+SF8q0pSVPmAocsttHkdJk+FDg0yKK0uUvK3Sx+4wDB7V5iCw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:17.694137Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.01267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ca70e6122f1f73ca60f48017a017536205819aa931bf62e87c5a386d38951e","sha256:d37911f29238813036ff8e4f1cdd8a2814e6ea4643bd6d8456661812e2da7ffa"],"state_sha256":"757314d958679855ce540599a42bc0c0e62af016e17c94dabbd333349b10f5a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNRsUc/QIUZ2xJ5wcygv2ENNXN5Hv0jjnYlgvHBnuyk1/jQPL4XJHo4WdHtgw2tMYIiomf9PmE+BixN5XkmpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T12:18:45.738461Z","bundle_sha256":"a9fcfd0859317a7f0d6a6067df52cd19382c5a3cf972da597d17dac03e40daed"}}