{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IJXSTGL5KJ6ESDOYKZEHK5RI5F","short_pith_number":"pith:IJXSTGL5","schema_version":"1.0","canonical_sha256":"426f29997d527c490dd85648757628e941002e196c53d2eeea7cd3f199cba62e","source":{"kind":"arxiv","id":"1710.10772","version":2},"attestation_state":"computed","paper":{"title":"Tensorizing Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qibin Zhao, Xingwei Cao, Xuyang Zhao","submitted_at":"2017-10-30T05:05:02Z","abstract_excerpt":"Generative Adversarial Network (GAN) and its variants exhibit state-of-the-art performance in the class of generative models. To capture higher-dimensional distributions, the common learning procedure requires high computational complexity and a large number of parameters. The problem of employing such massive framework arises when deploying it on a platform with limited computational power such as mobile phones. In this paper, we present a new generative adversarial framework by representing each layer as a tensor structure connected by multilinear operations, aiming to reduce the number of m"},"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":"1710.10772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-30T05:05:02Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"80344a973fa5053ecd00f4757d2e637590617d60196dd5e6207439ce41be28b5","abstract_canon_sha256":"8eb6e167e99a85763b9f3562ef93f0f46ce1559a04cf015a1fecf93971fad91f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:47.312593Z","signature_b64":"rAlCGUB/TqvluqFbkNKmBa+UYrvYQT0aDCfUGiNvQ/Ga0BU3c/InVOfczvWPWQWZRZa7eBgRC+qv2ZKaNxflAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"426f29997d527c490dd85648757628e941002e196c53d2eeea7cd3f199cba62e","last_reissued_at":"2026-05-18T00:19:47.311748Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:47.311748Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tensorizing Generative Adversarial Nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qibin Zhao, Xingwei Cao, Xuyang Zhao","submitted_at":"2017-10-30T05:05:02Z","abstract_excerpt":"Generative Adversarial Network (GAN) and its variants exhibit state-of-the-art performance in the class of generative models. To capture higher-dimensional distributions, the common learning procedure requires high computational complexity and a large number of parameters. The problem of employing such massive framework arises when deploying it on a platform with limited computational power such as mobile phones. In this paper, we present a new generative adversarial framework by representing each layer as a tensor structure connected by multilinear operations, aiming to reduce the number of m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10772","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.10772","created_at":"2026-05-18T00:19:47.311879+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10772v2","created_at":"2026-05-18T00:19:47.311879+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10772","created_at":"2026-05-18T00:19:47.311879+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJXSTGL5KJ6E","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJXSTGL5KJ6ESDOY","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJXSTGL5","created_at":"2026-05-18T12:31:21.493067+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/IJXSTGL5KJ6ESDOYKZEHK5RI5F","json":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F.json","graph_json":"https://pith.science/api/pith-number/IJXSTGL5KJ6ESDOYKZEHK5RI5F/graph.json","events_json":"https://pith.science/api/pith-number/IJXSTGL5KJ6ESDOYKZEHK5RI5F/events.json","paper":"https://pith.science/paper/IJXSTGL5"},"agent_actions":{"view_html":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F","download_json":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F.json","view_paper":"https://pith.science/paper/IJXSTGL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10772&json=true","fetch_graph":"https://pith.science/api/pith-number/IJXSTGL5KJ6ESDOYKZEHK5RI5F/graph.json","fetch_events":"https://pith.science/api/pith-number/IJXSTGL5KJ6ESDOYKZEHK5RI5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F/action/storage_attestation","attest_author":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F/action/author_attestation","sign_citation":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F/action/citation_signature","submit_replication":"https://pith.science/pith/IJXSTGL5KJ6ESDOYKZEHK5RI5F/action/replication_record"}},"created_at":"2026-05-18T00:19:47.311879+00:00","updated_at":"2026-05-18T00:19:47.311879+00:00"}