{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D235M2QODPY7CMANQIK355EVOW","short_pith_number":"pith:D235M2QO","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"},"canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","source":{"kind":"arxiv","id":"1507.05348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05348","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05348v1","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05348","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"D235M2QODPY7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D235M2QODPY7CMAN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D235M2QO","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D235M2QODPY7CMANQIK355EVOW","target":"record","payload":{"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"},"canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","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"},"source_kind":"arxiv","source_id":"1507.05348","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-05-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2ts9emgGpNpA9wUhExKfEqJZjFygpMtCPsSNMtGAm+EeluUpfDqaEXsd67vBbudwJ7Ae2XcHx0/ru8GXQsZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:36.551470Z"},"content_sha256":"98df9584b67c56dee030ec8c0e7948f3e7cafae57a78b8634710ef4193a71025","schema_version":"1.0","event_id":"sha256:98df9584b67c56dee030ec8c0e7948f3e7cafae57a78b8634710ef4193a71025"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D235M2QODPY7CMANQIK355EVOW","target":"graph","payload":{"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"},"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-05-18T01:36:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VjleQSXM+yZfBoZWWptQEmW2eWPVqAiMsW5+6tA06RgEkzUBwES2T4ZrEjtEn24iwSUNWMbZFnlxoITb/EA0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T02:50:36.552044Z"},"content_sha256":"8c08c4fb94b9fb61904db70734edc075db00d5badac8145de97344e6e53729d5","schema_version":"1.0","event_id":"sha256:8c08c4fb94b9fb61904db70734edc075db00d5badac8145de97344e6e53729d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/bundle.json","state_url":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D235M2QODPY7CMANQIK355EVOW/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-05-27T02:50:36Z","links":{"resolver":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW","bundle":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/bundle.json","state":"https://pith.science/pith/D235M2QODPY7CMANQIK355EVOW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D235M2QODPY7CMANQIK355EVOW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D235M2QODPY7CMANQIK355EVOW","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":"ec1afcb59d954ffb72207791f17d641de9ebea20e496972fef5cbdf05dab18fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-19T22:31:01Z","title_canon_sha256":"5a690f43b70c8aefa5c47fcc2f996be27bb4e152badb1f354a4072436602ad3e"},"schema_version":"1.0","source":{"id":"1507.05348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.05348","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.05348v1","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05348","created_at":"2026-05-18T01:36:37Z"},{"alias_kind":"pith_short_12","alias_value":"D235M2QODPY7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D235M2QODPY7CMAN","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D235M2QO","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:8c08c4fb94b9fb61904db70734edc075db00d5badac8145de97344e6e53729d5","target":"graph","created_at":"2026-05-18T01:36:37Z","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"},"paper":{"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","authors_text":"Mohammad Saberian, Nuno Vasconcelos, Zhaowei Cai","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-19T22:31:01Z","title":"Learning Complexity-Aware Cascades for Deep Pedestrian Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05348","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:98df9584b67c56dee030ec8c0e7948f3e7cafae57a78b8634710ef4193a71025","target":"record","created_at":"2026-05-18T01:36:37Z","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":"ec1afcb59d954ffb72207791f17d641de9ebea20e496972fef5cbdf05dab18fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-07-19T22:31:01Z","title_canon_sha256":"5a690f43b70c8aefa5c47fcc2f996be27bb4e152badb1f354a4072436602ad3e"},"schema_version":"1.0","source":{"id":"1507.05348","kind":"arxiv","version":1}},"canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1eb7d66a0e1bf1f1300d8215bef49575a80f082064092b45dc62c79733a8583d","first_computed_at":"2026-05-18T01:36:37.053460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:37.053460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vi1PBJr/WuZt19/gYZRSV9X3BBaGIYFXLNStEjbvWodxsNBXwu+xedkQ1D9Ujg24w1ZH0N95VPFyKhc7Q2bOBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:37.054143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.05348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98df9584b67c56dee030ec8c0e7948f3e7cafae57a78b8634710ef4193a71025","sha256:8c08c4fb94b9fb61904db70734edc075db00d5badac8145de97344e6e53729d5"],"state_sha256":"7ab766026dcf1e1131f3ad5189c81b968bb5bf8d3ba1075b0f1a3b887fea8d91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"prY5YW/Xeow5IlTzyfQpEijzsl0NfHfAuewqTntdKO2rXX0B25G4WjV0NRtws73r/5HkIf9FhGY+ha5WEKUxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T02:50:36.555144Z","bundle_sha256":"833e26141435ef5c07d4dc6d64678d48242a1977d02144df4e5808811f3ec621"}}