{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XMQM2DMX2WXFL2ASF5UVNOPTFO","short_pith_number":"pith:XMQM2DMX","schema_version":"1.0","canonical_sha256":"bb20cd0d97d5ae55e8122f6956b9f32bbc36ef3bd790879f0d3972310686323b","source":{"kind":"arxiv","id":"1908.01790","version":1},"attestation_state":"computed","paper":{"title":"Attribute-Guided Coupled GAN for Cross-Resolution Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV"],"primary_cat":"cs.CV","authors_text":"Fariborz Taherkhani, Matthew C Valenti, Nasser M Nasrabadi, Veeru Talreja","submitted_at":"2019-08-05T18:10:55Z","abstract_excerpt":"In this paper, we propose a novel attribute-guided cross-resolution (low-resolution to high-resolution) face recognition framework that leverages a coupled generative adversarial network (GAN) structure with adversarial training to find the hidden relationship between the low-resolution and high-resolution images in a latent common embedding subspace. The coupled GAN framework consists of two sub-networks, one dedicated to the low-resolution domain and the other dedicated to the high-resolution domain. Each sub-network aims to find a projection that maximizes the pair-wise correlation between "},"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":"1908.01790","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-08-05T18:10:55Z","cross_cats_sorted":["cs.LG","eess.IV"],"title_canon_sha256":"d8564fd23a33e7dd06b35bbd89602bfe64f11e14b81a1287cf3f72b7793300cb","abstract_canon_sha256":"2c32f547b914e8069e37ef217cd3e12ddc41548d3d97eb1ecd36428b852a50b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:51:47.509655Z","signature_b64":"p0FI01sWdf1tzWfb3++4YMuaEXllZW7la9jz8lyXe2jtwH+6L6+GUwRTn7yAlogg4zRiVfx1CHDCoDhzWAomBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb20cd0d97d5ae55e8122f6956b9f32bbc36ef3bd790879f0d3972310686323b","last_reissued_at":"2026-07-04T23:51:47.509296Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:51:47.509296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Attribute-Guided Coupled GAN for Cross-Resolution Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.IV"],"primary_cat":"cs.CV","authors_text":"Fariborz Taherkhani, Matthew C Valenti, Nasser M Nasrabadi, Veeru Talreja","submitted_at":"2019-08-05T18:10:55Z","abstract_excerpt":"In this paper, we propose a novel attribute-guided cross-resolution (low-resolution to high-resolution) face recognition framework that leverages a coupled generative adversarial network (GAN) structure with adversarial training to find the hidden relationship between the low-resolution and high-resolution images in a latent common embedding subspace. The coupled GAN framework consists of two sub-networks, one dedicated to the low-resolution domain and the other dedicated to the high-resolution domain. Each sub-network aims to find a projection that maximizes the pair-wise correlation between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01790","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/1908.01790/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":"1908.01790","created_at":"2026-07-04T23:51:47.509363+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01790v1","created_at":"2026-07-04T23:51:47.509363+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01790","created_at":"2026-07-04T23:51:47.509363+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMQM2DMX2WXF","created_at":"2026-07-04T23:51:47.509363+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMQM2DMX2WXFL2AS","created_at":"2026-07-04T23:51:47.509363+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMQM2DMX","created_at":"2026-07-04T23:51:47.509363+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09630","citing_title":"Deep Sparse Band Selection for Hyperspectral Face Recognition","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO","json":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO.json","graph_json":"https://pith.science/api/pith-number/XMQM2DMX2WXFL2ASF5UVNOPTFO/graph.json","events_json":"https://pith.science/api/pith-number/XMQM2DMX2WXFL2ASF5UVNOPTFO/events.json","paper":"https://pith.science/paper/XMQM2DMX"},"agent_actions":{"view_html":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO","download_json":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO.json","view_paper":"https://pith.science/paper/XMQM2DMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01790&json=true","fetch_graph":"https://pith.science/api/pith-number/XMQM2DMX2WXFL2ASF5UVNOPTFO/graph.json","fetch_events":"https://pith.science/api/pith-number/XMQM2DMX2WXFL2ASF5UVNOPTFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO/action/storage_attestation","attest_author":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO/action/author_attestation","sign_citation":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO/action/citation_signature","submit_replication":"https://pith.science/pith/XMQM2DMX2WXFL2ASF5UVNOPTFO/action/replication_record"}},"created_at":"2026-07-04T23:51:47.509363+00:00","updated_at":"2026-07-04T23:51:47.509363+00:00"}