{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:D235M2QODPY7CMANQIK355EVOW","short_pith_number":"pith:D235M2QO","schema_version":"1.0","canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","source":{"kind":"arxiv","id":"1507.05348","version":1},"attestation_state":"computed","paper":{"title":"Learning Complexity-Aware Cascades for Deep Pedestrian Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mohammad Saberian, Nuno Vasconcelos, Zhaowei Cai","submitted_at":"2015-07-19T22:31:01Z","abstract_excerpt":"The design of complexity-aware cascaded detectors, combining features of very different complexities, is considered. A new cascade design procedure is introduced, by formulating cascade learning as the Lagrangian optimization of a risk that accounts for both accuracy and complexity. A boosting algorithm, denoted as complexity aware cascade training (CompACT), is then derived to solve this optimization. CompACT cascades are shown to seek an optimal trade-off between accuracy and complexity by pushing features of higher complexity to the later cascade stages, where only a few difficult candidate"},"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":"1507.05348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-19T22:31:01Z","cross_cats_sorted":[],"title_canon_sha256":"5a690f43b70c8aefa5c47fcc2f996be27bb4e152badb1f354a4072436602ad3e","abstract_canon_sha256":"ec1afcb59d954ffb72207791f17d641de9ebea20e496972fef5cbdf05dab18fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:37.054143Z","signature_b64":"vi1PBJr/WuZt19/gYZRSV9X3BBaGIYFXLNStEjbvWodxsNBXwu+xedkQ1D9Ujg24w1ZH0N95VPFyKhc7Q2bOBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","last_reissued_at":"2026-05-18T01:36:37.053460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:37.053460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Complexity-Aware Cascades for Deep Pedestrian Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Mohammad Saberian, Nuno Vasconcelos, Zhaowei Cai","submitted_at":"2015-07-19T22:31:01Z","abstract_excerpt":"The design of complexity-aware cascaded detectors, combining features of very different complexities, is considered. A new cascade design procedure is introduced, by formulating cascade learning as the Lagrangian optimization of a risk that accounts for both accuracy and complexity. A boosting algorithm, denoted as complexity aware cascade training (CompACT), is then derived to solve this optimization. CompACT cascades are shown to seek an optimal trade-off between accuracy and complexity by pushing features of higher complexity to the later cascade stages, where only a few difficult candidate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05348","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":"1507.05348","created_at":"2026-05-18T01:36:37.053571+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05348v1","created_at":"2026-05-18T01:36:37.053571+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05348","created_at":"2026-05-18T01:36:37.053571+00:00"},{"alias_kind":"pith_short_12","alias_value":"D235M2QODPY7","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"D235M2QODPY7CMAN","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"D235M2QO","created_at":"2026-05-18T12:29:17.054201+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/D235M2QODPY7CMANQIK355EVOW","json":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW.json","graph_json":"https://pith.science/api/pith-number/D235M2QODPY7CMANQIK355EVOW/graph.json","events_json":"https://pith.science/api/pith-number/D235M2QODPY7CMANQIK355EVOW/events.json","paper":"https://pith.science/paper/D235M2QO"},"agent_actions":{"view_html":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW","download_json":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW.json","view_paper":"https://pith.science/paper/D235M2QO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05348&json=true","fetch_graph":"https://pith.science/api/pith-number/D235M2QODPY7CMANQIK355EVOW/graph.json","fetch_events":"https://pith.science/api/pith-number/D235M2QODPY7CMANQIK355EVOW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/action/storage_attestation","attest_author":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/action/author_attestation","sign_citation":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/action/citation_signature","submit_replication":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/action/replication_record"}},"created_at":"2026-05-18T01:36:37.053571+00:00","updated_at":"2026-05-18T01:36:37.053571+00:00"}