{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4SRT6QZI7FCGHSJOL3VHX65ZXX","short_pith_number":"pith:4SRT6QZI","canonical_record":{"source":{"id":"1212.2287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-11T03:20:46Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"5e85eee0bf06581572642c658145fd401b62a7629eb2444a7b25a3c029aba482","abstract_canon_sha256":"4e3cd5fb553376ce3adb9a4d1653cbb6467e49c68a1279a48c7f642dbdc57fbe"},"schema_version":"1.0"},"canonical_sha256":"e4a33f4328f94463c92e5eea7bfbb9bdc553a553e5ab657d603e062dba11be91","source":{"kind":"arxiv","id":"1212.2287","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2287","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2287v2","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2287","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SRT6QZI7FCG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4SRT6QZI7FCGHSJO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4SRT6QZI","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4SRT6QZI7FCGHSJOL3VHX65ZXX","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2287","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-11T03:20:46Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"5e85eee0bf06581572642c658145fd401b62a7629eb2444a7b25a3c029aba482","abstract_canon_sha256":"4e3cd5fb553376ce3adb9a4d1653cbb6467e49c68a1279a48c7f642dbdc57fbe"},"schema_version":"1.0"},"canonical_sha256":"e4a33f4328f94463c92e5eea7bfbb9bdc553a553e5ab657d603e062dba11be91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:03.210656Z","signature_b64":"FPNdgkjlAzMCf0R+XOIpvTfoEUVysssFhbvvZgxqgV0ntQXFh1vEV5TaQEXPdiAtfrQkSNpcI96j9PLvPNDGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a33f4328f94463c92e5eea7bfbb9bdc553a553e5ab657d603e062dba11be91","last_reissued_at":"2026-05-18T03:27:03.210091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:03.210091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2287","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-18T03:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"My0hbyh9sl3ZkXbRnCObQfvT+YlWbW8h90NOlXNymSVXNbylK3fRKU+BCsWhhDjAXBi5AEyhpGRxkZjNktNgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:08:47.406827Z"},"content_sha256":"5f16aef86ba42ce6c7d1f07f5b9cda139a61b1c6d51b53522893c758a7199b7c","schema_version":"1.0","event_id":"sha256:5f16aef86ba42ce6c7d1f07f5b9cda139a61b1c6d51b53522893c758a7199b7c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4SRT6QZI7FCGHSJOL3VHX65ZXX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Runtime Optimizations for Prediction with Tree-Based Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"cs.DB","authors_text":"Arjen P. de Vries, Jimmy Lin, Nima Asadi","submitted_at":"2012-12-11T03:20:46Z","abstract_excerpt":"Tree-based models have proven to be an effective solution for web ranking as well as other problems in diverse domains. This paper focuses on optimizing the runtime performance of applying such models to make predictions, given an already-trained model. Although exceedingly simple conceptually, most implementations of tree-based models do not efficiently utilize modern superscalar processor architectures. By laying out data structures in memory in a more cache-conscious fashion, removing branches from the execution flow using a technique called predication, and micro-batching predictions using"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2287","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-18T03:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UeDWLZv48n6/QTWgRteXndFSzuYPPGM7sIXayhnEYZLZ0qZIn35PssZDhOt9UdWwqeiD8LJeAO6pVnhJjxyCBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:08:47.407209Z"},"content_sha256":"2d51f606fdd227007eb448ea85fdfd192b7004961db691c896128043e5086705","schema_version":"1.0","event_id":"sha256:2d51f606fdd227007eb448ea85fdfd192b7004961db691c896128043e5086705"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/bundle.json","state_url":"https://pith.science/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/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-04T04:08:47Z","links":{"resolver":"https://pith.science/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX","bundle":"https://pith.science/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/bundle.json","state":"https://pith.science/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SRT6QZI7FCGHSJOL3VHX65ZXX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4SRT6QZI7FCGHSJOL3VHX65ZXX","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":"4e3cd5fb553376ce3adb9a4d1653cbb6467e49c68a1279a48c7f642dbdc57fbe","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-11T03:20:46Z","title_canon_sha256":"5e85eee0bf06581572642c658145fd401b62a7629eb2444a7b25a3c029aba482"},"schema_version":"1.0","source":{"id":"1212.2287","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2287","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2287v2","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2287","created_at":"2026-05-18T03:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"4SRT6QZI7FCG","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4SRT6QZI7FCGHSJO","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4SRT6QZI","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:2d51f606fdd227007eb448ea85fdfd192b7004961db691c896128043e5086705","target":"graph","created_at":"2026-05-18T03:27:03Z","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":"Tree-based models have proven to be an effective solution for web ranking as well as other problems in diverse domains. This paper focuses on optimizing the runtime performance of applying such models to make predictions, given an already-trained model. Although exceedingly simple conceptually, most implementations of tree-based models do not efficiently utilize modern superscalar processor architectures. By laying out data structures in memory in a more cache-conscious fashion, removing branches from the execution flow using a technique called predication, and micro-batching predictions using","authors_text":"Arjen P. de Vries, Jimmy Lin, Nima Asadi","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-11T03:20:46Z","title":"Runtime Optimizations for Prediction with Tree-Based Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2287","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:5f16aef86ba42ce6c7d1f07f5b9cda139a61b1c6d51b53522893c758a7199b7c","target":"record","created_at":"2026-05-18T03:27:03Z","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":"4e3cd5fb553376ce3adb9a4d1653cbb6467e49c68a1279a48c7f642dbdc57fbe","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-11T03:20:46Z","title_canon_sha256":"5e85eee0bf06581572642c658145fd401b62a7629eb2444a7b25a3c029aba482"},"schema_version":"1.0","source":{"id":"1212.2287","kind":"arxiv","version":2}},"canonical_sha256":"e4a33f4328f94463c92e5eea7bfbb9bdc553a553e5ab657d603e062dba11be91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4a33f4328f94463c92e5eea7bfbb9bdc553a553e5ab657d603e062dba11be91","first_computed_at":"2026-05-18T03:27:03.210091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:03.210091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FPNdgkjlAzMCf0R+XOIpvTfoEUVysssFhbvvZgxqgV0ntQXFh1vEV5TaQEXPdiAtfrQkSNpcI96j9PLvPNDGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:03.210656Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2287","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f16aef86ba42ce6c7d1f07f5b9cda139a61b1c6d51b53522893c758a7199b7c","sha256:2d51f606fdd227007eb448ea85fdfd192b7004961db691c896128043e5086705"],"state_sha256":"78551df7de9d46583e9e175ef1c3a9ed543f2f78838b514334c0e29ab39f646a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGQQnKrVIyzSkEzrSmmjsqYzC2FjOHsejitgSJfGKONTeAJpxvXEa5LuEcspd6uppdcDahcBZnD4C7ShOCBLDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:08:47.409398Z","bundle_sha256":"e9a05fa9c53734ff2ff06493dbf12b40bf3c1171daecfe8447430ff0e925728d"}}