{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XZDCH5YDH3OQDEJCXREL77WIPF","short_pith_number":"pith:XZDCH5YD","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"},"canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","source":{"kind":"arxiv","id":"2110.05060","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05060","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05060v1","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05060","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"XZDCH5YDH3OQ","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_16","alias_value":"XZDCH5YDH3OQDEJC","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_8","alias_value":"XZDCH5YD","created_at":"2026-07-05T04:55:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XZDCH5YDH3OQDEJCXREL77WIPF","target":"record","payload":{"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"},"canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","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"},"source_kind":"arxiv","source_id":"2110.05060","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zzaEAjPtCFoCRfRWf32vO2TEPxyK2FtZd1IRsW7RzToOxEmfLBhlPSLsHGG7gTjG+KcXw91tH4ESiDZ+jFdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:06:34.883512Z"},"content_sha256":"674248db5e6417e5f23f88503c0b09d9f4464b79e2b96e864e44c9e3f780b210","schema_version":"1.0","event_id":"sha256:674248db5e6417e5f23f88503c0b09d9f4464b79e2b96e864e44c9e3f780b210"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XZDCH5YDH3OQDEJCXREL77WIPF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:55:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q3PILPF3Qg5dgPF4tUdCCdnyzDT0yr0qwbAkzRj4pq1wjqRERZDL2+pnsuC1/bMGTyDyMvd75gKiyF4DnxY2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T04:06:34.884056Z"},"content_sha256":"e64cab332da8efe3bb01333c6d20f3a33ed0acbff067e9d0f247fd88192099cb","schema_version":"1.0","event_id":"sha256:e64cab332da8efe3bb01333c6d20f3a33ed0acbff067e9d0f247fd88192099cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/bundle.json","state_url":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XZDCH5YDH3OQDEJCXREL77WIPF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T04:06:34Z","links":{"resolver":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF","bundle":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/bundle.json","state":"https://pith.science/pith/XZDCH5YDH3OQDEJCXREL77WIPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XZDCH5YDH3OQDEJCXREL77WIPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XZDCH5YDH3OQDEJCXREL77WIPF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a61fe080595c04355ed64b5ef40d51498b1949c00a08043d7b287cf6eed15613","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T07:54:49Z","title_canon_sha256":"bf422c18a6b30f75618e0057f5a2e42812bbbec8e87590927f7c428426c51fbf"},"schema_version":"1.0","source":{"id":"2110.05060","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.05060","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"arxiv_version","alias_value":"2110.05060v1","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.05060","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_12","alias_value":"XZDCH5YDH3OQ","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_16","alias_value":"XZDCH5YDH3OQDEJC","created_at":"2026-07-05T04:55:36Z"},{"alias_kind":"pith_short_8","alias_value":"XZDCH5YD","created_at":"2026-07-05T04:55:36Z"}],"graph_snapshots":[{"event_id":"sha256:e64cab332da8efe3bb01333c6d20f3a33ed0acbff067e9d0f247fd88192099cb","target":"graph","created_at":"2026-07-05T04:55:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.05060/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Chang-Ock Lee, Jongho Park, Youngkyu Lee","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T07:54:49Z","title":"Two-level Group Convolution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.05060","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:674248db5e6417e5f23f88503c0b09d9f4464b79e2b96e864e44c9e3f780b210","target":"record","created_at":"2026-07-05T04:55:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a61fe080595c04355ed64b5ef40d51498b1949c00a08043d7b287cf6eed15613","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-11T07:54:49Z","title_canon_sha256":"bf422c18a6b30f75618e0057f5a2e42812bbbec8e87590927f7c428426c51fbf"},"schema_version":"1.0","source":{"id":"2110.05060","kind":"arxiv","version":1}},"canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be4623f7033edd019122bc48bffec87949a86084550ea597f9ecf9783955b8d5","first_computed_at":"2026-07-05T04:55:36.887713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:55:36.887713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KrmMMTIVd4p58unRqO5Iqfdpb5KniiNHaq3EQt2fCosTXpy8JAWDBDRQ7Kaih6CI1HWRl4uGEhe4bHpT4nDQCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:55:36.888190Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.05060","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674248db5e6417e5f23f88503c0b09d9f4464b79e2b96e864e44c9e3f780b210","sha256:e64cab332da8efe3bb01333c6d20f3a33ed0acbff067e9d0f247fd88192099cb"],"state_sha256":"7e81b9592e953cab0dd1a200c3d7eb4d5627d2cf606b5327a34f8572e288198d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QCNjAY+Qx8nxKj5ota8RSJByM44bpALadt0/zTJ41DXa2CHwrgq1tzdyXThBOoJ+6FdE1e8TU7xodPlDgWuUCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T04:06:34.888250Z","bundle_sha256":"09fdac771133ac61a09138757af5934b2752b6d9145ff6ca8dca56b11bdf59a9"}}