{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ZSCUGQ4IPZMVGZ5LCVYHQMYBKN","short_pith_number":"pith:ZSCUGQ4I","schema_version":"1.0","canonical_sha256":"cc854343887e595367ab15707833015364d7e4c77c7a2fd21d91d1565297b693","source":{"kind":"arxiv","id":"2103.00794","version":3},"attestation_state":"computed","paper":{"title":"Early-Bird GCNs: Graph-Network Co-Optimization Towards More Efficient GCN Training and Inference via Drawing Early-Bird Lottery Tickets","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","cs.SI"],"primary_cat":"cs.LG","authors_text":"Haoran You, Yingyan Celine Lin, Yonggan Fu, Zhihan Lu, Zijian Zhou","submitted_at":"2021-03-01T06:36:24Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art deep learning model for representation learning on graphs. However, it remains notoriously challenging to train and inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because as the graph size grows, the sheer number of node features and the large adjacency matrix can easily explode the required memory and data movements. To tackle the aforementioned challenges, we explore the possibility of draw"},"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":"2103.00794","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2021-03-01T06:36:24Z","cross_cats_sorted":["cs.CV","cs.SI"],"title_canon_sha256":"8935de67978c020d3afdb35c98907999a451631efd5b5241be1e5ec97e438495","abstract_canon_sha256":"61bb6bc3d7de61fbdf562b0974de5da287b672b0cd94b78f7856d1f4809d1f18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:41.089955Z","signature_b64":"6t2jbOQLbsGVCb7hQ0RVCLsB4vu8Hz2xpDFUQhs5+sH5nYjj8U4PJT0C5Wctck/FXsbOsQ9lry2C6GC1QiLzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc854343887e595367ab15707833015364d7e4c77c7a2fd21d91d1565297b693","last_reissued_at":"2026-07-05T10:22:41.089346Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:41.089346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Early-Bird GCNs: Graph-Network Co-Optimization Towards More Efficient GCN Training and Inference via Drawing Early-Bird Lottery Tickets","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CV","cs.SI"],"primary_cat":"cs.LG","authors_text":"Haoran You, Yingyan Celine Lin, Yonggan Fu, Zhihan Lu, Zijian Zhou","submitted_at":"2021-03-01T06:36:24Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art deep learning model for representation learning on graphs. However, it remains notoriously challenging to train and inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because as the graph size grows, the sheer number of node features and the large adjacency matrix can easily explode the required memory and data movements. To tackle the aforementioned challenges, we explore the possibility of draw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.00794","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/2103.00794/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":"2103.00794","created_at":"2026-07-05T10:22:41.089439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.00794v3","created_at":"2026-07-05T10:22:41.089439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.00794","created_at":"2026-07-05T10:22:41.089439+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZSCUGQ4IPZMV","created_at":"2026-07-05T10:22:41.089439+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZSCUGQ4IPZMVGZ5L","created_at":"2026-07-05T10:22:41.089439+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZSCUGQ4I","created_at":"2026-07-05T10:22:41.089439+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/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN","json":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN.json","graph_json":"https://pith.science/api/pith-number/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/graph.json","events_json":"https://pith.science/api/pith-number/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/events.json","paper":"https://pith.science/paper/ZSCUGQ4I"},"agent_actions":{"view_html":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN","download_json":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN.json","view_paper":"https://pith.science/paper/ZSCUGQ4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.00794&json=true","fetch_graph":"https://pith.science/api/pith-number/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/action/storage_attestation","attest_author":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/action/author_attestation","sign_citation":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/action/citation_signature","submit_replication":"https://pith.science/pith/ZSCUGQ4IPZMVGZ5LCVYHQMYBKN/action/replication_record"}},"created_at":"2026-07-05T10:22:41.089439+00:00","updated_at":"2026-07-05T10:22:41.089439+00:00"}