{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:W645SBQKCYYMT4ECYN6CDOPMMW","short_pith_number":"pith:W645SBQK","canonical_record":{"source":{"id":"2103.15565","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T12:34:36Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"c049b6428090e20d6da8901685296a633759d95e6c0c7cf879d367a4593d9c5d","abstract_canon_sha256":"21807b5c4a69888d5985ddc088c35f64950b1d0823299edec162f814f975a55f"},"schema_version":"1.0"},"canonical_sha256":"b7b9d9060a1630c9f082c37c21b9ec65ae595f7335a6958e73ce0206269f9206","source":{"kind":"arxiv","id":"2103.15565","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15565","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15565v1","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15565","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"W645SBQKCYYM","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_16","alias_value":"W645SBQKCYYMT4EC","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_8","alias_value":"W645SBQK","created_at":"2026-07-05T02:27:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:W645SBQKCYYMT4ECYN6CDOPMMW","target":"record","payload":{"canonical_record":{"source":{"id":"2103.15565","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T12:34:36Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"c049b6428090e20d6da8901685296a633759d95e6c0c7cf879d367a4593d9c5d","abstract_canon_sha256":"21807b5c4a69888d5985ddc088c35f64950b1d0823299edec162f814f975a55f"},"schema_version":"1.0"},"canonical_sha256":"b7b9d9060a1630c9f082c37c21b9ec65ae595f7335a6958e73ce0206269f9206","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:27:07.465629Z","signature_b64":"qRPrTDz7EPgamaGBLhd+5ExTvTVZPe+S7GOEDgaRV+EZ6K50JjlJuC0/putLjcH8tmd9UoiKxh8ISkTRbcpcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7b9d9060a1630c9f082c37c21b9ec65ae595f7335a6958e73ce0206269f9206","last_reissued_at":"2026-07-05T02:27:07.465225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:27:07.465225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2103.15565","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-05T02:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A7z6ZjVtDi4EIidMCmivN5BQRNrrK4a1yVNkBQ3JY1RljLioJbgXBtTKO3iPFzW+D4YPtuPCPrn1Tf3OqKXzAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T23:08:16.936180Z"},"content_sha256":"24cf804cdb8724e1be9867251418e63709e0009d5e7e64e4863bd2af387d98bb","schema_version":"1.0","event_id":"sha256:24cf804cdb8724e1be9867251418e63709e0009d5e7e64e4863bd2af387d98bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:W645SBQKCYYMT4ECYN6CDOPMMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RAN-GNNs: breaking the capacity limits of graph neural networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Diego Valsesia, Enrico Magli, Giulia Fracastoro","submitted_at":"2021-03-29T12:34:36Z","abstract_excerpt":"Graph neural networks have become a staple in problems addressing learning and analysis of data defined over graphs. However, several results suggest an inherent difficulty in extracting better performance by increasing the number of layers. Recent works attribute this to a phenomenon peculiar to the extraction of node features in graph-based tasks, i.e., the need to consider multiple neighborhood sizes at the same time and adaptively tune them. In this paper, we investigate the recently proposed randomly wired architectures in the context of graph neural networks. Instead of building deeper n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15565","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/2103.15565/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-05T02:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rEjAO0J7ya1lg12Xw71mRadixX2X4glI37DwDmJSD8aTNHetVa/J4kIn0xsIefLaO0hFJ0VBwXXdhIdwa/gYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T23:08:16.936569Z"},"content_sha256":"d53adafedb0eb287dd18871eabc4872112fe123342c9552b6709fe06df27f846","schema_version":"1.0","event_id":"sha256:d53adafedb0eb287dd18871eabc4872112fe123342c9552b6709fe06df27f846"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W645SBQKCYYMT4ECYN6CDOPMMW/bundle.json","state_url":"https://pith.science/pith/W645SBQKCYYMT4ECYN6CDOPMMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W645SBQKCYYMT4ECYN6CDOPMMW/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-07-09T23:08:16Z","links":{"resolver":"https://pith.science/pith/W645SBQKCYYMT4ECYN6CDOPMMW","bundle":"https://pith.science/pith/W645SBQKCYYMT4ECYN6CDOPMMW/bundle.json","state":"https://pith.science/pith/W645SBQKCYYMT4ECYN6CDOPMMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W645SBQKCYYMT4ECYN6CDOPMMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:W645SBQKCYYMT4ECYN6CDOPMMW","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":"21807b5c4a69888d5985ddc088c35f64950b1d0823299edec162f814f975a55f","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T12:34:36Z","title_canon_sha256":"c049b6428090e20d6da8901685296a633759d95e6c0c7cf879d367a4593d9c5d"},"schema_version":"1.0","source":{"id":"2103.15565","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.15565","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"2103.15565v1","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15565","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"W645SBQKCYYM","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_16","alias_value":"W645SBQKCYYMT4EC","created_at":"2026-07-05T02:27:07Z"},{"alias_kind":"pith_short_8","alias_value":"W645SBQK","created_at":"2026-07-05T02:27:07Z"}],"graph_snapshots":[{"event_id":"sha256:d53adafedb0eb287dd18871eabc4872112fe123342c9552b6709fe06df27f846","target":"graph","created_at":"2026-07-05T02:27:07Z","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/2103.15565/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks have become a staple in problems addressing learning and analysis of data defined over graphs. However, several results suggest an inherent difficulty in extracting better performance by increasing the number of layers. Recent works attribute this to a phenomenon peculiar to the extraction of node features in graph-based tasks, i.e., the need to consider multiple neighborhood sizes at the same time and adaptively tune them. In this paper, we investigate the recently proposed randomly wired architectures in the context of graph neural networks. Instead of building deeper n","authors_text":"Diego Valsesia, Enrico Magli, Giulia Fracastoro","cross_cats":["cs.CV"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T12:34:36Z","title":"RAN-GNNs: breaking the capacity limits of graph neural networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15565","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:24cf804cdb8724e1be9867251418e63709e0009d5e7e64e4863bd2af387d98bb","target":"record","created_at":"2026-07-05T02:27:07Z","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":"21807b5c4a69888d5985ddc088c35f64950b1d0823299edec162f814f975a55f","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T12:34:36Z","title_canon_sha256":"c049b6428090e20d6da8901685296a633759d95e6c0c7cf879d367a4593d9c5d"},"schema_version":"1.0","source":{"id":"2103.15565","kind":"arxiv","version":1}},"canonical_sha256":"b7b9d9060a1630c9f082c37c21b9ec65ae595f7335a6958e73ce0206269f9206","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7b9d9060a1630c9f082c37c21b9ec65ae595f7335a6958e73ce0206269f9206","first_computed_at":"2026-07-05T02:27:07.465225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:27:07.465225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qRPrTDz7EPgamaGBLhd+5ExTvTVZPe+S7GOEDgaRV+EZ6K50JjlJuC0/putLjcH8tmd9UoiKxh8ISkTRbcpcAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:27:07.465629Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.15565","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24cf804cdb8724e1be9867251418e63709e0009d5e7e64e4863bd2af387d98bb","sha256:d53adafedb0eb287dd18871eabc4872112fe123342c9552b6709fe06df27f846"],"state_sha256":"c6d32f7e0650270897ac789abd7ffd62e0085003fd8c7c5dd95c740b78ef6fed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRa4DSQ7piGvK6EORlHFeb3/1jsaP4J6YC4WyRbMT6JFvFvuvcF6WccGFP/fy6hGED6XXxt3fFwVh9svJq2kCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T23:08:16.938477Z","bundle_sha256":"26e6995c207f0c5ed704cfeca85fcabeb9e81b9104ccb7b9aed2c0d5ab8d6f05"}}