{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YNCGBBJJRK3NRL6EAYWUEUH7MA","short_pith_number":"pith:YNCGBBJJ","schema_version":"1.0","canonical_sha256":"c3446085298ab6d8afc4062d4250ff600c42b2b711efc95185ad4ac96905925a","source":{"kind":"arxiv","id":"2109.08983","version":1},"attestation_state":"computed","paper":{"title":"G-CoS: GNN-Accelerator Co-Search Towards Both Better Accuracy and Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.AR","authors_text":"Ang Li, Haoran You, Tong Geng, Yingyan Lin, Yongan Zhang, Yonggan Fu","submitted_at":"2021-09-18T18:36:04Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as the state-of-the-art (SOTA) method for graph-based learning tasks. However, it still remains prohibitively challenging to inference GNNs over large graph datasets, limiting their application to large-scale real-world tasks. While end-to-end jointly optimizing GNNs and their accelerators is promising in boosting GNNs' inference efficiency and expediting the design process, it is still underexplored due to the vast and distinct design spaces of GNNs and their accelerators. In this work, we propose G-CoS, a GNN and accelerator co-search framework that "},"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":"2109.08983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2021-09-18T18:36:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"08c3cf15997274607b30d428b3d72cbc20508502946278d6ed3ecf2c2bcec426","abstract_canon_sha256":"50f9d3c184b565c5d22df7598e099eb340d98ef549ac7c078ac9028c4a67fae0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:15:40.271449Z","signature_b64":"DM94W5dV8aSDE7WLuV7EA4O77cR1l4IuG6eqx/lboUMMOHqkXM/IZlpX9+4L05A9dFk2v2DgzxzMijHBQ0cCBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3446085298ab6d8afc4062d4250ff600c42b2b711efc95185ad4ac96905925a","last_reissued_at":"2026-07-05T03:15:40.271047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:15:40.271047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"G-CoS: GNN-Accelerator Co-Search Towards Both Better Accuracy and Efficiency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.AR","authors_text":"Ang Li, Haoran You, Tong Geng, Yingyan Lin, Yongan Zhang, Yonggan Fu","submitted_at":"2021-09-18T18:36:04Z","abstract_excerpt":"Graph Neural Networks (GNNs) have emerged as the state-of-the-art (SOTA) method for graph-based learning tasks. However, it still remains prohibitively challenging to inference GNNs over large graph datasets, limiting their application to large-scale real-world tasks. While end-to-end jointly optimizing GNNs and their accelerators is promising in boosting GNNs' inference efficiency and expediting the design process, it is still underexplored due to the vast and distinct design spaces of GNNs and their accelerators. In this work, we propose G-CoS, a GNN and accelerator co-search framework that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.08983","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/2109.08983/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":"2109.08983","created_at":"2026-07-05T03:15:40.271104+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.08983v1","created_at":"2026-07-05T03:15:40.271104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.08983","created_at":"2026-07-05T03:15:40.271104+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNCGBBJJRK3N","created_at":"2026-07-05T03:15:40.271104+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNCGBBJJRK3NRL6E","created_at":"2026-07-05T03:15:40.271104+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNCGBBJJ","created_at":"2026-07-05T03:15:40.271104+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA","json":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA.json","graph_json":"https://pith.science/api/pith-number/YNCGBBJJRK3NRL6EAYWUEUH7MA/graph.json","events_json":"https://pith.science/api/pith-number/YNCGBBJJRK3NRL6EAYWUEUH7MA/events.json","paper":"https://pith.science/paper/YNCGBBJJ"},"agent_actions":{"view_html":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA","download_json":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA.json","view_paper":"https://pith.science/paper/YNCGBBJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.08983&json=true","fetch_graph":"https://pith.science/api/pith-number/YNCGBBJJRK3NRL6EAYWUEUH7MA/graph.json","fetch_events":"https://pith.science/api/pith-number/YNCGBBJJRK3NRL6EAYWUEUH7MA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA/action/storage_attestation","attest_author":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA/action/author_attestation","sign_citation":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA/action/citation_signature","submit_replication":"https://pith.science/pith/YNCGBBJJRK3NRL6EAYWUEUH7MA/action/replication_record"}},"created_at":"2026-07-05T03:15:40.271104+00:00","updated_at":"2026-07-05T03:15:40.271104+00:00"}