{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:QJXDUIEMVXJKOSF55EB326I3P5","short_pith_number":"pith:QJXDUIEM","canonical_record":{"source":{"id":"2212.09083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-18T13:27:01Z","cross_cats_sorted":["cs.AI","cs.SI","stat.ML"],"title_canon_sha256":"46b07451a9becc44cbac477454f6102b65e16563d5b791bd4c6daf3cd867d17d","abstract_canon_sha256":"ad72595d2df4f0f95e6260a946a293bc260474afb2230fdc3a706241f3fa8bb2"},"schema_version":"1.0"},"canonical_sha256":"826e3a208cadd2a748bde903bd791b7f5062a9a23f4ab758b00232ff07385f95","source":{"kind":"arxiv","id":"2212.09083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09083","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09083v1","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09083","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"QJXDUIEMVXJK","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"QJXDUIEMVXJKOSF5","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"QJXDUIEM","created_at":"2026-07-05T05:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:QJXDUIEMVXJKOSF55EB326I3P5","target":"record","payload":{"canonical_record":{"source":{"id":"2212.09083","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-18T13:27:01Z","cross_cats_sorted":["cs.AI","cs.SI","stat.ML"],"title_canon_sha256":"46b07451a9becc44cbac477454f6102b65e16563d5b791bd4c6daf3cd867d17d","abstract_canon_sha256":"ad72595d2df4f0f95e6260a946a293bc260474afb2230fdc3a706241f3fa8bb2"},"schema_version":"1.0"},"canonical_sha256":"826e3a208cadd2a748bde903bd791b7f5062a9a23f4ab758b00232ff07385f95","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:17.974495Z","signature_b64":"OJDfqBahcTRbZNUYXgSolvqtGSsL/N6g2GWos9UDQ/chkYA7FuOI7OZX1+U6RlvsXl37+kYbmQ8h89KmpQ8CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826e3a208cadd2a748bde903bd791b7f5062a9a23f4ab758b00232ff07385f95","last_reissued_at":"2026-07-05T05:26:17.974034Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:17.974034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.09083","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-05T05:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cx7P38ksL9ICWOcBexXgtF3Fs3iR6TNoCh0x5wo+fNifH0wmuxSn+N2aIdfpPq36Nrb7GYkpKdkXfyyU5r05BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:00:08.760273Z"},"content_sha256":"4e9753859808f9fb79510586bfe8a8e2093fe71b85839ce204ebaf924698c344","schema_version":"1.0","event_id":"sha256:4e9753859808f9fb79510586bfe8a8e2093fe71b85839ce204ebaf924698c344"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:QJXDUIEMVXJKOSF55EB326I3P5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Influence-Based Mini-Batching for Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chendi Qian, Johannes Gasteiger, Stephan G\\\"unnemann","submitted_at":"2022-12-18T13:27:01Z","abstract_excerpt":"Using graph neural networks for large graphs is challenging since there is no clear way of constructing mini-batches. To solve this, previous methods have relied on sampling or graph clustering. While these approaches often lead to good training convergence, they introduce significant overhead due to expensive random data accesses and perform poorly during inference. In this work we instead focus on model behavior during inference. We theoretically model batch construction via maximizing the influence score of nodes on the outputs. This formulation leads to optimal approximation of the output "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09083","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/2212.09083/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-05T05:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ArN49n8SJlMVjaH7WrTyHFelvNkf5HhHWrC2GnMlo/aMzun4CAR8wiXhjhMUTAGYcbwBaVRK4Idpa9O2CXRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-08T16:00:08.760681Z"},"content_sha256":"73d1767ded5fe081a8967f5b3bf4bfc18f1043cc89545972b82e6ad7f6568fe8","schema_version":"1.0","event_id":"sha256:73d1767ded5fe081a8967f5b3bf4bfc18f1043cc89545972b82e6ad7f6568fe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJXDUIEMVXJKOSF55EB326I3P5/bundle.json","state_url":"https://pith.science/pith/QJXDUIEMVXJKOSF55EB326I3P5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJXDUIEMVXJKOSF55EB326I3P5/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-08T16:00:08Z","links":{"resolver":"https://pith.science/pith/QJXDUIEMVXJKOSF55EB326I3P5","bundle":"https://pith.science/pith/QJXDUIEMVXJKOSF55EB326I3P5/bundle.json","state":"https://pith.science/pith/QJXDUIEMVXJKOSF55EB326I3P5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJXDUIEMVXJKOSF55EB326I3P5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:QJXDUIEMVXJKOSF55EB326I3P5","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":"ad72595d2df4f0f95e6260a946a293bc260474afb2230fdc3a706241f3fa8bb2","cross_cats_sorted":["cs.AI","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-18T13:27:01Z","title_canon_sha256":"46b07451a9becc44cbac477454f6102b65e16563d5b791bd4c6daf3cd867d17d"},"schema_version":"1.0","source":{"id":"2212.09083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.09083","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"2212.09083v1","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.09083","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"QJXDUIEMVXJK","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"QJXDUIEMVXJKOSF5","created_at":"2026-07-05T05:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"QJXDUIEM","created_at":"2026-07-05T05:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:73d1767ded5fe081a8967f5b3bf4bfc18f1043cc89545972b82e6ad7f6568fe8","target":"graph","created_at":"2026-07-05T05:26:17Z","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/2212.09083/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Using graph neural networks for large graphs is challenging since there is no clear way of constructing mini-batches. To solve this, previous methods have relied on sampling or graph clustering. While these approaches often lead to good training convergence, they introduce significant overhead due to expensive random data accesses and perform poorly during inference. In this work we instead focus on model behavior during inference. We theoretically model batch construction via maximizing the influence score of nodes on the outputs. This formulation leads to optimal approximation of the output ","authors_text":"Chendi Qian, Johannes Gasteiger, Stephan G\\\"unnemann","cross_cats":["cs.AI","cs.SI","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-18T13:27:01Z","title":"Influence-Based Mini-Batching for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.09083","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:4e9753859808f9fb79510586bfe8a8e2093fe71b85839ce204ebaf924698c344","target":"record","created_at":"2026-07-05T05:26:17Z","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":"ad72595d2df4f0f95e6260a946a293bc260474afb2230fdc3a706241f3fa8bb2","cross_cats_sorted":["cs.AI","cs.SI","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-12-18T13:27:01Z","title_canon_sha256":"46b07451a9becc44cbac477454f6102b65e16563d5b791bd4c6daf3cd867d17d"},"schema_version":"1.0","source":{"id":"2212.09083","kind":"arxiv","version":1}},"canonical_sha256":"826e3a208cadd2a748bde903bd791b7f5062a9a23f4ab758b00232ff07385f95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"826e3a208cadd2a748bde903bd791b7f5062a9a23f4ab758b00232ff07385f95","first_computed_at":"2026-07-05T05:26:17.974034Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:26:17.974034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OJDfqBahcTRbZNUYXgSolvqtGSsL/N6g2GWos9UDQ/chkYA7FuOI7OZX1+U6RlvsXl37+kYbmQ8h89KmpQ8CBg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:26:17.974495Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.09083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e9753859808f9fb79510586bfe8a8e2093fe71b85839ce204ebaf924698c344","sha256:73d1767ded5fe081a8967f5b3bf4bfc18f1043cc89545972b82e6ad7f6568fe8"],"state_sha256":"0fc21c7af9d1542c246f7a23f971cc13d8a0ca8272d03ea2b64549a15f70e968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ujoZlenH3cmVd/CL5uHMoD6fIJIUFypprQFt0X35iO5smllTp01rMtuDt1JNwoTFBGq72ZEBWFMGoHHVWD0KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-08T16:00:08.762780Z","bundle_sha256":"4e29428d20a4309ad0b6d160e8e26d597f3c7c12979517a46652ebbab8e37b23"}}