{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UD7UVCJT4ALWK4NM27EOIJ2PO7","short_pith_number":"pith:UD7UVCJT","canonical_record":{"source":{"id":"1909.00632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-02T09:42:52Z","cross_cats_sorted":[],"title_canon_sha256":"b45f95bbdce59e8399a5e508ecf82647eb5f483713d0587755da46c4bab97a6a","abstract_canon_sha256":"d34df8e3b564c3290e98f808f6bb027b754671bc616e2378e7316f091a2a009f"},"schema_version":"1.0"},"canonical_sha256":"a0ff4a8933e0176571acd7c8e4274f77fe8716a7136dd40348f33b4753c26de5","source":{"kind":"arxiv","id":"1909.00632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00632","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00632v1","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00632","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"UD7UVCJT4ALW","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_16","alias_value":"UD7UVCJT4ALWK4NM","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_8","alias_value":"UD7UVCJT","created_at":"2026-07-05T00:01:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UD7UVCJT4ALWK4NM27EOIJ2PO7","target":"record","payload":{"canonical_record":{"source":{"id":"1909.00632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-02T09:42:52Z","cross_cats_sorted":[],"title_canon_sha256":"b45f95bbdce59e8399a5e508ecf82647eb5f483713d0587755da46c4bab97a6a","abstract_canon_sha256":"d34df8e3b564c3290e98f808f6bb027b754671bc616e2378e7316f091a2a009f"},"schema_version":"1.0"},"canonical_sha256":"a0ff4a8933e0176571acd7c8e4274f77fe8716a7136dd40348f33b4753c26de5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:11.611281Z","signature_b64":"hvUu/kq6xtvVFzC4s8G+ci5QyxOPsEU8VARaSgyh1pgnW7OM19GlTJurDuZ7vT5IsB76gZQH08EeXA4hlA8OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0ff4a8933e0176571acd7c8e4274f77fe8716a7136dd40348f33b4753c26de5","last_reissued_at":"2026-07-05T00:01:11.610797Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:11.610797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1909.00632","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RFr3p0uL0+PVmiWjPGswhc+wrWaSWOR2Z178w0t4Kbo6N+9y89DAVqJFj4WfFZ/UUr45iqgz15D+XvGja5z1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:47:04.041534Z"},"content_sha256":"d90748be873ad97638a43cd5c7623233621bde70706f143f5251dbeaff74fbe2","schema_version":"1.0","event_id":"sha256:d90748be873ad97638a43cd5c7623233621bde70706f143f5251dbeaff74fbe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UD7UVCJT4ALWK4NM27EOIJ2PO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Flops-constrained Face Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Guanglu Song, Jihao Liu, Junjie Yan, Manyuan Zhang, Yucong Zhou, Yu Liu","submitted_at":"2019-09-02T09:42:52Z","abstract_excerpt":"Large scale face recognition is challenging especially when the computational budget is limited. Given a \\textit{flops} upper bound, the key is to find the optimal neural network architecture and optimization method. In this article, we briefly introduce the solutions of team 'trojans' for the ICCV19 - Lightweight Face Recognition Challenge~\\cite{lfr}. The challenge requires each submission to be one single model with the computational budget no higher than 30 GFlops. We introduce a searched network architecture `Efficient PolyFace' based on the Flops constraint, a novel loss function `ArcNegF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00632","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/1909.00632/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T00:01:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFotSWYzlkgj3Xw+Pr5sSNz1WSIONNOUr+0+zk2UWApdoKhjLFHU3x19ui5NBBNEAeeBqjccZKZTze4OdxXVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:47:04.041902Z"},"content_sha256":"022b3eb9dc0473d75dad38b69ad3d5148a8734858d6cd8126dddfa8b2bffad40","schema_version":"1.0","event_id":"sha256:022b3eb9dc0473d75dad38b69ad3d5148a8734858d6cd8126dddfa8b2bffad40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/bundle.json","state_url":"https://pith.science/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T07:47:04Z","links":{"resolver":"https://pith.science/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7","bundle":"https://pith.science/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/bundle.json","state":"https://pith.science/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UD7UVCJT4ALWK4NM27EOIJ2PO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UD7UVCJT4ALWK4NM27EOIJ2PO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d34df8e3b564c3290e98f808f6bb027b754671bc616e2378e7316f091a2a009f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-02T09:42:52Z","title_canon_sha256":"b45f95bbdce59e8399a5e508ecf82647eb5f483713d0587755da46c4bab97a6a"},"schema_version":"1.0","source":{"id":"1909.00632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1909.00632","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"arxiv_version","alias_value":"1909.00632v1","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00632","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_12","alias_value":"UD7UVCJT4ALW","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_16","alias_value":"UD7UVCJT4ALWK4NM","created_at":"2026-07-05T00:01:11Z"},{"alias_kind":"pith_short_8","alias_value":"UD7UVCJT","created_at":"2026-07-05T00:01:11Z"}],"graph_snapshots":[{"event_id":"sha256:022b3eb9dc0473d75dad38b69ad3d5148a8734858d6cd8126dddfa8b2bffad40","target":"graph","created_at":"2026-07-05T00:01:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1909.00632/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large scale face recognition is challenging especially when the computational budget is limited. Given a \\textit{flops} upper bound, the key is to find the optimal neural network architecture and optimization method. In this article, we briefly introduce the solutions of team 'trojans' for the ICCV19 - Lightweight Face Recognition Challenge~\\cite{lfr}. The challenge requires each submission to be one single model with the computational budget no higher than 30 GFlops. We introduce a searched network architecture `Efficient PolyFace' based on the Flops constraint, a novel loss function `ArcNegF","authors_text":"Guanglu Song, Jihao Liu, Junjie Yan, Manyuan Zhang, Yucong Zhou, Yu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-02T09:42:52Z","title":"Towards Flops-constrained Face Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00632","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d90748be873ad97638a43cd5c7623233621bde70706f143f5251dbeaff74fbe2","target":"record","created_at":"2026-07-05T00:01:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d34df8e3b564c3290e98f808f6bb027b754671bc616e2378e7316f091a2a009f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-09-02T09:42:52Z","title_canon_sha256":"b45f95bbdce59e8399a5e508ecf82647eb5f483713d0587755da46c4bab97a6a"},"schema_version":"1.0","source":{"id":"1909.00632","kind":"arxiv","version":1}},"canonical_sha256":"a0ff4a8933e0176571acd7c8e4274f77fe8716a7136dd40348f33b4753c26de5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0ff4a8933e0176571acd7c8e4274f77fe8716a7136dd40348f33b4753c26de5","first_computed_at":"2026-07-05T00:01:11.610797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:01:11.610797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hvUu/kq6xtvVFzC4s8G+ci5QyxOPsEU8VARaSgyh1pgnW7OM19GlTJurDuZ7vT5IsB76gZQH08EeXA4hlA8OCg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:01:11.611281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1909.00632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d90748be873ad97638a43cd5c7623233621bde70706f143f5251dbeaff74fbe2","sha256:022b3eb9dc0473d75dad38b69ad3d5148a8734858d6cd8126dddfa8b2bffad40"],"state_sha256":"c6dc8a36413fb5ae1459d203b4f6093a561ca83eb89c0188c81356f8bc171db6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cAAkNGcTjRp8RDuXI7+Eqds6jGh89wDzogB936ZqhsFtacvdvO6glvkQD/EvyWTimlWym9TY8NBwo8ziC//DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:47:04.043952Z","bundle_sha256":"68d8d0542374e9fd638c95d1f126f3ace25727ca7d2f59aa3f4ece0cc7db22e3"}}