{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RQWSUSSZ6MVMN4OHDPSYNE62W3","short_pith_number":"pith:RQWSUSSZ","canonical_record":{"source":{"id":"2310.03399","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T09:08:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"91e0dfa4f0e335eca8b090019f6ed58a24b622f767258a785eaf33c8fa61742d","abstract_canon_sha256":"9f8dfa99334863547a39f59197bbbb2d3b190bc447c9c576d75a3316cb7446c0"},"schema_version":"1.0"},"canonical_sha256":"8c2d2a4a59f32ac6f1c71be58693dab6f67cc60f293287fd5085573fd61eca18","source":{"kind":"arxiv","id":"2310.03399","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03399","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03399v3","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03399","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"RQWSUSSZ6MVM","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_16","alias_value":"RQWSUSSZ6MVMN4OH","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_8","alias_value":"RQWSUSSZ","created_at":"2026-07-05T11:37:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RQWSUSSZ6MVMN4OHDPSYNE62W3","target":"record","payload":{"canonical_record":{"source":{"id":"2310.03399","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T09:08:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"91e0dfa4f0e335eca8b090019f6ed58a24b622f767258a785eaf33c8fa61742d","abstract_canon_sha256":"9f8dfa99334863547a39f59197bbbb2d3b190bc447c9c576d75a3316cb7446c0"},"schema_version":"1.0"},"canonical_sha256":"8c2d2a4a59f32ac6f1c71be58693dab6f67cc60f293287fd5085573fd61eca18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:07.029178Z","signature_b64":"iCTjQGLVCG6ZseuCVEcni+d2Nn238NwjYWkEqhPKxPSnFM7esYi3me9Kt4JHNb5Q9s/5RKEw5CW2HVQ3zaSHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c2d2a4a59f32ac6f1c71be58693dab6f67cc60f293287fd5085573fd61eca18","last_reissued_at":"2026-07-05T11:37:07.028629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:07.028629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.03399","source_version":3,"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:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2J2LC7zDgozc2l4602PBteh1NdiuR677yNyrjR3ElU+j9k5XYE/96SVPQTv5R5pt/NPyxzz+YSOsUTTLTNhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:40:06.641895Z"},"content_sha256":"bb0cc0b98214d84ee2e78e104cc12f02fe02102227a063d8b21e6e86951fbd84","schema_version":"1.0","event_id":"sha256:bb0cc0b98214d84ee2e78e104cc12f02fe02102227a063d8b21e6e86951fbd84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RQWSUSSZ6MVMN4OHDPSYNE62W3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GRAPES: Learning to Sample Graphs for Scalable Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Daniel Daza, Emile van Krieken, Peter Bloem, Taraneh Younesian, Thiviyan Thanapalasingam","submitted_at":"2023-10-05T09:08:47Z","abstract_excerpt":"Graph neural networks (GNNs) learn to represent nodes by aggregating information from their neighbors. As GNNs increase in depth, their receptive field grows exponentially, leading to high memory costs. Several existing methods address this by sampling a small subset of nodes, scaling GNNs to much larger graphs. These methods are primarily evaluated on homophilous graphs, where neighboring nodes often share the same label. However, most of these methods rely on static heuristics that may not generalize across different graphs or tasks. We argue that the sampling method should be adaptive, adju"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03399","kind":"arxiv","version":3},"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/2310.03399/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:37:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAWSzh7bU80N0nAb5vE2pPdTcLy3KcXKZm2xVw2P0Je5MmBQdkB0gQ0o4mNWNuPgR3gakVMmu8fSHeG2YfpnCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:40:06.642423Z"},"content_sha256":"cbf67dbb51627edc30b1d01f154d39a80f5e07b522a5558374caaccb2f3f5600","schema_version":"1.0","event_id":"sha256:cbf67dbb51627edc30b1d01f154d39a80f5e07b522a5558374caaccb2f3f5600"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/bundle.json","state_url":"https://pith.science/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/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-03T15:40:06Z","links":{"resolver":"https://pith.science/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3","bundle":"https://pith.science/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/bundle.json","state":"https://pith.science/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RQWSUSSZ6MVMN4OHDPSYNE62W3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RQWSUSSZ6MVMN4OHDPSYNE62W3","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":"9f8dfa99334863547a39f59197bbbb2d3b190bc447c9c576d75a3316cb7446c0","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T09:08:47Z","title_canon_sha256":"91e0dfa4f0e335eca8b090019f6ed58a24b622f767258a785eaf33c8fa61742d"},"schema_version":"1.0","source":{"id":"2310.03399","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.03399","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"2310.03399v3","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.03399","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"RQWSUSSZ6MVM","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_16","alias_value":"RQWSUSSZ6MVMN4OH","created_at":"2026-07-05T11:37:07Z"},{"alias_kind":"pith_short_8","alias_value":"RQWSUSSZ","created_at":"2026-07-05T11:37:07Z"}],"graph_snapshots":[{"event_id":"sha256:cbf67dbb51627edc30b1d01f154d39a80f5e07b522a5558374caaccb2f3f5600","target":"graph","created_at":"2026-07-05T11:37: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/2310.03399/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph neural networks (GNNs) learn to represent nodes by aggregating information from their neighbors. As GNNs increase in depth, their receptive field grows exponentially, leading to high memory costs. Several existing methods address this by sampling a small subset of nodes, scaling GNNs to much larger graphs. These methods are primarily evaluated on homophilous graphs, where neighboring nodes often share the same label. However, most of these methods rely on static heuristics that may not generalize across different graphs or tasks. We argue that the sampling method should be adaptive, adju","authors_text":"Daniel Daza, Emile van Krieken, Peter Bloem, Taraneh Younesian, Thiviyan Thanapalasingam","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T09:08:47Z","title":"GRAPES: Learning to Sample Graphs for Scalable Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.03399","kind":"arxiv","version":3},"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:bb0cc0b98214d84ee2e78e104cc12f02fe02102227a063d8b21e6e86951fbd84","target":"record","created_at":"2026-07-05T11:37: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":"9f8dfa99334863547a39f59197bbbb2d3b190bc447c9c576d75a3316cb7446c0","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-05T09:08:47Z","title_canon_sha256":"91e0dfa4f0e335eca8b090019f6ed58a24b622f767258a785eaf33c8fa61742d"},"schema_version":"1.0","source":{"id":"2310.03399","kind":"arxiv","version":3}},"canonical_sha256":"8c2d2a4a59f32ac6f1c71be58693dab6f67cc60f293287fd5085573fd61eca18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c2d2a4a59f32ac6f1c71be58693dab6f67cc60f293287fd5085573fd61eca18","first_computed_at":"2026-07-05T11:37:07.028629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:07.028629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iCTjQGLVCG6ZseuCVEcni+d2Nn238NwjYWkEqhPKxPSnFM7esYi3me9Kt4JHNb5Q9s/5RKEw5CW2HVQ3zaSHDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:07.029178Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.03399","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb0cc0b98214d84ee2e78e104cc12f02fe02102227a063d8b21e6e86951fbd84","sha256:cbf67dbb51627edc30b1d01f154d39a80f5e07b522a5558374caaccb2f3f5600"],"state_sha256":"65f3975d719a8a04717ece3a4d9d36b56c88ee53873d69d4f530f1de3bb1d5b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2kBWyXYipCyakIwfnNUQR4ACh0ExCET27YzwUCK8j7+TgZGDeoOsUGtKt7IGUIVewqTuI72hBiiJSE/sZQ17Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:40:06.647662Z","bundle_sha256":"8e1b2eb6c471fab84ae35aaa6802a7cdc0e146b90e59f772400a864295e82505"}}