{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6TKRKSSO22BDIKXPNE5DVBCRHT","short_pith_number":"pith:6TKRKSSO","canonical_record":{"source":{"id":"1906.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-09T15:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"ee4b58fdc61766947ad17c8a19dd885501258dc238ade026ab8ec5796c33a97f","abstract_canon_sha256":"04fd52af8344dc78df84f0cc2c9df139ab7b14d60eb7672a2cf1a149b034d069"},"schema_version":"1.0"},"canonical_sha256":"f4d5154a4ed682342aef693a3a84513ceef1f5a249ddc505cfe52848582be189","source":{"kind":"arxiv","id":"1906.03657","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03657","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03657v1","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03657","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"6TKRKSSO22BD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6TKRKSSO22BDIKXP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6TKRKSSO","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6TKRKSSO22BDIKXPNE5DVBCRHT","target":"record","payload":{"canonical_record":{"source":{"id":"1906.03657","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-09T15:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"ee4b58fdc61766947ad17c8a19dd885501258dc238ade026ab8ec5796c33a97f","abstract_canon_sha256":"04fd52af8344dc78df84f0cc2c9df139ab7b14d60eb7672a2cf1a149b034d069"},"schema_version":"1.0"},"canonical_sha256":"f4d5154a4ed682342aef693a3a84513ceef1f5a249ddc505cfe52848582be189","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:45.464271Z","signature_b64":"ivzkYeJ/pSb6ZuuZNqm3H7fAgKnVY8N2k41Igu6/tciMYpMb1/8qpAfaObJtSleLJltyj3KYRM0KXtKPt8DTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4d5154a4ed682342aef693a3a84513ceef1f5a249ddc505cfe52848582be189","last_reissued_at":"2026-05-17T23:43:45.463417Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:45.463417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.03657","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-05-17T23:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gW2UF5SYbr0S7rqoZhGl1y8UNPPSewltEUqqN13gYvek6GnXhkez7lshAHm+i85JnxwOTPH7OlUrTA90eVTzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:14:41.696666Z"},"content_sha256":"1791247ad160cca73e4f3af9879f967c268fae3844926e012a96374b1f1d2da6","schema_version":"1.0","event_id":"sha256:1791247ad160cca73e4f3af9879f967c268fae3844926e012a96374b1f1d2da6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6TKRKSSO22BDIKXPNE5DVBCRHT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HGC: Hierarchical Group Convolution for Highly Efficient Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Sun-Yuan Kung, Xukai Xie, Yuan Zhou","submitted_at":"2019-06-09T15:24:42Z","abstract_excerpt":"Group convolution works well with many deep convolutional neural networks (CNNs) that can effectively compress the model by reducing the number of parameters and computational cost. Using this operation, feature maps of different group cannot communicate, which restricts their representation capability. To address this issue, in this work, we propose a novel operation named Hierarchical Group Convolution (HGC) for creating computationally efficient neural networks. Different from standard group convolution which blocks the inter-group information exchange and induces the severe performance deg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03657","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":""},"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-05-17T23:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l4iVOi5yFjGjVLGOL/vpv6E+fiBfY46nDo+2bC1EGrPjt/4LUbOWfF/n4DDQOgUIZST5FADcp7DST4h2FdCOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:14:41.697248Z"},"content_sha256":"6f45a827ca14ff4aef1d0da60be728398a2455d6755b5752ff7ec90227af4783","schema_version":"1.0","event_id":"sha256:6f45a827ca14ff4aef1d0da60be728398a2455d6755b5752ff7ec90227af4783"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/bundle.json","state_url":"https://pith.science/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/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-06-06T21:14:41Z","links":{"resolver":"https://pith.science/pith/6TKRKSSO22BDIKXPNE5DVBCRHT","bundle":"https://pith.science/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/bundle.json","state":"https://pith.science/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TKRKSSO22BDIKXPNE5DVBCRHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6TKRKSSO22BDIKXPNE5DVBCRHT","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":"04fd52af8344dc78df84f0cc2c9df139ab7b14d60eb7672a2cf1a149b034d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-09T15:24:42Z","title_canon_sha256":"ee4b58fdc61766947ad17c8a19dd885501258dc238ade026ab8ec5796c33a97f"},"schema_version":"1.0","source":{"id":"1906.03657","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.03657","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1906.03657v1","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.03657","created_at":"2026-05-17T23:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"6TKRKSSO22BD","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6TKRKSSO22BDIKXP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6TKRKSSO","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:6f45a827ca14ff4aef1d0da60be728398a2455d6755b5752ff7ec90227af4783","target":"graph","created_at":"2026-05-17T23:43:45Z","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"},"paper":{"abstract_excerpt":"Group convolution works well with many deep convolutional neural networks (CNNs) that can effectively compress the model by reducing the number of parameters and computational cost. Using this operation, feature maps of different group cannot communicate, which restricts their representation capability. To address this issue, in this work, we propose a novel operation named Hierarchical Group Convolution (HGC) for creating computationally efficient neural networks. Different from standard group convolution which blocks the inter-group information exchange and induces the severe performance deg","authors_text":"Sun-Yuan Kung, Xukai Xie, Yuan Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-09T15:24:42Z","title":"HGC: Hierarchical Group Convolution for Highly Efficient Neural Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.03657","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:1791247ad160cca73e4f3af9879f967c268fae3844926e012a96374b1f1d2da6","target":"record","created_at":"2026-05-17T23:43:45Z","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":"04fd52af8344dc78df84f0cc2c9df139ab7b14d60eb7672a2cf1a149b034d069","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-06-09T15:24:42Z","title_canon_sha256":"ee4b58fdc61766947ad17c8a19dd885501258dc238ade026ab8ec5796c33a97f"},"schema_version":"1.0","source":{"id":"1906.03657","kind":"arxiv","version":1}},"canonical_sha256":"f4d5154a4ed682342aef693a3a84513ceef1f5a249ddc505cfe52848582be189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4d5154a4ed682342aef693a3a84513ceef1f5a249ddc505cfe52848582be189","first_computed_at":"2026-05-17T23:43:45.463417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:45.463417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ivzkYeJ/pSb6ZuuZNqm3H7fAgKnVY8N2k41Igu6/tciMYpMb1/8qpAfaObJtSleLJltyj3KYRM0KXtKPt8DTDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:45.464271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.03657","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1791247ad160cca73e4f3af9879f967c268fae3844926e012a96374b1f1d2da6","sha256:6f45a827ca14ff4aef1d0da60be728398a2455d6755b5752ff7ec90227af4783"],"state_sha256":"9b954fbf2c34a4f57674b0d0949b8209051705b17dd5da49c14abefc401d00c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zSyOk6WK0Cp/i0i2a+BR12t44axGWlrCWhz7BjQzf//PijAhyPNkwwnxXfpsLBjvg1fm/csA2z2wu21lHhBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:14:41.700220Z","bundle_sha256":"1414f3d14942331a812b515f07a23c40f98a75199290156214b579d59ee213e3"}}