{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:GDUGAG3V4VLOHHTNEXLLQES4KT","short_pith_number":"pith:GDUGAG3V","canonical_record":{"source":{"id":"2505.11346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T15:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"db4b0ff72100ebacab7c3be79193b6b225b047015ed9288aae5faf925ca62d2c","abstract_canon_sha256":"f1889993994a80f56abe62c5f3b36751c2722d9905eddd2ce270520544139d0e"},"schema_version":"1.0"},"canonical_sha256":"30e8601b75e556e39e6d25d6b8125c54c6aef0b41f099b6a895a25783a01b163","source":{"kind":"arxiv","id":"2505.11346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11346","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11346v1","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11346","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"GDUGAG3V4VLO","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_16","alias_value":"GDUGAG3V4VLOHHTN","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_8","alias_value":"GDUGAG3V","created_at":"2026-07-05T11:04:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:GDUGAG3V4VLOHHTNEXLLQES4KT","target":"record","payload":{"canonical_record":{"source":{"id":"2505.11346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T15:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"db4b0ff72100ebacab7c3be79193b6b225b047015ed9288aae5faf925ca62d2c","abstract_canon_sha256":"f1889993994a80f56abe62c5f3b36751c2722d9905eddd2ce270520544139d0e"},"schema_version":"1.0"},"canonical_sha256":"30e8601b75e556e39e6d25d6b8125c54c6aef0b41f099b6a895a25783a01b163","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:14.742584Z","signature_b64":"Qc2c7woR+2H4jPZwPOGfajKl9fbj9gXLiJcTo/BfXycteCjq3eH7bF27qM+9JkcJNGKHuo8Lluzox3FqqaVKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30e8601b75e556e39e6d25d6b8125c54c6aef0b41f099b6a895a25783a01b163","last_reissued_at":"2026-07-05T11:04:14.742047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:14.742047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.11346","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-05T11:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Guy3CIg/Fy+OO80n5W/LpdClU4GVFaOkMXspF8D5zKjIp1ue25Y2s/uON7bPL2QLsAYREl5bnkYxXg8juHBlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:56:16.601019Z"},"content_sha256":"ed0cef07b3128dd93c07ada01b7f6d4ea43c096862881932e0a6ce366ffc1f95","schema_version":"1.0","event_id":"sha256:ed0cef07b3128dd93c07ada01b7f6d4ea43c096862881932e0a6ce366ffc1f95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:GDUGAG3V4VLOHHTNEXLLQES4KT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"What Can We Learn From MIMO Graph Convolutions?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Andreas Roth, Thomas Liebig","submitted_at":"2025-05-16T15:13:09Z","abstract_excerpt":"Most graph neural networks (GNNs) utilize approximations of the general graph convolution derived in the graph Fourier domain. While GNNs are typically applied in the multi-input multi-output (MIMO) case, the approximations are performed in the single-input single-output (SISO) case. In this work, we first derive the MIMO graph convolution through the convolution theorem and approximate it directly in the MIMO case. We find the key MIMO-specific property of the graph convolution to be operating on multiple computational graphs, or equivalently, applying distinct feature transformations for eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11346","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/2505.11346/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-05T11:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eJEkpXBZnmvgeAowvLr/pl9I6Tdly167JJLqVIOQOpNTFZ4sBZpChi1aNPrwVBfwV9Z/WPRc81E7O9qRc+lcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:56:16.601588Z"},"content_sha256":"43b8c3d593051fde05967c7f251a94c589b9583f642e98170d995059b9489545","schema_version":"1.0","event_id":"sha256:43b8c3d593051fde05967c7f251a94c589b9583f642e98170d995059b9489545"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/bundle.json","state_url":"https://pith.science/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/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-21T05:56:16Z","links":{"resolver":"https://pith.science/pith/GDUGAG3V4VLOHHTNEXLLQES4KT","bundle":"https://pith.science/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/bundle.json","state":"https://pith.science/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDUGAG3V4VLOHHTNEXLLQES4KT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:GDUGAG3V4VLOHHTNEXLLQES4KT","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":"f1889993994a80f56abe62c5f3b36751c2722d9905eddd2ce270520544139d0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T15:13:09Z","title_canon_sha256":"db4b0ff72100ebacab7c3be79193b6b225b047015ed9288aae5faf925ca62d2c"},"schema_version":"1.0","source":{"id":"2505.11346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.11346","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"2505.11346v1","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.11346","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"GDUGAG3V4VLO","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_16","alias_value":"GDUGAG3V4VLOHHTN","created_at":"2026-07-05T11:04:14Z"},{"alias_kind":"pith_short_8","alias_value":"GDUGAG3V","created_at":"2026-07-05T11:04:14Z"}],"graph_snapshots":[{"event_id":"sha256:43b8c3d593051fde05967c7f251a94c589b9583f642e98170d995059b9489545","target":"graph","created_at":"2026-07-05T11:04:14Z","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/2505.11346/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most graph neural networks (GNNs) utilize approximations of the general graph convolution derived in the graph Fourier domain. While GNNs are typically applied in the multi-input multi-output (MIMO) case, the approximations are performed in the single-input single-output (SISO) case. In this work, we first derive the MIMO graph convolution through the convolution theorem and approximate it directly in the MIMO case. We find the key MIMO-specific property of the graph convolution to be operating on multiple computational graphs, or equivalently, applying distinct feature transformations for eac","authors_text":"Andreas Roth, Thomas Liebig","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T15:13:09Z","title":"What Can We Learn From MIMO Graph Convolutions?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.11346","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:ed0cef07b3128dd93c07ada01b7f6d4ea43c096862881932e0a6ce366ffc1f95","target":"record","created_at":"2026-07-05T11:04:14Z","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":"f1889993994a80f56abe62c5f3b36751c2722d9905eddd2ce270520544139d0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-05-16T15:13:09Z","title_canon_sha256":"db4b0ff72100ebacab7c3be79193b6b225b047015ed9288aae5faf925ca62d2c"},"schema_version":"1.0","source":{"id":"2505.11346","kind":"arxiv","version":1}},"canonical_sha256":"30e8601b75e556e39e6d25d6b8125c54c6aef0b41f099b6a895a25783a01b163","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30e8601b75e556e39e6d25d6b8125c54c6aef0b41f099b6a895a25783a01b163","first_computed_at":"2026-07-05T11:04:14.742047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:04:14.742047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qc2c7woR+2H4jPZwPOGfajKl9fbj9gXLiJcTo/BfXycteCjq3eH7bF27qM+9JkcJNGKHuo8Lluzox3FqqaVKAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:04:14.742584Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.11346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed0cef07b3128dd93c07ada01b7f6d4ea43c096862881932e0a6ce366ffc1f95","sha256:43b8c3d593051fde05967c7f251a94c589b9583f642e98170d995059b9489545"],"state_sha256":"ca0be3b073fea7a577b566747e471a49ff5b3b7dc20cac2db1dad99da8455248"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5G1iVaxwdPRf8lodreTZpVszplbWHrH1Fe3YcARO5b3JLaPzpCCjM7OLHsVctAHOpQVflLK1qAuc9dFbpxcHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:56:16.605592Z","bundle_sha256":"605511e5bdd519edb0dc2aca7575434a33284869ea0dc0dc2a3316d4cecd2402"}}