{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NDH452SAFER4BXNYYASLBLAHGP","short_pith_number":"pith:NDH452SA","schema_version":"1.0","canonical_sha256":"68cfceea402923c0ddb8c024b0ac0733dde228b21a7e3bc0acc00f6907c2a791","source":{"kind":"arxiv","id":"2111.00680","version":2},"attestation_state":"computed","paper":{"title":"GNNear: Accelerating Full-Batch Training of Graph Neural Networks with Near-Memory Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Cong Li, Guangyu Sun, Xiaoyang Wang, Xuechao Wei, Zhe Zhou","submitted_at":"2021-11-01T03:47:07Z","abstract_excerpt":"Recently, Graph Neural Networks (GNNs) have become state-of-the-art algorithms for analyzing non-euclidean graph data. However, to realize efficient GNN training is challenging, especially on large graphs. The reasons are many-folded: 1) GNN training incurs a substantial memory footprint. Full-batch training on large graphs even requires hundreds to thousands of gigabytes of memory. 2) GNN training involves both memory-intensive and computation-intensive operations, challenging current CPU/GPU platforms. 3) The irregularity of graphs can result in severe resource under-utilization and load-imb"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.00680","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-01T03:47:07Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"9145ca543b1dbeac66ba042e89a89ad5c93bdbbc64d0913b8db877f0d223baa0","abstract_canon_sha256":"2a3a463d9e9a3fac904c262b8eec83c2169edb68c73b22239a0bd685d58e580a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:48:37.683184Z","signature_b64":"5bzOMGreV5/CLuEvPM4cU4ZLw7DEzeBM8xDKkKCztNEEoZsGRnKFFYHJbIRIzRrJeWnliBv3ZcEf9zx3bh6MCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68cfceea402923c0ddb8c024b0ac0733dde228b21a7e3bc0acc00f6907c2a791","last_reissued_at":"2026-07-05T04:48:37.682752Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:48:37.682752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GNNear: Accelerating Full-Batch Training of Graph Neural Networks with Near-Memory Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.LG","authors_text":"Cong Li, Guangyu Sun, Xiaoyang Wang, Xuechao Wei, Zhe Zhou","submitted_at":"2021-11-01T03:47:07Z","abstract_excerpt":"Recently, Graph Neural Networks (GNNs) have become state-of-the-art algorithms for analyzing non-euclidean graph data. However, to realize efficient GNN training is challenging, especially on large graphs. The reasons are many-folded: 1) GNN training incurs a substantial memory footprint. Full-batch training on large graphs even requires hundreds to thousands of gigabytes of memory. 2) GNN training involves both memory-intensive and computation-intensive operations, challenging current CPU/GPU platforms. 3) The irregularity of graphs can result in severe resource under-utilization and load-imb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.00680","kind":"arxiv","version":2},"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/2111.00680/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.00680","created_at":"2026-07-05T04:48:37.682800+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.00680v2","created_at":"2026-07-05T04:48:37.682800+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.00680","created_at":"2026-07-05T04:48:37.682800+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDH452SAFER4","created_at":"2026-07-05T04:48:37.682800+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDH452SAFER4BXNY","created_at":"2026-07-05T04:48:37.682800+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDH452SA","created_at":"2026-07-05T04:48:37.682800+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.05639","citing_title":"TokenStack: A Heterogeneous HBM-PIM Architecture and Runtime for Efficient LLM Inference","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP","json":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP.json","graph_json":"https://pith.science/api/pith-number/NDH452SAFER4BXNYYASLBLAHGP/graph.json","events_json":"https://pith.science/api/pith-number/NDH452SAFER4BXNYYASLBLAHGP/events.json","paper":"https://pith.science/paper/NDH452SA"},"agent_actions":{"view_html":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP","download_json":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP.json","view_paper":"https://pith.science/paper/NDH452SA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.00680&json=true","fetch_graph":"https://pith.science/api/pith-number/NDH452SAFER4BXNYYASLBLAHGP/graph.json","fetch_events":"https://pith.science/api/pith-number/NDH452SAFER4BXNYYASLBLAHGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP/action/storage_attestation","attest_author":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP/action/author_attestation","sign_citation":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP/action/citation_signature","submit_replication":"https://pith.science/pith/NDH452SAFER4BXNYYASLBLAHGP/action/replication_record"}},"created_at":"2026-07-05T04:48:37.682800+00:00","updated_at":"2026-07-05T04:48:37.682800+00:00"}