{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NCSURLMXMZ45UOUNYCS2DIQV5R","short_pith_number":"pith:NCSURLMX","schema_version":"1.0","canonical_sha256":"68a548ad976679da3a8dc0a5a1a215ec59c55b71bcf34544abc74a84af4992cd","source":{"kind":"arxiv","id":"2308.12093","version":1},"attestation_state":"computed","paper":{"title":"Cached Operator Reordering: A Unified View for Fast GNN Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.LG","authors_text":"Andrei Ivanov, Julia Bazinska, Maciej Besta, Nikoli Dryden, Siyuan Shen, Tal Ben-Nun, Torsten Hoefler","submitted_at":"2023-08-23T12:27:55Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a powerful tool for handling structured graph data and addressing tasks such as node classification, graph classification, and clustering. However, the sparse nature of GNN computation poses new challenges for performance optimization compared to traditional deep neural networks. We address these challenges by providing a unified view of GNN computation, I/O, and memory. By analyzing the computational graphs of the Graph Convolutional Network (GCN) and Graph Attention (GAT) layers -- two widely used GNN layers -- we propose alternative computation strategies. W"},"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":"2308.12093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-23T12:27:55Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"01ea1c3c8c27e60d4389f6f988cb87c9c4f2412576a6e67aa5578d48a037581e","abstract_canon_sha256":"0529d98d8b46d6575935aa72f98ca3a71220c29290eb6cf82ffe1da09df1113d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:43:59.516621Z","signature_b64":"tVkD/fdv90FBkyMhIpaHAL/uEyziMboy3mMSKjimgc80dUQYrH1wyrrL2qal56lQPmyf0hq9cWAaNXXyPB3fBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68a548ad976679da3a8dc0a5a1a215ec59c55b71bcf34544abc74a84af4992cd","last_reissued_at":"2026-07-05T06:43:59.516157Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:43:59.516157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cached Operator Reordering: A Unified View for Fast GNN Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.LG","authors_text":"Andrei Ivanov, Julia Bazinska, Maciej Besta, Nikoli Dryden, Siyuan Shen, Tal Ben-Nun, Torsten Hoefler","submitted_at":"2023-08-23T12:27:55Z","abstract_excerpt":"Graph Neural Networks (GNNs) are a powerful tool for handling structured graph data and addressing tasks such as node classification, graph classification, and clustering. However, the sparse nature of GNN computation poses new challenges for performance optimization compared to traditional deep neural networks. We address these challenges by providing a unified view of GNN computation, I/O, and memory. By analyzing the computational graphs of the Graph Convolutional Network (GCN) and Graph Attention (GAT) layers -- two widely used GNN layers -- we propose alternative computation strategies. W"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.12093","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/2308.12093/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":"2308.12093","created_at":"2026-07-05T06:43:59.516213+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.12093v1","created_at":"2026-07-05T06:43:59.516213+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.12093","created_at":"2026-07-05T06:43:59.516213+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCSURLMXMZ45","created_at":"2026-07-05T06:43:59.516213+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCSURLMXMZ45UOUN","created_at":"2026-07-05T06:43:59.516213+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCSURLMX","created_at":"2026-07-05T06:43:59.516213+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31500","citing_title":"On Efficient Scaling of GNNs via IO-Aware Layers Implementations","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R","json":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R.json","graph_json":"https://pith.science/api/pith-number/NCSURLMXMZ45UOUNYCS2DIQV5R/graph.json","events_json":"https://pith.science/api/pith-number/NCSURLMXMZ45UOUNYCS2DIQV5R/events.json","paper":"https://pith.science/paper/NCSURLMX"},"agent_actions":{"view_html":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R","download_json":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R.json","view_paper":"https://pith.science/paper/NCSURLMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.12093&json=true","fetch_graph":"https://pith.science/api/pith-number/NCSURLMXMZ45UOUNYCS2DIQV5R/graph.json","fetch_events":"https://pith.science/api/pith-number/NCSURLMXMZ45UOUNYCS2DIQV5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R/action/storage_attestation","attest_author":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R/action/author_attestation","sign_citation":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R/action/citation_signature","submit_replication":"https://pith.science/pith/NCSURLMXMZ45UOUNYCS2DIQV5R/action/replication_record"}},"created_at":"2026-07-05T06:43:59.516213+00:00","updated_at":"2026-07-05T06:43:59.516213+00:00"}