{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YZO3R5LYJKM2J3DHZWH2SASSLM","short_pith_number":"pith:YZO3R5LY","canonical_record":{"source":{"id":"2101.10556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-26T04:49:12Z","cross_cats_sorted":[],"title_canon_sha256":"77f6c254c383dacb6d5b51493f08f4fedd62e9d72e7d207b4d8a9fa98bc43f34","abstract_canon_sha256":"891058e6713d0fc57204e8718478a753eeac08f94cd0831d00fb084c71b793ca"},"schema_version":"1.0"},"canonical_sha256":"c65db8f5784a99a4ec67cd8fa902525b2735131a6da0082de1ae31fdf337a45c","source":{"kind":"arxiv","id":"2101.10556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10556","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10556v1","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10556","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"YZO3R5LYJKM2","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"YZO3R5LYJKM2J3DH","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"YZO3R5LY","created_at":"2026-07-05T05:04:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YZO3R5LYJKM2J3DHZWH2SASSLM","target":"record","payload":{"canonical_record":{"source":{"id":"2101.10556","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-26T04:49:12Z","cross_cats_sorted":[],"title_canon_sha256":"77f6c254c383dacb6d5b51493f08f4fedd62e9d72e7d207b4d8a9fa98bc43f34","abstract_canon_sha256":"891058e6713d0fc57204e8718478a753eeac08f94cd0831d00fb084c71b793ca"},"schema_version":"1.0"},"canonical_sha256":"c65db8f5784a99a4ec67cd8fa902525b2735131a6da0082de1ae31fdf337a45c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:04:24.665097Z","signature_b64":"k2y0Wp4GcSVLw3EXqWU3aypwR6PqoDKvZTh+pc9gnQPbGlGz6mjDAuIlpZgxl8jzxSqAlRR5nFPfsNmjDoI/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c65db8f5784a99a4ec67cd8fa902525b2735131a6da0082de1ae31fdf337a45c","last_reissued_at":"2026-07-05T05:04:24.664603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:04:24.664603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.10556","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-05T05:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hwOr/x8DxhcdAKtnP6j+Mr2cdIbUwHw9uwoOYGnnedTAhq8ePSHL7+F72tBZrTMnhTauUgHjLJhb7cincYthAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:53:52.151308Z"},"content_sha256":"8b85f9cf273b11e4ea2575f80b8750302d3656de0a356a16ea441c64e1f7cff7","schema_version":"1.0","event_id":"sha256:8b85f9cf273b11e4ea2575f80b8750302d3656de0a356a16ea441c64e1f7cff7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YZO3R5LYJKM2J3DHZWH2SASSLM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Self Sparse Generative Adversarial Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hui Li, Wangmeng Zuo, Wenliang Qian, Yang Xu","submitted_at":"2021-01-26T04:49:12Z","abstract_excerpt":"Generative Adversarial Networks (GANs) are an unsupervised generative model that learns data distribution through adversarial training. However, recent experiments indicated that GANs are difficult to train due to the requirement of optimization in the high dimensional parameter space and the zero gradient problem. In this work, we propose a Self Sparse Generative Adversarial Network (Self-Sparse GAN) that reduces the parameter space and alleviates the zero gradient problem. In the Self-Sparse GAN, we design a Self-Adaptive Sparse Transform Module (SASTM) comprising the sparsity decomposition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10556","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/2101.10556/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-05T05:04:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EOtK8yckpEE4nuGW26cl/mZJ+tjq97M9IhKHQv6WR6LIH5NAvGOIQIMW8+5yz4VHa3bKfUzooHHT/kR8QqTQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T15:53:52.151694Z"},"content_sha256":"00802347641ac39c901ad35a5f8a047614704dbb6260081eea3c88beff172f3c","schema_version":"1.0","event_id":"sha256:00802347641ac39c901ad35a5f8a047614704dbb6260081eea3c88beff172f3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/bundle.json","state_url":"https://pith.science/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/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-07-07T15:53:52Z","links":{"resolver":"https://pith.science/pith/YZO3R5LYJKM2J3DHZWH2SASSLM","bundle":"https://pith.science/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/bundle.json","state":"https://pith.science/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YZO3R5LYJKM2J3DHZWH2SASSLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YZO3R5LYJKM2J3DHZWH2SASSLM","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":"891058e6713d0fc57204e8718478a753eeac08f94cd0831d00fb084c71b793ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-26T04:49:12Z","title_canon_sha256":"77f6c254c383dacb6d5b51493f08f4fedd62e9d72e7d207b4d8a9fa98bc43f34"},"schema_version":"1.0","source":{"id":"2101.10556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.10556","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"arxiv_version","alias_value":"2101.10556v1","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.10556","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_12","alias_value":"YZO3R5LYJKM2","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_16","alias_value":"YZO3R5LYJKM2J3DH","created_at":"2026-07-05T05:04:24Z"},{"alias_kind":"pith_short_8","alias_value":"YZO3R5LY","created_at":"2026-07-05T05:04:24Z"}],"graph_snapshots":[{"event_id":"sha256:00802347641ac39c901ad35a5f8a047614704dbb6260081eea3c88beff172f3c","target":"graph","created_at":"2026-07-05T05:04:24Z","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/2101.10556/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generative Adversarial Networks (GANs) are an unsupervised generative model that learns data distribution through adversarial training. However, recent experiments indicated that GANs are difficult to train due to the requirement of optimization in the high dimensional parameter space and the zero gradient problem. In this work, we propose a Self Sparse Generative Adversarial Network (Self-Sparse GAN) that reduces the parameter space and alleviates the zero gradient problem. In the Self-Sparse GAN, we design a Self-Adaptive Sparse Transform Module (SASTM) comprising the sparsity decomposition ","authors_text":"Hui Li, Wangmeng Zuo, Wenliang Qian, Yang Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-26T04:49:12Z","title":"Self Sparse Generative Adversarial Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.10556","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:8b85f9cf273b11e4ea2575f80b8750302d3656de0a356a16ea441c64e1f7cff7","target":"record","created_at":"2026-07-05T05:04:24Z","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":"891058e6713d0fc57204e8718478a753eeac08f94cd0831d00fb084c71b793ca","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2021-01-26T04:49:12Z","title_canon_sha256":"77f6c254c383dacb6d5b51493f08f4fedd62e9d72e7d207b4d8a9fa98bc43f34"},"schema_version":"1.0","source":{"id":"2101.10556","kind":"arxiv","version":1}},"canonical_sha256":"c65db8f5784a99a4ec67cd8fa902525b2735131a6da0082de1ae31fdf337a45c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c65db8f5784a99a4ec67cd8fa902525b2735131a6da0082de1ae31fdf337a45c","first_computed_at":"2026-07-05T05:04:24.664603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:04:24.664603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k2y0Wp4GcSVLw3EXqWU3aypwR6PqoDKvZTh+pc9gnQPbGlGz6mjDAuIlpZgxl8jzxSqAlRR5nFPfsNmjDoI/Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T05:04:24.665097Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.10556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b85f9cf273b11e4ea2575f80b8750302d3656de0a356a16ea441c64e1f7cff7","sha256:00802347641ac39c901ad35a5f8a047614704dbb6260081eea3c88beff172f3c"],"state_sha256":"7e63f6e8e35a2fbed77934ed861e00e0d34b945c448051840294de7b72d2b24a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QrzZnITsaD6fmO3UZuuEwvpX0Wvvk+SxXpxS4OyMbzgz5mpync8dIH3s6HUvV/xG8e0+zvHN5EEk7kN9QQeyCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T15:53:52.153608Z","bundle_sha256":"3c4fa3d68925fac94ea9c6c490a33e043c71d864a34c04ee1b03c951a0240c26"}}