{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OXG4CXKC25P2UTG6WH2HVPCWTM","short_pith_number":"pith:OXG4CXKC","canonical_record":{"source":{"id":"2205.12245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T17:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"8973f6dfadcc5628e15bd03a0d4f20873bdd2e2697af83319afcd821c18e680f","abstract_canon_sha256":"8c7180208071e1839c98652a08e701c30b5478873111f83f6932cd53d150e4d8"},"schema_version":"1.0"},"canonical_sha256":"75cdc15d42d75faa4cdeb1f47abc569b3457913d980c7b2631898de4e5bae52f","source":{"kind":"arxiv","id":"2205.12245","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12245","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12245v1","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12245","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"OXG4CXKC25P2","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OXG4CXKC25P2UTG6","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OXG4CXKC","created_at":"2026-07-05T04:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OXG4CXKC25P2UTG6WH2HVPCWTM","target":"record","payload":{"canonical_record":{"source":{"id":"2205.12245","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T17:54:29Z","cross_cats_sorted":[],"title_canon_sha256":"8973f6dfadcc5628e15bd03a0d4f20873bdd2e2697af83319afcd821c18e680f","abstract_canon_sha256":"8c7180208071e1839c98652a08e701c30b5478873111f83f6932cd53d150e4d8"},"schema_version":"1.0"},"canonical_sha256":"75cdc15d42d75faa4cdeb1f47abc569b3457913d980c7b2631898de4e5bae52f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:12.581693Z","signature_b64":"u349z7MpEW7f/q4DsxPRvgoxCvHFDwb+u7C4niImTV5JpsPhv+qBp+zI5AebJp7a3ucNJfRFBpws4yreww8VBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75cdc15d42d75faa4cdeb1f47abc569b3457913d980c7b2631898de4e5bae52f","last_reissued_at":"2026-07-05T04:26:12.581375Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:12.581375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.12245","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-05T04:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tmyjcHr2qSIpaah7Qmin6mvNRwbSl1UvB5r5RXoziin5FtsDudPQSv6lWhPnQusxUBvtvKiVbXFY4Hy2Va6Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:08:04.059748Z"},"content_sha256":"4533dd4307dbb475cc33170ddee42fdba919841c3c42213ff225b436cdbf54f0","schema_version":"1.0","event_id":"sha256:4533dd4307dbb475cc33170ddee42fdba919841c3c42213ff225b436cdbf54f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OXG4CXKC25P2UTG6WH2HVPCWTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Neural Networks for Learning in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lukas Faber, Roger Wattenhofer","submitted_at":"2022-05-24T17:54:29Z","abstract_excerpt":"This paper studies asynchronous message passing (AMP), a new paradigm for applying neural network based learning to graphs. Existing graph neural networks use the synchronous distributed computing model and aggregate their neighbors in each round, which causes problems such as oversmoothing and limits their expressiveness. On the other hand, AMP is based on the asynchronous model, where nodes react to messages of their neighbors individually. We prove that (i) AMP can simulate synchronous GNNs and that (ii) AMP can theoretically distinguish any pair of graphs. We experimentally validate AMP's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12245","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/2205.12245/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:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoAOSplUnlYutbFHGn80pvvZv4fUfl+tuHFILKyJJElkqUjLiRJSmzs0NXjA9+MSvW1rQsYIofu0S1sAubcTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T03:08:04.060370Z"},"content_sha256":"d8e4502536f5654eac5891b88ebd0df7ecdaff1bb689393bfc33e467706e169a","schema_version":"1.0","event_id":"sha256:d8e4502536f5654eac5891b88ebd0df7ecdaff1bb689393bfc33e467706e169a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/bundle.json","state_url":"https://pith.science/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/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-24T03:08:04Z","links":{"resolver":"https://pith.science/pith/OXG4CXKC25P2UTG6WH2HVPCWTM","bundle":"https://pith.science/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/bundle.json","state":"https://pith.science/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXG4CXKC25P2UTG6WH2HVPCWTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OXG4CXKC25P2UTG6WH2HVPCWTM","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":"8c7180208071e1839c98652a08e701c30b5478873111f83f6932cd53d150e4d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T17:54:29Z","title_canon_sha256":"8973f6dfadcc5628e15bd03a0d4f20873bdd2e2697af83319afcd821c18e680f"},"schema_version":"1.0","source":{"id":"2205.12245","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.12245","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"2205.12245v1","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12245","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"OXG4CXKC25P2","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OXG4CXKC25P2UTG6","created_at":"2026-07-05T04:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OXG4CXKC","created_at":"2026-07-05T04:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:d8e4502536f5654eac5891b88ebd0df7ecdaff1bb689393bfc33e467706e169a","target":"graph","created_at":"2026-07-05T04:26:12Z","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/2205.12245/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper studies asynchronous message passing (AMP), a new paradigm for applying neural network based learning to graphs. Existing graph neural networks use the synchronous distributed computing model and aggregate their neighbors in each round, which causes problems such as oversmoothing and limits their expressiveness. On the other hand, AMP is based on the asynchronous model, where nodes react to messages of their neighbors individually. We prove that (i) AMP can simulate synchronous GNNs and that (ii) AMP can theoretically distinguish any pair of graphs. We experimentally validate AMP's ","authors_text":"Lukas Faber, Roger Wattenhofer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T17:54:29Z","title":"Asynchronous Neural Networks for Learning in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12245","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:4533dd4307dbb475cc33170ddee42fdba919841c3c42213ff225b436cdbf54f0","target":"record","created_at":"2026-07-05T04:26:12Z","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":"8c7180208071e1839c98652a08e701c30b5478873111f83f6932cd53d150e4d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-05-24T17:54:29Z","title_canon_sha256":"8973f6dfadcc5628e15bd03a0d4f20873bdd2e2697af83319afcd821c18e680f"},"schema_version":"1.0","source":{"id":"2205.12245","kind":"arxiv","version":1}},"canonical_sha256":"75cdc15d42d75faa4cdeb1f47abc569b3457913d980c7b2631898de4e5bae52f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75cdc15d42d75faa4cdeb1f47abc569b3457913d980c7b2631898de4e5bae52f","first_computed_at":"2026-07-05T04:26:12.581375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:26:12.581375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u349z7MpEW7f/q4DsxPRvgoxCvHFDwb+u7C4niImTV5JpsPhv+qBp+zI5AebJp7a3ucNJfRFBpws4yreww8VBw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:26:12.581693Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.12245","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4533dd4307dbb475cc33170ddee42fdba919841c3c42213ff225b436cdbf54f0","sha256:d8e4502536f5654eac5891b88ebd0df7ecdaff1bb689393bfc33e467706e169a"],"state_sha256":"a8361b39dfce5f4f009d6e89def73c6f687b0b7def1ec7fdcce0f29d9cefb6ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"etRly6+5gbxMEns74KU+HVbmeiNrGOjIU5zVe6diG/dNCvAo2n3hndZm4yyGfzQIwmumslPH9tQOIbEnwWCgCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T03:08:04.064399Z","bundle_sha256":"7b7ec5786f00834ff907476653880575b50ee1c0e9d530fd317757b190086426"}}