{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:VTZ5ZRAJYBLSES3A7XZ43FEGZJ","short_pith_number":"pith:VTZ5ZRAJ","schema_version":"1.0","canonical_sha256":"acf3dcc409c057224b60fdf3cd9486ca5cbe598fd39533a6102d250f5f60000f","source":{"kind":"arxiv","id":"2210.09682","version":1},"attestation_state":"computed","paper":{"title":"Accelerate Three-Dimensional Generative Adversarial Networks Using Fast Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Haitao Sun, Jun Lin, Wendong Mao, Wenqiang Wang, Zhongfeng Wang, Ziqi Su","submitted_at":"2022-10-18T08:51:12Z","abstract_excerpt":"Three-dimensional generative adversarial networks (3D-GAN) have attracted widespread attention in three-dimension (3D) visual tasks. 3D deconvolution (DeConv), as an important computation of 3D-GAN, significantly increases computational complexity compared with 2D DeConv. 3D DeConv has become a bottleneck for the acceleration of 3D-GAN. Previous accelerators suffer from several problems, such as large memory requirements and resource underutilization. To handle the above issues, a fast algorithm for 3D DeConv (F3DC) is proposed in this paper. F3DC applies a fast algorithm to reduce the number "},"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":"2210.09682","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2022-10-18T08:51:12Z","cross_cats_sorted":[],"title_canon_sha256":"53981996fadfed3fa08ba9fb39cc854d9d04b0f43d9331d166387d66975b47d7","abstract_canon_sha256":"2aff20855fd995e9327de4fa501f43d9d94c5d7f45d2927c42fea91be9345bd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:58.198174Z","signature_b64":"p4qtfl2fK4ekD2Afu0Ng+aM3/WeVz4wjUWjkt7BWRMgFC7tskIp4ejTf/jSqAHyRIRrO8hJXzOcT0VHKU3doDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf3dcc409c057224b60fdf3cd9486ca5cbe598fd39533a6102d250f5f60000f","last_reissued_at":"2026-07-05T05:07:58.197685Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:58.197685Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerate Three-Dimensional Generative Adversarial Networks Using Fast Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Haitao Sun, Jun Lin, Wendong Mao, Wenqiang Wang, Zhongfeng Wang, Ziqi Su","submitted_at":"2022-10-18T08:51:12Z","abstract_excerpt":"Three-dimensional generative adversarial networks (3D-GAN) have attracted widespread attention in three-dimension (3D) visual tasks. 3D deconvolution (DeConv), as an important computation of 3D-GAN, significantly increases computational complexity compared with 2D DeConv. 3D DeConv has become a bottleneck for the acceleration of 3D-GAN. Previous accelerators suffer from several problems, such as large memory requirements and resource underutilization. To handle the above issues, a fast algorithm for 3D DeConv (F3DC) is proposed in this paper. F3DC applies a fast algorithm to reduce the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.09682","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/2210.09682/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":"2210.09682","created_at":"2026-07-05T05:07:58.197753+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.09682v1","created_at":"2026-07-05T05:07:58.197753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.09682","created_at":"2026-07-05T05:07:58.197753+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTZ5ZRAJYBLS","created_at":"2026-07-05T05:07:58.197753+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTZ5ZRAJYBLSES3A","created_at":"2026-07-05T05:07:58.197753+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTZ5ZRAJ","created_at":"2026-07-05T05:07:58.197753+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/VTZ5ZRAJYBLSES3A7XZ43FEGZJ","json":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ.json","graph_json":"https://pith.science/api/pith-number/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/graph.json","events_json":"https://pith.science/api/pith-number/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/events.json","paper":"https://pith.science/paper/VTZ5ZRAJ"},"agent_actions":{"view_html":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ","download_json":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ.json","view_paper":"https://pith.science/paper/VTZ5ZRAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.09682&json=true","fetch_graph":"https://pith.science/api/pith-number/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/action/storage_attestation","attest_author":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/action/author_attestation","sign_citation":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/action/citation_signature","submit_replication":"https://pith.science/pith/VTZ5ZRAJYBLSES3A7XZ43FEGZJ/action/replication_record"}},"created_at":"2026-07-05T05:07:58.197753+00:00","updated_at":"2026-07-05T05:07:58.197753+00:00"}