{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VBUY3HKCIN64PUYVZ35DPGEG4H","short_pith_number":"pith:VBUY3HKC","schema_version":"1.0","canonical_sha256":"a8698d9d42437dc7d315cefa379886e1cb017896fdf42fe425e9e300edf66a44","source":{"kind":"arxiv","id":"1701.08341","version":1},"attestation_state":"computed","paper":{"title":"Pooling Facial Segments to Face: The Shallow and Deep Ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Rama Chellappa, Sayantan Sarkar, Upal Mahbub","submitted_at":"2017-01-29T00:30:09Z","abstract_excerpt":"Generic face detection algorithms do not perform very well in the mobile domain due to significant presence of occluded and partially visible faces. One promising technique to handle the challenge of partial faces is to design face detectors based on facial segments. In this paper two such face detectors namely, SegFace and DeepSegFace, are proposed that detect the presence of a face given arbitrary combinations of certain face segments. Both methods use proposals from facial segments as input that are found using weak boosted classifiers. SegFace is a shallow and fast algorithm using traditio"},"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.08341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-29T00:30:09Z","cross_cats_sorted":[],"title_canon_sha256":"69b5d3f1d7e4d74f7ff3bfccc4e7013a772d0b81c9f7e7334ea590ba686f0049","abstract_canon_sha256":"8b344628a4dd38023a446c650190f178506bf3e7d15792fddff5363922195687"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:30.840189Z","signature_b64":"I/Oe9Y8gwV33P+RXbkWZaABjH8cGVuJFqScNI9PrpCmOqyHLIQiOqVAIZsEum/eZF59JakKPgakTYYl8lkHzAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8698d9d42437dc7d315cefa379886e1cb017896fdf42fe425e9e300edf66a44","last_reissued_at":"2026-05-18T00:10:30.839459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:30.839459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pooling Facial Segments to Face: The Shallow and Deep Ends","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Rama Chellappa, Sayantan Sarkar, Upal Mahbub","submitted_at":"2017-01-29T00:30:09Z","abstract_excerpt":"Generic face detection algorithms do not perform very well in the mobile domain due to significant presence of occluded and partially visible faces. One promising technique to handle the challenge of partial faces is to design face detectors based on facial segments. In this paper two such face detectors namely, SegFace and DeepSegFace, are proposed that detect the presence of a face given arbitrary combinations of certain face segments. Both methods use proposals from facial segments as input that are found using weak boosted classifiers. SegFace is a shallow and fast algorithm using traditio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08341","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":"1701.08341","created_at":"2026-05-18T00:10:30.839590+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.08341v1","created_at":"2026-05-18T00:10:30.839590+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08341","created_at":"2026-05-18T00:10:30.839590+00:00"},{"alias_kind":"pith_short_12","alias_value":"VBUY3HKCIN64","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VBUY3HKCIN64PUYV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VBUY3HKC","created_at":"2026-05-18T12:31:49.984773+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/VBUY3HKCIN64PUYVZ35DPGEG4H","json":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H.json","graph_json":"https://pith.science/api/pith-number/VBUY3HKCIN64PUYVZ35DPGEG4H/graph.json","events_json":"https://pith.science/api/pith-number/VBUY3HKCIN64PUYVZ35DPGEG4H/events.json","paper":"https://pith.science/paper/VBUY3HKC"},"agent_actions":{"view_html":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H","download_json":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H.json","view_paper":"https://pith.science/paper/VBUY3HKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.08341&json=true","fetch_graph":"https://pith.science/api/pith-number/VBUY3HKCIN64PUYVZ35DPGEG4H/graph.json","fetch_events":"https://pith.science/api/pith-number/VBUY3HKCIN64PUYVZ35DPGEG4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H/action/storage_attestation","attest_author":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H/action/author_attestation","sign_citation":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H/action/citation_signature","submit_replication":"https://pith.science/pith/VBUY3HKCIN64PUYVZ35DPGEG4H/action/replication_record"}},"created_at":"2026-05-18T00:10:30.839590+00:00","updated_at":"2026-05-18T00:10:30.839590+00:00"}