{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7K3D3RC2SHW32PKR7B3LIPUZNY","short_pith_number":"pith:7K3D3RC2","canonical_record":{"source":{"id":"2211.02281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-04T06:41:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2d0faf47808e78088d0e31d195758a6cb3468bfcc730c5ba3b5d2ddef975039a","abstract_canon_sha256":"be592ba87968f5ec4897843d16e25398f3f28cdaf3a439c3ec31bf76a66129d6"},"schema_version":"1.0"},"canonical_sha256":"fab63dc45a91edbd3d51f876b43e996e1b6309b49e80abaa5dea4c7aa9b2e37e","source":{"kind":"arxiv","id":"2211.02281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02281","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02281v1","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02281","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"7K3D3RC2SHW3","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"7K3D3RC2SHW32PKR","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"7K3D3RC2","created_at":"2026-07-05T05:13:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7K3D3RC2SHW32PKR7B3LIPUZNY","target":"record","payload":{"canonical_record":{"source":{"id":"2211.02281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-04T06:41:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2d0faf47808e78088d0e31d195758a6cb3468bfcc730c5ba3b5d2ddef975039a","abstract_canon_sha256":"be592ba87968f5ec4897843d16e25398f3f28cdaf3a439c3ec31bf76a66129d6"},"schema_version":"1.0"},"canonical_sha256":"fab63dc45a91edbd3d51f876b43e996e1b6309b49e80abaa5dea4c7aa9b2e37e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:13:13.594613Z","signature_b64":"RZmQVvePBxAgH5yiEOdN2QJ3fRmLCInCULqKHMr55K0o4W4MOInMTXOTrmtJe3eYqF7RDOmg6TUDlKtt4eivAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab63dc45a91edbd3d51f876b43e996e1b6309b49e80abaa5dea4c7aa9b2e37e","last_reissued_at":"2026-07-05T05:13:13.594264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:13:13.594264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2211.02281","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-05T05:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgVm5d3OeH6Mi2v3qP088ZsZj+Re2RLimsFzETES8A8b2P7Kb+zWeXLVy5p4y8nTiBsLycgRMTDUivxgImYGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:27:57.036560Z"},"content_sha256":"01b67615c62db9b1d0adfd61ec5165563bcd97c396097dcaf3c96f6cf4403ca7","schema_version":"1.0","event_id":"sha256:01b67615c62db9b1d0adfd61ec5165563bcd97c396097dcaf3c96f6cf4403ca7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7K3D3RC2SHW32PKR7B3LIPUZNY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient FPGA-based Accelerator for Deep Forest","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiapeng Luo, Mingyu Zhu, Wendong Mao, Zhongfeng Wang","submitted_at":"2022-11-04T06:41:46Z","abstract_excerpt":"Deep Forest is a prominent machine learning algorithm known for its high accuracy in forecasting. Compared with deep neural networks, Deep Forest has almost no multiplication operations and has better performance on small datasets. However, due to the deep structure and large forest quantity, it suffers from large amounts of calculation and memory consumption. In this paper, an efficient hardware accelerator is proposed for deep forest models, which is also the first work to implement Deep Forest on FPGA. Firstly, a delicate node computing unit (NCU) is designed to improve inference speed. Sec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02281","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/2211.02281/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-05T05:13:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KmuqgEJojHdeanNC/OXKNUlfnXERnDtnpYTtJEbjUMhc4LnyfXq2A/jlqJUt2zVmO+w9L4YHnejodK50NRGJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:27:57.037510Z"},"content_sha256":"a67281a178b832e8c286c539385f76a40cff33279766bf3b661e0f33d02e5cba","schema_version":"1.0","event_id":"sha256:a67281a178b832e8c286c539385f76a40cff33279766bf3b661e0f33d02e5cba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/bundle.json","state_url":"https://pith.science/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/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-08-03T18:27:57Z","links":{"resolver":"https://pith.science/pith/7K3D3RC2SHW32PKR7B3LIPUZNY","bundle":"https://pith.science/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/bundle.json","state":"https://pith.science/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7K3D3RC2SHW32PKR7B3LIPUZNY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7K3D3RC2SHW32PKR7B3LIPUZNY","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":"be592ba87968f5ec4897843d16e25398f3f28cdaf3a439c3ec31bf76a66129d6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-04T06:41:46Z","title_canon_sha256":"2d0faf47808e78088d0e31d195758a6cb3468bfcc730c5ba3b5d2ddef975039a"},"schema_version":"1.0","source":{"id":"2211.02281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.02281","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"arxiv_version","alias_value":"2211.02281v1","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.02281","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_12","alias_value":"7K3D3RC2SHW3","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_16","alias_value":"7K3D3RC2SHW32PKR","created_at":"2026-07-05T05:13:13Z"},{"alias_kind":"pith_short_8","alias_value":"7K3D3RC2","created_at":"2026-07-05T05:13:13Z"}],"graph_snapshots":[{"event_id":"sha256:a67281a178b832e8c286c539385f76a40cff33279766bf3b661e0f33d02e5cba","target":"graph","created_at":"2026-07-05T05:13:13Z","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/2211.02281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep Forest is a prominent machine learning algorithm known for its high accuracy in forecasting. Compared with deep neural networks, Deep Forest has almost no multiplication operations and has better performance on small datasets. However, due to the deep structure and large forest quantity, it suffers from large amounts of calculation and memory consumption. In this paper, an efficient hardware accelerator is proposed for deep forest models, which is also the first work to implement Deep Forest on FPGA. Firstly, a delicate node computing unit (NCU) is designed to improve inference speed. Sec","authors_text":"Jiapeng Luo, Mingyu Zhu, Wendong Mao, Zhongfeng Wang","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-04T06:41:46Z","title":"An Efficient FPGA-based Accelerator for Deep Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.02281","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:01b67615c62db9b1d0adfd61ec5165563bcd97c396097dcaf3c96f6cf4403ca7","target":"record","created_at":"2026-07-05T05:13:13Z","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":"be592ba87968f5ec4897843d16e25398f3f28cdaf3a439c3ec31bf76a66129d6","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-11-04T06:41:46Z","title_canon_sha256":"2d0faf47808e78088d0e31d195758a6cb3468bfcc730c5ba3b5d2ddef975039a"},"schema_version":"1.0","source":{"id":"2211.02281","kind":"arxiv","version":1}},"canonical_sha256":"fab63dc45a91edbd3d51f876b43e996e1b6309b49e80abaa5dea4c7aa9b2e37e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fab63dc45a91edbd3d51f876b43e996e1b6309b49e80abaa5dea4c7aa9b2e37e","first_computed_at":"2026-07-05T05:13:13.594264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:13:13.594264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RZmQVvePBxAgH5yiEOdN2QJ3fRmLCInCULqKHMr55K0o4W4MOInMTXOTrmtJe3eYqF7RDOmg6TUDlKtt4eivAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:13:13.594613Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.02281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01b67615c62db9b1d0adfd61ec5165563bcd97c396097dcaf3c96f6cf4403ca7","sha256:a67281a178b832e8c286c539385f76a40cff33279766bf3b661e0f33d02e5cba"],"state_sha256":"4ead8b70eefa053aa38d22ea73879cf4a3f8f07a467af006d0c1b784194066e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wE51V84xaxyXN/Ksd0sVsk/sL3YHaBrQ6QLVgSVTpls3Y5cJsGqhojpfQMYuW8tusjQLSY/KEEZHNNsGcemTCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:27:57.041101Z","bundle_sha256":"736424fbbd3f281bbc8f17324797cf8032564d635477943b788dac5162915afd"}}