{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IGVB5TWLCBQCYPUVCQ4UVIGLWV","short_pith_number":"pith:IGVB5TWL","canonical_record":{"source":{"id":"1405.6804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-27T06:29:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dc7e64716ceb776b35782d3f3ca11b0da2ad7c25d177b547d310358a8bda1911","abstract_canon_sha256":"3007d1af5bbf80e85240d5df3ad63c65a8dc1e0a9a97012e2879621a239a0f9b"},"schema_version":"1.0"},"canonical_sha256":"41aa1ececb10602c3e9514394aa0cbb553b9a179ebe06642f962bbf7ecdb9ee7","source":{"kind":"arxiv","id":"1405.6804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6804","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6804v2","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6804","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"IGVB5TWLCBQC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IGVB5TWLCBQCYPUV","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IGVB5TWL","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IGVB5TWLCBQCYPUVCQ4UVIGLWV","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-27T06:29:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dc7e64716ceb776b35782d3f3ca11b0da2ad7c25d177b547d310358a8bda1911","abstract_canon_sha256":"3007d1af5bbf80e85240d5df3ad63c65a8dc1e0a9a97012e2879621a239a0f9b"},"schema_version":"1.0"},"canonical_sha256":"41aa1ececb10602c3e9514394aa0cbb553b9a179ebe06642f962bbf7ecdb9ee7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:59.352028Z","signature_b64":"NAL5CL1yV4NYO2K6D2RL2MO/V+IZzp3YBsAV66FV3YxcJa5koBbSMajCX8n0nuyi1x7LAtjZRmQGKG5Sb3fnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41aa1ececb10602c3e9514394aa0cbb553b9a179ebe06642f962bbf7ecdb9ee7","last_reissued_at":"2026-05-18T02:50:59.351237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:59.351237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6804","source_version":2,"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-18T02:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yz6FA1MV5o6Y2Dz1td9WOApp++Sn2Ff0LrkWu5na6wc6YFSwzbGF19CFNzTZWd6GWbCVqdjm2nkmld5z4QgGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:20:11.751837Z"},"content_sha256":"0ee62e2dd5ffc67d9c41ea221046d7faf1f4951df99da90b8ac099fa481b531d","schema_version":"1.0","event_id":"sha256:0ee62e2dd5ffc67d9c41ea221046d7faf1f4951df99da90b8ac099fa481b531d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IGVB5TWLCBQCYPUVCQ4UVIGLWV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layered Logic Classifiers: Exploring the `And' and `Or' Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Piotr Dollar, Yingnian Wu, Zhuowen Tu","submitted_at":"2014-05-27T06:29:01Z","abstract_excerpt":"Designing effective and efficient classifier for pattern analysis is a key problem in machine learning and computer vision. Many the solutions to the problem require to perform logic operations such as `and', `or', and `not'. Classification and regression tree (CART) include these operations explicitly. Other methods such as neural networks, SVM, and boosting learn/compute a weighted sum on features (weak classifiers), which weakly perform the 'and' and 'or' operations. However, it is hard for these classifiers to deal with the 'xor' pattern directly. In this paper, we propose layered logic cl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6804","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"},"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-18T02:50:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P/OweGas5dHRazRPTAFhJKjh80I7PRYyYTGPwQjjaIAZntGrqP/5gEpYlWavckIKfi/RMokBKNR5LBu7U857DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:20:11.752180Z"},"content_sha256":"7ae920deffd37547a5072acb89b528dffa9cf23b8dc3d19fd562b2d9e97488ef","schema_version":"1.0","event_id":"sha256:7ae920deffd37547a5072acb89b528dffa9cf23b8dc3d19fd562b2d9e97488ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/bundle.json","state_url":"https://pith.science/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/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-06-29T12:20:11Z","links":{"resolver":"https://pith.science/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV","bundle":"https://pith.science/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/bundle.json","state":"https://pith.science/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGVB5TWLCBQCYPUVCQ4UVIGLWV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IGVB5TWLCBQCYPUVCQ4UVIGLWV","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":"3007d1af5bbf80e85240d5df3ad63c65a8dc1e0a9a97012e2879621a239a0f9b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-27T06:29:01Z","title_canon_sha256":"dc7e64716ceb776b35782d3f3ca11b0da2ad7c25d177b547d310358a8bda1911"},"schema_version":"1.0","source":{"id":"1405.6804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6804","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6804v2","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6804","created_at":"2026-05-18T02:50:59Z"},{"alias_kind":"pith_short_12","alias_value":"IGVB5TWLCBQC","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IGVB5TWLCBQCYPUV","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IGVB5TWL","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:7ae920deffd37547a5072acb89b528dffa9cf23b8dc3d19fd562b2d9e97488ef","target":"graph","created_at":"2026-05-18T02:50:59Z","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":"Designing effective and efficient classifier for pattern analysis is a key problem in machine learning and computer vision. Many the solutions to the problem require to perform logic operations such as `and', `or', and `not'. Classification and regression tree (CART) include these operations explicitly. Other methods such as neural networks, SVM, and boosting learn/compute a weighted sum on features (weak classifiers), which weakly perform the 'and' and 'or' operations. However, it is hard for these classifiers to deal with the 'xor' pattern directly. In this paper, we propose layered logic cl","authors_text":"Piotr Dollar, Yingnian Wu, Zhuowen Tu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-27T06:29:01Z","title":"Layered Logic Classifiers: Exploring the `And' and `Or' Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6804","kind":"arxiv","version":2},"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:0ee62e2dd5ffc67d9c41ea221046d7faf1f4951df99da90b8ac099fa481b531d","target":"record","created_at":"2026-05-18T02:50:59Z","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":"3007d1af5bbf80e85240d5df3ad63c65a8dc1e0a9a97012e2879621a239a0f9b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-27T06:29:01Z","title_canon_sha256":"dc7e64716ceb776b35782d3f3ca11b0da2ad7c25d177b547d310358a8bda1911"},"schema_version":"1.0","source":{"id":"1405.6804","kind":"arxiv","version":2}},"canonical_sha256":"41aa1ececb10602c3e9514394aa0cbb553b9a179ebe06642f962bbf7ecdb9ee7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41aa1ececb10602c3e9514394aa0cbb553b9a179ebe06642f962bbf7ecdb9ee7","first_computed_at":"2026-05-18T02:50:59.351237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:59.351237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NAL5CL1yV4NYO2K6D2RL2MO/V+IZzp3YBsAV66FV3YxcJa5koBbSMajCX8n0nuyi1x7LAtjZRmQGKG5Sb3fnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:59.352028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee62e2dd5ffc67d9c41ea221046d7faf1f4951df99da90b8ac099fa481b531d","sha256:7ae920deffd37547a5072acb89b528dffa9cf23b8dc3d19fd562b2d9e97488ef"],"state_sha256":"c3324e291d14d4ae1a5aa802dd9deda9c81f77f265187f06efae32ac40aeb5a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l0qtN2IdQRLXkJQJjWOEGoBaoU3KfnfyPMLRemRk/Yc3sPRMisiUhhUUHmgOag+N9CecbDEAMr0T1rTo6kdXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:20:11.754058Z","bundle_sha256":"a87b7e27bdc15c412c9bab8d2b60a38a68af0dcdc94d8e695aaccdd7de08879c"}}