{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G4MNNIL27BNDACSO6DYV6ZXRC3","short_pith_number":"pith:G4MNNIL2","schema_version":"1.0","canonical_sha256":"3718d6a17af85a300a4ef0f15f66f116d3ce04aab24f66124bcb0dcc2818eefa","source":{"kind":"arxiv","id":"1706.05067","version":2},"attestation_state":"computed","paper":{"title":"Face Clustering: Representation and Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anil K. Jain, Charles Otto, Yichun Shi","submitted_at":"2017-06-15T20:17:33Z","abstract_excerpt":"Clustering face images according to their identity has two important applications: (i) grouping a collection of face images when no external labels are associated with images, and (ii) indexing for efficient large scale face retrieval. The clustering problem is composed of two key parts: face representation and choice of similarity for grouping faces. We first propose a representation based on ResNet, which has been shown to perform very well in image classification problems. Given this representation, we design a clustering algorithm, Conditional Pairwise Clustering (ConPaC), which directly e"},"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":"1706.05067","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-06-15T20:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"d17845723c1414a3f41136f7c069ca9bf6f10753d355f5186a388b448ea18a5b","abstract_canon_sha256":"6e97b081adf4a48abd3bfbc3a2af80ddfbc3044d2cf17ece92b1cea0dc63c18d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.244143Z","signature_b64":"9aoeAW5j6/4xvlXFiFyqoIw4Dqmkx82M3letoRyYKpMIG8TSdXoiNodH1Ko8UM1nRi4az7yZ2ZoT4skGeOtlDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3718d6a17af85a300a4ef0f15f66f116d3ce04aab24f66124bcb0dcc2818eefa","last_reissued_at":"2026-05-18T00:09:42.243366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.243366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Face Clustering: Representation and Pairwise Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Anil K. Jain, Charles Otto, Yichun Shi","submitted_at":"2017-06-15T20:17:33Z","abstract_excerpt":"Clustering face images according to their identity has two important applications: (i) grouping a collection of face images when no external labels are associated with images, and (ii) indexing for efficient large scale face retrieval. The clustering problem is composed of two key parts: face representation and choice of similarity for grouping faces. We first propose a representation based on ResNet, which has been shown to perform very well in image classification problems. Given this representation, we design a clustering algorithm, Conditional Pairwise Clustering (ConPaC), which directly e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.05067","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":"1706.05067","created_at":"2026-05-18T00:09:42.243498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.05067v2","created_at":"2026-05-18T00:09:42.243498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.05067","created_at":"2026-05-18T00:09:42.243498+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4MNNIL27BND","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4MNNIL27BNDACSO","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4MNNIL2","created_at":"2026-05-18T12:31:15.632608+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/G4MNNIL27BNDACSO6DYV6ZXRC3","json":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3.json","graph_json":"https://pith.science/api/pith-number/G4MNNIL27BNDACSO6DYV6ZXRC3/graph.json","events_json":"https://pith.science/api/pith-number/G4MNNIL27BNDACSO6DYV6ZXRC3/events.json","paper":"https://pith.science/paper/G4MNNIL2"},"agent_actions":{"view_html":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3","download_json":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3.json","view_paper":"https://pith.science/paper/G4MNNIL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.05067&json=true","fetch_graph":"https://pith.science/api/pith-number/G4MNNIL27BNDACSO6DYV6ZXRC3/graph.json","fetch_events":"https://pith.science/api/pith-number/G4MNNIL27BNDACSO6DYV6ZXRC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3/action/storage_attestation","attest_author":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3/action/author_attestation","sign_citation":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3/action/citation_signature","submit_replication":"https://pith.science/pith/G4MNNIL27BNDACSO6DYV6ZXRC3/action/replication_record"}},"created_at":"2026-05-18T00:09:42.243498+00:00","updated_at":"2026-05-18T00:09:42.243498+00:00"}