{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:XZDCH5YDH3OQDEJCXREL77WIPF","short_pith_number":"pith:XZDCH5YD","schema_version":"1.0","canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","source":{"kind":"arxiv","id":"2110.05060","version":1},"attestation_state":"computed","paper":{"title":"Two-level Group Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Chang-Ock Lee, Jongho Park, Youngkyu Lee","submitted_at":"2021-10-11T07:54:49Z","abstract_excerpt":"Group convolution has been widely used in order to reduce the computation time of convolution, which takes most of the training time of convolutional neural networks. However, it is well known that a large number of groups significantly reduce the performance of group convolution. In this paper, we propose a new convolution methodology called ``two-level'' group convolution that is robust with respect to the increase of the number of groups and suitable for multi-GPU parallel computation. We first observe that the group convolution can be interpreted as a one-level block Jacobi approximation o"},"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":"2110.05060","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T07:54:49Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"bf422c18a6b30f75618e0057f5a2e42812bbbec8e87590927f7c428426c51fbf","abstract_canon_sha256":"a61fe080595c04355ed64b5ef40d51498b1949c00a08043d7b287cf6eed15613"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:36.888190Z","signature_b64":"KrmMMTIVd4p58unRqO5Iqfdpb5KniiNHaq3EQt2fCosTXpy8JAWDBDRQ7Kaih6CI1HWRl4uGEhe4bHpT4nDQCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","last_reissued_at":"2026-07-05T04:55:36.887713Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:36.887713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-level Group Convolution","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.LG","authors_text":"Chang-Ock Lee, Jongho Park, Youngkyu Lee","submitted_at":"2021-10-11T07:54:49Z","abstract_excerpt":"Group convolution has been widely used in order to reduce the computation time of convolution, which takes most of the training time of convolutional neural networks. However, it is well known that a large number of groups significantly reduce the performance of group convolution. In this paper, we propose a new convolution methodology called ``two-level'' group convolution that is robust with respect to the increase of the number of groups and suitable for multi-GPU parallel computation. We first observe that the group convolution can be interpreted as a one-level block Jacobi approximation o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05060","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/2110.05060/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":"2110.05060","created_at":"2026-07-05T04:55:36.887771+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.05060v1","created_at":"2026-07-05T04:55:36.887771+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05060","created_at":"2026-07-05T04:55:36.887771+00:00"},{"alias_kind":"pith_short_12","alias_value":"XZDCH5YDH3OQ","created_at":"2026-07-05T04:55:36.887771+00:00"},{"alias_kind":"pith_short_16","alias_value":"XZDCH5YDH3OQDEJC","created_at":"2026-07-05T04:55:36.887771+00:00"},{"alias_kind":"pith_short_8","alias_value":"XZDCH5YD","created_at":"2026-07-05T04:55:36.887771+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/XZDCH5YDH3OQDEJCXREL77WIPF","json":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF.json","graph_json":"https://pith.science/api/pith-number/XZDCH5YDH3OQDEJCXREL77WIPF/graph.json","events_json":"https://pith.science/api/pith-number/XZDCH5YDH3OQDEJCXREL77WIPF/events.json","paper":"https://pith.science/paper/XZDCH5YD"},"agent_actions":{"view_html":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF","download_json":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF.json","view_paper":"https://pith.science/paper/XZDCH5YD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.05060&json=true","fetch_graph":"https://pith.science/api/pith-number/XZDCH5YDH3OQDEJCXREL77WIPF/graph.json","fetch_events":"https://pith.science/api/pith-number/XZDCH5YDH3OQDEJCXREL77WIPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/action/storage_attestation","attest_author":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/action/author_attestation","sign_citation":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/action/citation_signature","submit_replication":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/action/replication_record"}},"created_at":"2026-07-05T04:55:36.887771+00:00","updated_at":"2026-07-05T04:55:36.887771+00:00"}