{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PG75BGTUYMOMCE7GMZ5TCUH5OF","short_pith_number":"pith:PG75BGTU","canonical_record":{"source":{"id":"1812.08295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-20T00:28:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1dfdab3800572cb7e74defa54437f8c163278e9ae7fa785b1fab29231a0db202","abstract_canon_sha256":"a08a88fe3169653c2b3775e7d21c82ad022aaf6550acefadd349f0609749e691"},"schema_version":"1.0"},"canonical_sha256":"79bfd09a74c31cc113e6667b3150fd716141556b69a4f0318dba5b28d3cfcb83","source":{"kind":"arxiv","id":"1812.08295","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08295","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08295v1","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08295","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"PG75BGTUYMOM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PG75BGTUYMOMCE7G","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PG75BGTU","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PG75BGTUYMOMCE7GMZ5TCUH5OF","target":"record","payload":{"canonical_record":{"source":{"id":"1812.08295","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-20T00:28:12Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"1dfdab3800572cb7e74defa54437f8c163278e9ae7fa785b1fab29231a0db202","abstract_canon_sha256":"a08a88fe3169653c2b3775e7d21c82ad022aaf6550acefadd349f0609749e691"},"schema_version":"1.0"},"canonical_sha256":"79bfd09a74c31cc113e6667b3150fd716141556b69a4f0318dba5b28d3cfcb83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:51.714861Z","signature_b64":"iy3Loap4V+W60rZX/vL5xbtORDg95OZaBoABCR6mQubB1YTEFyFiVbgb9lbhLZfuAd+OosNdbTNcy52RzCFqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79bfd09a74c31cc113e6667b3150fd716141556b69a4f0318dba5b28d3cfcb83","last_reissued_at":"2026-05-17T23:57:51.714262Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:51.714262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.08295","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-17T23:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xLWCEvn46VkQMtwTBTcm6XNjFoQPccNlWPGTrA/WYA8qdWM8sJL9Sj98ffQP5bJ/65D/nwwtUEd3aSvWmIQgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:34:47.151637Z"},"content_sha256":"d736a60362b3f1d93945418e0ef84f9019d71b94c777f05c7da25fd1a93db6c7","schema_version":"1.0","event_id":"sha256:d736a60362b3f1d93945418e0ef84f9019d71b94c777f05c7da25fd1a93db6c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PG75BGTUYMOMCE7GMZ5TCUH5OF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient logic architecture in training gradient boosting decision tree for high-performance and edge computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Daishiro Kobayashi, Ryosuke Kasahara, Takuya Tanaka","submitted_at":"2018-12-20T00:28:12Z","abstract_excerpt":"This study proposes a logic architecture for the high-speed and power efficiently training of a gradient boosting decision tree model of binary classification. We implemented the proposed logic architecture on an FPGA and compared training time and power efficiency with three general GBDT software libraries using CPU and GPU. The training speed of the logic architecture on the FPGA was 26-259 times faster than the software libraries. The power efficiency of the logic architecture was 90-1,104 times higher than the software libraries. The results show that the logic architecture suits for high-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08295","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-17T23:57:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N4Eeh752+kZ3MQIQMxyFFwupPiO3HIzdgmQrjzllkDsLE1yjr30AjezA6OXREVY3pJtsxgislH9TixHG2eeCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:34:47.152273Z"},"content_sha256":"57e107a865add5888fc7cd796319b6d8655956cd7744d96b19d9e0251c02de29","schema_version":"1.0","event_id":"sha256:57e107a865add5888fc7cd796319b6d8655956cd7744d96b19d9e0251c02de29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/bundle.json","state_url":"https://pith.science/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/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-27T00:34:47Z","links":{"resolver":"https://pith.science/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF","bundle":"https://pith.science/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/bundle.json","state":"https://pith.science/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PG75BGTUYMOMCE7GMZ5TCUH5OF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PG75BGTUYMOMCE7GMZ5TCUH5OF","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":"a08a88fe3169653c2b3775e7d21c82ad022aaf6550acefadd349f0609749e691","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-20T00:28:12Z","title_canon_sha256":"1dfdab3800572cb7e74defa54437f8c163278e9ae7fa785b1fab29231a0db202"},"schema_version":"1.0","source":{"id":"1812.08295","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.08295","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"arxiv_version","alias_value":"1812.08295v1","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08295","created_at":"2026-05-17T23:57:51Z"},{"alias_kind":"pith_short_12","alias_value":"PG75BGTUYMOM","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PG75BGTUYMOMCE7G","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PG75BGTU","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:57e107a865add5888fc7cd796319b6d8655956cd7744d96b19d9e0251c02de29","target":"graph","created_at":"2026-05-17T23:57:51Z","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":"This study proposes a logic architecture for the high-speed and power efficiently training of a gradient boosting decision tree model of binary classification. We implemented the proposed logic architecture on an FPGA and compared training time and power efficiency with three general GBDT software libraries using CPU and GPU. The training speed of the logic architecture on the FPGA was 26-259 times faster than the software libraries. The power efficiency of the logic architecture was 90-1,104 times higher than the software libraries. The results show that the logic architecture suits for high-","authors_text":"Daishiro Kobayashi, Ryosuke Kasahara, Takuya Tanaka","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-20T00:28:12Z","title":"Efficient logic architecture in training gradient boosting decision tree for high-performance and edge computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08295","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:d736a60362b3f1d93945418e0ef84f9019d71b94c777f05c7da25fd1a93db6c7","target":"record","created_at":"2026-05-17T23:57:51Z","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":"a08a88fe3169653c2b3775e7d21c82ad022aaf6550acefadd349f0609749e691","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-20T00:28:12Z","title_canon_sha256":"1dfdab3800572cb7e74defa54437f8c163278e9ae7fa785b1fab29231a0db202"},"schema_version":"1.0","source":{"id":"1812.08295","kind":"arxiv","version":1}},"canonical_sha256":"79bfd09a74c31cc113e6667b3150fd716141556b69a4f0318dba5b28d3cfcb83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79bfd09a74c31cc113e6667b3150fd716141556b69a4f0318dba5b28d3cfcb83","first_computed_at":"2026-05-17T23:57:51.714262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:51.714262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iy3Loap4V+W60rZX/vL5xbtORDg95OZaBoABCR6mQubB1YTEFyFiVbgb9lbhLZfuAd+OosNdbTNcy52RzCFqCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:51.714861Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.08295","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d736a60362b3f1d93945418e0ef84f9019d71b94c777f05c7da25fd1a93db6c7","sha256:57e107a865add5888fc7cd796319b6d8655956cd7744d96b19d9e0251c02de29"],"state_sha256":"06842d7bd134b72673ad8d823c50187f6489de3a5ec016b3f8b2a357b33d3e13"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Lv+bmRfsXTwGRPPFPUpu2u0PL7hSIuLaM9Ra7Ye1ZQob8pfm28RJ9cUiECx8GaSUQr9mCm2ySS3VlnmCEvfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:34:47.155761Z","bundle_sha256":"931ffd8e56f4839115687f88c17d38b977a2fab90620902fb178447541a2d76f"}}