{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:M3T57VGSV76DEFI6NV6PV33KU4","short_pith_number":"pith:M3T57VGS","canonical_record":{"source":{"id":"2206.00637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T17:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"ca602c33b53f8fbf1f7df18358cc4f6f0878e68e51df297f4b07cff880f19a66","abstract_canon_sha256":"7b09c509192588d3767989dc5351a06e263758b1354ffb6c017f2bb1b6c7e352"},"schema_version":"1.0"},"canonical_sha256":"66e7dfd4d2affc32151e6d7cfaef6aa71c154034ff75d224f10a8c78cd42cc16","source":{"kind":"arxiv","id":"2206.00637","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00637","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00637v2","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00637","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"M3T57VGSV76D","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_16","alias_value":"M3T57VGSV76DEFI6","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_8","alias_value":"M3T57VGS","created_at":"2026-07-05T04:58:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:M3T57VGSV76DEFI6NV6PV33KU4","target":"record","payload":{"canonical_record":{"source":{"id":"2206.00637","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T17:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"ca602c33b53f8fbf1f7df18358cc4f6f0878e68e51df297f4b07cff880f19a66","abstract_canon_sha256":"7b09c509192588d3767989dc5351a06e263758b1354ffb6c017f2bb1b6c7e352"},"schema_version":"1.0"},"canonical_sha256":"66e7dfd4d2affc32151e6d7cfaef6aa71c154034ff75d224f10a8c78cd42cc16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:58:16.226776Z","signature_b64":"iFQ+zJo7JL0xAGWPSZ+dgccO+Qjj47hlG7F/qwdIaihqMKIb9BTyEwURvRPAKMh/veAq9DPUIKU8IfI2rJh2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66e7dfd4d2affc32151e6d7cfaef6aa71c154034ff75d224f10a8c78cd42cc16","last_reissued_at":"2026-07-05T04:58:16.226260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:58:16.226260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.00637","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-05T04:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zN9vOmbc3wDuxyEDg6vRrsnjQUOEpk77w9AgxtgHwrAg4VxnU5PtXc/h5etx3+ApW+mgf03usok6o4AEFGySDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:04:43.153670Z"},"content_sha256":"25859136baa6699ea7d668783455bbc1f00c21d15d21954106358f338ac563bc","schema_version":"1.0","event_id":"sha256:25859136baa6699ea7d668783455bbc1f00c21d15d21954106358f338ac563bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:M3T57VGSV76DEFI6NV6PV33KU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Neural Networks with Precomputed Node Features","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Beni Egressy, Roger Wattenhofer","submitted_at":"2022-06-01T17:16:37Z","abstract_excerpt":"Most Graph Neural Networks (GNNs) cannot distinguish some graphs or indeed some pairs of nodes within a graph. This makes it impossible to solve certain classification tasks. However, adding additional node features to these models can resolve this problem. We introduce several such augmentations, including (i) positional node embeddings, (ii) canonical node IDs, and (iii) random features. These extensions are motivated by theoretical results and corroborated by extensive testing on synthetic subgraph detection tasks. We find that positional embeddings significantly outperform other extensions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00637","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/2206.00637/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-05T04:58:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWqobD+JvvgZWtR3K5Q9l9FQzN+RSivxGPAU2dotHp+8QINazHri9+3SI6lIf/kFNCrY8QcTB6RucbnLKWEhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T19:04:43.154304Z"},"content_sha256":"74e6d48d222833dd3177b7882e94c62f5b11fbf5877c7c9023a7a1ab4694c1c1","schema_version":"1.0","event_id":"sha256:74e6d48d222833dd3177b7882e94c62f5b11fbf5877c7c9023a7a1ab4694c1c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3T57VGSV76DEFI6NV6PV33KU4/bundle.json","state_url":"https://pith.science/pith/M3T57VGSV76DEFI6NV6PV33KU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3T57VGSV76DEFI6NV6PV33KU4/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-22T19:04:43Z","links":{"resolver":"https://pith.science/pith/M3T57VGSV76DEFI6NV6PV33KU4","bundle":"https://pith.science/pith/M3T57VGSV76DEFI6NV6PV33KU4/bundle.json","state":"https://pith.science/pith/M3T57VGSV76DEFI6NV6PV33KU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3T57VGSV76DEFI6NV6PV33KU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:M3T57VGSV76DEFI6NV6PV33KU4","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":"7b09c509192588d3767989dc5351a06e263758b1354ffb6c017f2bb1b6c7e352","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T17:16:37Z","title_canon_sha256":"ca602c33b53f8fbf1f7df18358cc4f6f0878e68e51df297f4b07cff880f19a66"},"schema_version":"1.0","source":{"id":"2206.00637","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00637","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00637v2","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00637","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_12","alias_value":"M3T57VGSV76D","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_16","alias_value":"M3T57VGSV76DEFI6","created_at":"2026-07-05T04:58:16Z"},{"alias_kind":"pith_short_8","alias_value":"M3T57VGS","created_at":"2026-07-05T04:58:16Z"}],"graph_snapshots":[{"event_id":"sha256:74e6d48d222833dd3177b7882e94c62f5b11fbf5877c7c9023a7a1ab4694c1c1","target":"graph","created_at":"2026-07-05T04:58:16Z","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/2206.00637/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most Graph Neural Networks (GNNs) cannot distinguish some graphs or indeed some pairs of nodes within a graph. This makes it impossible to solve certain classification tasks. However, adding additional node features to these models can resolve this problem. We introduce several such augmentations, including (i) positional node embeddings, (ii) canonical node IDs, and (iii) random features. These extensions are motivated by theoretical results and corroborated by extensive testing on synthetic subgraph detection tasks. We find that positional embeddings significantly outperform other extensions","authors_text":"Beni Egressy, Roger Wattenhofer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T17:16:37Z","title":"Graph Neural Networks with Precomputed Node Features"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00637","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:25859136baa6699ea7d668783455bbc1f00c21d15d21954106358f338ac563bc","target":"record","created_at":"2026-07-05T04:58:16Z","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":"7b09c509192588d3767989dc5351a06e263758b1354ffb6c017f2bb1b6c7e352","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-06-01T17:16:37Z","title_canon_sha256":"ca602c33b53f8fbf1f7df18358cc4f6f0878e68e51df297f4b07cff880f19a66"},"schema_version":"1.0","source":{"id":"2206.00637","kind":"arxiv","version":2}},"canonical_sha256":"66e7dfd4d2affc32151e6d7cfaef6aa71c154034ff75d224f10a8c78cd42cc16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66e7dfd4d2affc32151e6d7cfaef6aa71c154034ff75d224f10a8c78cd42cc16","first_computed_at":"2026-07-05T04:58:16.226260Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:58:16.226260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFQ+zJo7JL0xAGWPSZ+dgccO+Qjj47hlG7F/qwdIaihqMKIb9BTyEwURvRPAKMh/veAq9DPUIKU8IfI2rJh2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:58:16.226776Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.00637","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25859136baa6699ea7d668783455bbc1f00c21d15d21954106358f338ac563bc","sha256:74e6d48d222833dd3177b7882e94c62f5b11fbf5877c7c9023a7a1ab4694c1c1"],"state_sha256":"bca1473f3e074a3b505232a765b6908d527ce211382d689b8902124ae248c907"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MhH6fw+gCycwtuCAmV7PhWXD1UmEtb88z66Jkaox64kQwK4RYVAeFjfkLg1vbHucepA+igiLZrFcq1W+ne87BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T19:04:43.159262Z","bundle_sha256":"6da0a7c9526dbaaba565705db1b8c74bc4a05e788c1fe4501c8f64472a764268"}}