{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:G255FRQPFOI6L2VIDIT2XEEHA5","short_pith_number":"pith:G255FRQP","canonical_record":{"source":{"id":"1006.3424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-17T10:37:43Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e5a092ed89041d6986c524919028055931a97ec2ba1c31efb5e56a9154d32771","abstract_canon_sha256":"afb983e4e8afa132dd8b6791c09727a49be6eccd14a851474be6ee0f019d4bd1"},"schema_version":"1.0"},"canonical_sha256":"36bbd2c60f2b91e5eaa81a27ab9087077a4e4453d620b5d540bd9d70bdf9cedb","source":{"kind":"arxiv","id":"1006.3424","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3424","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3424v2","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3424","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"G255FRQPFOI6","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G255FRQPFOI6L2VI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G255FRQP","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:G255FRQPFOI6L2VIDIT2XEEHA5","target":"record","payload":{"canonical_record":{"source":{"id":"1006.3424","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-17T10:37:43Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"e5a092ed89041d6986c524919028055931a97ec2ba1c31efb5e56a9154d32771","abstract_canon_sha256":"afb983e4e8afa132dd8b6791c09727a49be6eccd14a851474be6ee0f019d4bd1"},"schema_version":"1.0"},"canonical_sha256":"36bbd2c60f2b91e5eaa81a27ab9087077a4e4453d620b5d540bd9d70bdf9cedb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:44.977365Z","signature_b64":"IwEGjQ95QIPQDEhEseq2P0gqFjxthhsjp2zR/cHXY3Um5Lwn/E272roiymONUmTTTby1mVz4h//fozw/nGKUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36bbd2c60f2b91e5eaa81a27ab9087077a4e4453d620b5d540bd9d70bdf9cedb","last_reissued_at":"2026-05-18T04:40:44.976728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:44.976728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.3424","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-18T04:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOflWrD3sY4KQ0aZysjDgLagsy8AoKG6QB4C5zI+eScKrztdQKX+OdzwJApfjZSbWd7lLGHoygq3A6KE2gj2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:18.256859Z"},"content_sha256":"edd9df2fdafda5899c63861413abd9be371b7d1ddeca0721e512510ce0ab96d7","schema_version":"1.0","event_id":"sha256:edd9df2fdafda5899c63861413abd9be371b7d1ddeca0721e512510ce0ab96d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:G255FRQPFOI6L2VIDIT2XEEHA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Porting Decision Tree Algorithms to Multicore using FastFlow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.DC","authors_text":"Marco Aldinucci, Massimo Torquati, Salvatore Ruggieri","submitted_at":"2010-06-17T10:37:43Z","abstract_excerpt":"The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an approach for easy-yet-efficient porting of an implementation of the C4.5 algorithm on multicores. The parallel porting requires minimal changes to the original sequential code, and it is able to exploit up to 7X speedup on an Intel du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3424","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-18T04:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLlSzO6Bm1TPLdDVsSZrHFRfSRJ07xYwNsDy/deLVwN/sRy2ln+QIV9hnTK28Tth++jYAI2kFdHV+vq62mirDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:08:18.257203Z"},"content_sha256":"79eba4d793820d9a650dcb353668ddf8af8c3aca5ef36eb156771403776b8dda","schema_version":"1.0","event_id":"sha256:79eba4d793820d9a650dcb353668ddf8af8c3aca5ef36eb156771403776b8dda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G255FRQPFOI6L2VIDIT2XEEHA5/bundle.json","state_url":"https://pith.science/pith/G255FRQPFOI6L2VIDIT2XEEHA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G255FRQPFOI6L2VIDIT2XEEHA5/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-04T06:08:18Z","links":{"resolver":"https://pith.science/pith/G255FRQPFOI6L2VIDIT2XEEHA5","bundle":"https://pith.science/pith/G255FRQPFOI6L2VIDIT2XEEHA5/bundle.json","state":"https://pith.science/pith/G255FRQPFOI6L2VIDIT2XEEHA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G255FRQPFOI6L2VIDIT2XEEHA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:G255FRQPFOI6L2VIDIT2XEEHA5","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":"afb983e4e8afa132dd8b6791c09727a49be6eccd14a851474be6ee0f019d4bd1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-17T10:37:43Z","title_canon_sha256":"e5a092ed89041d6986c524919028055931a97ec2ba1c31efb5e56a9154d32771"},"schema_version":"1.0","source":{"id":"1006.3424","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3424","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3424v2","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3424","created_at":"2026-05-18T04:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"G255FRQPFOI6","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"G255FRQPFOI6L2VI","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"G255FRQP","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:79eba4d793820d9a650dcb353668ddf8af8c3aca5ef36eb156771403776b8dda","target":"graph","created_at":"2026-05-18T04:40:44Z","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 whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine power, which can be only exploited via thread-level parallelism. Decision tree algorithms exhibit natural concurrency that makes them suitable to be parallelised. This paper presents an approach for easy-yet-efficient porting of an implementation of the C4.5 algorithm on multicores. The parallel porting requires minimal changes to the original sequential code, and it is able to exploit up to 7X speedup on an Intel du","authors_text":"Marco Aldinucci, Massimo Torquati, Salvatore Ruggieri","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-17T10:37:43Z","title":"Porting Decision Tree Algorithms to Multicore using FastFlow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3424","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:edd9df2fdafda5899c63861413abd9be371b7d1ddeca0721e512510ce0ab96d7","target":"record","created_at":"2026-05-18T04:40:44Z","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":"afb983e4e8afa132dd8b6791c09727a49be6eccd14a851474be6ee0f019d4bd1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-06-17T10:37:43Z","title_canon_sha256":"e5a092ed89041d6986c524919028055931a97ec2ba1c31efb5e56a9154d32771"},"schema_version":"1.0","source":{"id":"1006.3424","kind":"arxiv","version":2}},"canonical_sha256":"36bbd2c60f2b91e5eaa81a27ab9087077a4e4453d620b5d540bd9d70bdf9cedb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36bbd2c60f2b91e5eaa81a27ab9087077a4e4453d620b5d540bd9d70bdf9cedb","first_computed_at":"2026-05-18T04:40:44.976728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:44.976728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IwEGjQ95QIPQDEhEseq2P0gqFjxthhsjp2zR/cHXY3Um5Lwn/E272roiymONUmTTTby1mVz4h//fozw/nGKUDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:44.977365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3424","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edd9df2fdafda5899c63861413abd9be371b7d1ddeca0721e512510ce0ab96d7","sha256:79eba4d793820d9a650dcb353668ddf8af8c3aca5ef36eb156771403776b8dda"],"state_sha256":"586754565dd31e9bb7fa91353995067a8f211ffda7129e18ded5828125d5b25d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CozxNr/w6VTXVqRINf/ljOJEv85gt+sMr2a2XBbNeN3QxYH1NqT10tsMrZH/O98yxqQR3tPh4aHUv4vr03nFDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:08:18.259093Z","bundle_sha256":"a724f086d373ceb9a68e66e61dd3daec0f80154e0082cc46749e0a51da5747e8"}}