{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5F4L5K4SGOQJ3OKBXDWNOK2BOL","short_pith_number":"pith:5F4L5K4S","schema_version":"1.0","canonical_sha256":"e978beab9233a09db941b8ecd72b4172cedc242f8eea39c31b56a19b564ec680","source":{"kind":"arxiv","id":"1701.06264","version":6},"attestation_state":"computed","paper":{"title":"Loss-Sensitive Generative Adversarial Networks on Lipschitz Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guo-jun Qi","submitted_at":"2017-01-23T04:46:22Z","abstract_excerpt":"In this paper, we present the Lipschitz regularization theory and algorithms for a novel Loss-Sensitive Generative Adversarial Network (LS-GAN). Specifically, it trains a loss function to distinguish between real and fake samples by designated margins, while learning a generator alternately to produce realistic samples by minimizing their losses. The LS-GAN further regularizes its loss function with a Lipschitz regularity condition on the density of real data, yielding a regularized model that can better generalize to produce new data from a reasonable number of training examples than the clas"},"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":"1701.06264","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-23T04:46:22Z","cross_cats_sorted":[],"title_canon_sha256":"1bf247a2b7ad15695205449c9fa3610d9e00232156ee7c1e51581529c33a2012","abstract_canon_sha256":"21cee74e5b059099975a34403b51b59635e5e571a0c750281cb4d8c73f5896b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:27.614918Z","signature_b64":"Ibtq5SBl5kSe6UARDd79k9uZ2AOS4iHxyAq67GVhZLn/gZpCjTPutCSopEagOqdeoqze6e+viBsmr3KBJdWUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e978beab9233a09db941b8ecd72b4172cedc242f8eea39c31b56a19b564ec680","last_reissued_at":"2026-07-05T00:19:27.614518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:27.614518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Loss-Sensitive Generative Adversarial Networks on Lipschitz Densities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guo-jun Qi","submitted_at":"2017-01-23T04:46:22Z","abstract_excerpt":"In this paper, we present the Lipschitz regularization theory and algorithms for a novel Loss-Sensitive Generative Adversarial Network (LS-GAN). Specifically, it trains a loss function to distinguish between real and fake samples by designated margins, while learning a generator alternately to produce realistic samples by minimizing their losses. The LS-GAN further regularizes its loss function with a Lipschitz regularity condition on the density of real data, yielding a regularized model that can better generalize to produce new data from a reasonable number of training examples than the clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06264","kind":"arxiv","version":6},"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/1701.06264/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":"1701.06264","created_at":"2026-07-05T00:19:27.614572+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06264v6","created_at":"2026-07-05T00:19:27.614572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06264","created_at":"2026-07-05T00:19:27.614572+00:00"},{"alias_kind":"pith_short_12","alias_value":"5F4L5K4SGOQJ","created_at":"2026-07-05T00:19:27.614572+00:00"},{"alias_kind":"pith_short_16","alias_value":"5F4L5K4SGOQJ3OKB","created_at":"2026-07-05T00:19:27.614572+00:00"},{"alias_kind":"pith_short_8","alias_value":"5F4L5K4S","created_at":"2026-07-05T00:19:27.614572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.10999","citing_title":"Spectral Regularization for Combating Mode Collapse in GANs","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL","json":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL.json","graph_json":"https://pith.science/api/pith-number/5F4L5K4SGOQJ3OKBXDWNOK2BOL/graph.json","events_json":"https://pith.science/api/pith-number/5F4L5K4SGOQJ3OKBXDWNOK2BOL/events.json","paper":"https://pith.science/paper/5F4L5K4S"},"agent_actions":{"view_html":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL","download_json":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL.json","view_paper":"https://pith.science/paper/5F4L5K4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06264&json=true","fetch_graph":"https://pith.science/api/pith-number/5F4L5K4SGOQJ3OKBXDWNOK2BOL/graph.json","fetch_events":"https://pith.science/api/pith-number/5F4L5K4SGOQJ3OKBXDWNOK2BOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL/action/storage_attestation","attest_author":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL/action/author_attestation","sign_citation":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL/action/citation_signature","submit_replication":"https://pith.science/pith/5F4L5K4SGOQJ3OKBXDWNOK2BOL/action/replication_record"}},"created_at":"2026-07-05T00:19:27.614572+00:00","updated_at":"2026-07-05T00:19:27.614572+00:00"}