{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:FJQA4CTPAVOGVVXANJTDPW6ZTU","short_pith_number":"pith:FJQA4CTP","canonical_record":{"source":{"id":"2112.09752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T20:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"7dd1823f463789b65f09f2f78a05d70197f9f12451960457fe351424a74e0d12","abstract_canon_sha256":"de42d02ef6cd3bedbfff5f75273c25c1133b4280857b53dbf75fb72a16d43667"},"schema_version":"1.0"},"canonical_sha256":"2a600e0a6f055c6ad6e06a6637dbd99d3991e1c2cbc18b592161df39e4be39a7","source":{"kind":"arxiv","id":"2112.09752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09752","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09752v1","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09752","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"FJQA4CTPAVOG","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"FJQA4CTPAVOGVVXA","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"FJQA4CTP","created_at":"2026-07-05T03:41:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:FJQA4CTPAVOGVVXANJTDPW6ZTU","target":"record","payload":{"canonical_record":{"source":{"id":"2112.09752","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T20:27:34Z","cross_cats_sorted":[],"title_canon_sha256":"7dd1823f463789b65f09f2f78a05d70197f9f12451960457fe351424a74e0d12","abstract_canon_sha256":"de42d02ef6cd3bedbfff5f75273c25c1133b4280857b53dbf75fb72a16d43667"},"schema_version":"1.0"},"canonical_sha256":"2a600e0a6f055c6ad6e06a6637dbd99d3991e1c2cbc18b592161df39e4be39a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:50.619807Z","signature_b64":"89HasQG+PbS0zXHk2hqOznzM3XNRoyuM5d22n9rCAjzUoa13Fa7ewWLe4oiO6kkO6CewZtCAVQBCahLQxLhxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a600e0a6f055c6ad6e06a6637dbd99d3991e1c2cbc18b592161df39e4be39a7","last_reissued_at":"2026-07-05T03:41:50.619397Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:50.619397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2112.09752","source_version":1,"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-05T03:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqqfYkOEOQUuzO58GgAD2hYkxoAEbQYDhVrS7GTnUCpG6SfAEZR1r5AlWcICZY6fFbNXnefVeXHk79o+Te/5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:17:03.785038Z"},"content_sha256":"69ec11340009b7ed959f94d91a95f4a585e758494d982aa2c502a51077de1290","schema_version":"1.0","event_id":"sha256:69ec11340009b7ed959f94d91a95f4a585e758494d982aa2c502a51077de1290"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:FJQA4CTPAVOGVVXANJTDPW6ZTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Set Twister for Single-hop Node Classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bruno Ribeiro, Vinayak Rao, Yangze Zhou","submitted_at":"2021-12-17T20:27:34Z","abstract_excerpt":"Node classification is a central task in relational learning, with the current state-of-the-art hinging on two key principles: (i) predictions are permutation-invariant to the ordering of a node's neighbors, and (ii) predictions are a function of the node's $r$-hop neighborhood topology and attributes, $r \\geq 2$. Both graph neural networks and collective inference methods (e.g., belief propagation) rely on information from up to $r$-hops away. In this work, we study if the use of more powerful permutation-invariant functions can sometimes avoid the need for classifiers to collect information "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09752","kind":"arxiv","version":1},"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/2112.09752/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-05T03:41:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAScc3jqkg+qpY3pm+74vrgqf2MLOw5AqpIpFWe6s7xm3bLZSDyNqMgwolIveDOgePyf4EcVEadYYPmbsMKdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:17:03.785690Z"},"content_sha256":"b477c0bbc14fea8f88f0ceec28622708da9b0934abf8cd03fdb90124217fa88b","schema_version":"1.0","event_id":"sha256:b477c0bbc14fea8f88f0ceec28622708da9b0934abf8cd03fdb90124217fa88b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/bundle.json","state_url":"https://pith.science/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/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-05T12:17:03Z","links":{"resolver":"https://pith.science/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU","bundle":"https://pith.science/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/bundle.json","state":"https://pith.science/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJQA4CTPAVOGVVXANJTDPW6ZTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FJQA4CTPAVOGVVXANJTDPW6ZTU","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":"de42d02ef6cd3bedbfff5f75273c25c1133b4280857b53dbf75fb72a16d43667","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T20:27:34Z","title_canon_sha256":"7dd1823f463789b65f09f2f78a05d70197f9f12451960457fe351424a74e0d12"},"schema_version":"1.0","source":{"id":"2112.09752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2112.09752","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"arxiv_version","alias_value":"2112.09752v1","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.09752","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_12","alias_value":"FJQA4CTPAVOG","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_16","alias_value":"FJQA4CTPAVOGVVXA","created_at":"2026-07-05T03:41:50Z"},{"alias_kind":"pith_short_8","alias_value":"FJQA4CTP","created_at":"2026-07-05T03:41:50Z"}],"graph_snapshots":[{"event_id":"sha256:b477c0bbc14fea8f88f0ceec28622708da9b0934abf8cd03fdb90124217fa88b","target":"graph","created_at":"2026-07-05T03:41:50Z","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/2112.09752/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Node classification is a central task in relational learning, with the current state-of-the-art hinging on two key principles: (i) predictions are permutation-invariant to the ordering of a node's neighbors, and (ii) predictions are a function of the node's $r$-hop neighborhood topology and attributes, $r \\geq 2$. Both graph neural networks and collective inference methods (e.g., belief propagation) rely on information from up to $r$-hops away. In this work, we study if the use of more powerful permutation-invariant functions can sometimes avoid the need for classifiers to collect information ","authors_text":"Bruno Ribeiro, Vinayak Rao, Yangze Zhou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T20:27:34Z","title":"Set Twister for Single-hop Node Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.09752","kind":"arxiv","version":1},"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:69ec11340009b7ed959f94d91a95f4a585e758494d982aa2c502a51077de1290","target":"record","created_at":"2026-07-05T03:41:50Z","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":"de42d02ef6cd3bedbfff5f75273c25c1133b4280857b53dbf75fb72a16d43667","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-12-17T20:27:34Z","title_canon_sha256":"7dd1823f463789b65f09f2f78a05d70197f9f12451960457fe351424a74e0d12"},"schema_version":"1.0","source":{"id":"2112.09752","kind":"arxiv","version":1}},"canonical_sha256":"2a600e0a6f055c6ad6e06a6637dbd99d3991e1c2cbc18b592161df39e4be39a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a600e0a6f055c6ad6e06a6637dbd99d3991e1c2cbc18b592161df39e4be39a7","first_computed_at":"2026-07-05T03:41:50.619397Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:41:50.619397Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"89HasQG+PbS0zXHk2hqOznzM3XNRoyuM5d22n9rCAjzUoa13Fa7ewWLe4oiO6kkO6CewZtCAVQBCahLQxLhxDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:41:50.619807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2112.09752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69ec11340009b7ed959f94d91a95f4a585e758494d982aa2c502a51077de1290","sha256:b477c0bbc14fea8f88f0ceec28622708da9b0934abf8cd03fdb90124217fa88b"],"state_sha256":"f299e8a01c3ebf9045ee785519b2d9891c6124e5665a12a4edc83f127ec4fc95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C97iPwNnVlWglkgeiHM0GTri6Q8o8cPS1CgU3gQ8uN5Qq0bqHLtfTls9TZ6v179RxUZ8Z3bAEarLlUZI87UYBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:17:03.789082Z","bundle_sha256":"80ad49fecf2d14fc9f9909976825030988e361469c73f373dfd6bf0dd99efbf7"}}