{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KMX7FNIAFO4XM6RY3LBYKDAW4Y","short_pith_number":"pith:KMX7FNIA","schema_version":"1.0","canonical_sha256":"532ff2b5002bb9767a38dac3850c16e62d3b8b586b3a83be7c2fddd0f2879fef","source":{"kind":"arxiv","id":"1703.03305","version":1},"attestation_state":"computed","paper":{"title":"End-to-end semantic face segmentation with conditional random fields as convolutional, recurrent and adversarial networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jordi Gonz\\'alez, Marcel A. J. van Gerven, Meysam Madadi, Rob van Lier, Sergio Escalera, Umut G\\\"u\\c{c}l\\\"u, Xavier Bar\\'o, Ya\\u{g}mur G\\\"u\\c{c}l\\\"ut\\\"urk","submitted_at":"2017-03-09T15:48:22Z","abstract_excerpt":"Recent years have seen a sharp increase in the number of related yet distinct advances in semantic segmentation. Here, we tackle this problem by leveraging the respective strengths of these advances. That is, we formulate a conditional random field over a four-connected graph as end-to-end trainable convolutional and recurrent networks, and estimate them via an adversarial process. Importantly, our model learns not only unary potentials but also pairwise potentials, while aggregating multi-scale contexts and controlling higher-order inconsistencies. We evaluate our model on two standard benchm"},"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":"1703.03305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-03-09T15:48:22Z","cross_cats_sorted":[],"title_canon_sha256":"3b707282345b6ff195bb2557fa81c388b4fb4cd9b7c8fb2a6034cb3baff0bee2","abstract_canon_sha256":"85ecc8c5891466b5274dd64b40dd2a8e398cb44b7dd1e256cf07cce6c96f2dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:00.727688Z","signature_b64":"5vz4jeTcfgh7xh1ZaIDvL9pbp5D5RdQLF37vQfnam40NaFsXDR4YY77y0S415J5dloFsA156vQylhUU/BiblAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"532ff2b5002bb9767a38dac3850c16e62d3b8b586b3a83be7c2fddd0f2879fef","last_reissued_at":"2026-05-18T00:49:00.726976Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:00.726976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"End-to-end semantic face segmentation with conditional random fields as convolutional, recurrent and adversarial networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jordi Gonz\\'alez, Marcel A. J. van Gerven, Meysam Madadi, Rob van Lier, Sergio Escalera, Umut G\\\"u\\c{c}l\\\"u, Xavier Bar\\'o, Ya\\u{g}mur G\\\"u\\c{c}l\\\"ut\\\"urk","submitted_at":"2017-03-09T15:48:22Z","abstract_excerpt":"Recent years have seen a sharp increase in the number of related yet distinct advances in semantic segmentation. Here, we tackle this problem by leveraging the respective strengths of these advances. That is, we formulate a conditional random field over a four-connected graph as end-to-end trainable convolutional and recurrent networks, and estimate them via an adversarial process. Importantly, our model learns not only unary potentials but also pairwise potentials, while aggregating multi-scale contexts and controlling higher-order inconsistencies. We evaluate our model on two standard benchm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.03305","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":""},"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":"1703.03305","created_at":"2026-05-18T00:49:00.727092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.03305v1","created_at":"2026-05-18T00:49:00.727092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.03305","created_at":"2026-05-18T00:49:00.727092+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMX7FNIAFO4X","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMX7FNIAFO4XM6RY","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMX7FNIA","created_at":"2026-05-18T12:31:24.725408+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/KMX7FNIAFO4XM6RY3LBYKDAW4Y","json":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y.json","graph_json":"https://pith.science/api/pith-number/KMX7FNIAFO4XM6RY3LBYKDAW4Y/graph.json","events_json":"https://pith.science/api/pith-number/KMX7FNIAFO4XM6RY3LBYKDAW4Y/events.json","paper":"https://pith.science/paper/KMX7FNIA"},"agent_actions":{"view_html":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y","download_json":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y.json","view_paper":"https://pith.science/paper/KMX7FNIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.03305&json=true","fetch_graph":"https://pith.science/api/pith-number/KMX7FNIAFO4XM6RY3LBYKDAW4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/KMX7FNIAFO4XM6RY3LBYKDAW4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y/action/storage_attestation","attest_author":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y/action/author_attestation","sign_citation":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y/action/citation_signature","submit_replication":"https://pith.science/pith/KMX7FNIAFO4XM6RY3LBYKDAW4Y/action/replication_record"}},"created_at":"2026-05-18T00:49:00.727092+00:00","updated_at":"2026-05-18T00:49:00.727092+00:00"}