{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:FYFX2HM47HMKFEEV7QQ3N2TH3D","short_pith_number":"pith:FYFX2HM4","canonical_record":{"source":{"id":"2101.07077","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-18T13:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"b5ac4b795b05c5fd56c39b7f50496ee5dce1bb104acc38dc5db1bde5246ca341","abstract_canon_sha256":"d2640bdff9074941dd0b64f1467fe5f99827000cd8e00b33b3b9e376b129b8d2"},"schema_version":"1.0"},"canonical_sha256":"2e0b7d1d9cf9d8a29095fc21b6ea67d8e4c2a279f9cd86b8f1b0999460a81696","source":{"kind":"arxiv","id":"2101.07077","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07077","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07077v8","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07077","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_12","alias_value":"FYFX2HM47HMK","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"FYFX2HM47HMKFEEV","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"FYFX2HM4","created_at":"2026-07-05T09:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:FYFX2HM47HMKFEEV7QQ3N2TH3D","target":"record","payload":{"canonical_record":{"source":{"id":"2101.07077","kind":"arxiv","version":8},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-18T13:50:14Z","cross_cats_sorted":[],"title_canon_sha256":"b5ac4b795b05c5fd56c39b7f50496ee5dce1bb104acc38dc5db1bde5246ca341","abstract_canon_sha256":"d2640bdff9074941dd0b64f1467fe5f99827000cd8e00b33b3b9e376b129b8d2"},"schema_version":"1.0"},"canonical_sha256":"2e0b7d1d9cf9d8a29095fc21b6ea67d8e4c2a279f9cd86b8f1b0999460a81696","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:39.337283Z","signature_b64":"DrL2eSpaALv7bzmhHrRgREIwjO0NOqg8dtHyneM2WN2uOUds65De6V2+b4tVtjSRQN3y8C+ZFoO5j6l3Qjc9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e0b7d1d9cf9d8a29095fc21b6ea67d8e4c2a279f9cd86b8f1b0999460a81696","last_reissued_at":"2026-07-05T09:31:39.336855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:39.336855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.07077","source_version":8,"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-05T09:31:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/T9DTPOJGTjiiULVw1L9FEsdsx+hO6vId0c3FEeZwEU96hCkn+4DHA0+TmViWWQYlauPBpgCortdQzYcHhuDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:15:40.271704Z"},"content_sha256":"a44d93c3a0a6fcbaeca052fd6b63cd14bc6bd5bba42f66d755eac717faf61d7b","schema_version":"1.0","event_id":"sha256:a44d93c3a0a6fcbaeca052fd6b63cd14bc6bd5bba42f66d755eac717faf61d7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:FYFX2HM47HMKFEEV7QQ3N2TH3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinxiong Zhang","submitted_at":"2021-01-18T13:50:14Z","abstract_excerpt":"A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision trees in the language of computational graph. We explicitly parameterize the test phase, traversal phase and prediction phase of decision trees based on the bitvectors of non-terminal nodes. As shown, the decision tree is a shallow binary network in some sense. Especially, we introduce the bitvector matrix to implement the tree traversal in numerical approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07077","kind":"arxiv","version":8},"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/2101.07077/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-05T09:31:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EaO8Ephske1hxH0FImA0p9Q8wXZmujacguZOEfi9aCOhGvpd1WWs/31hgddXiIg/fjoxY1BS8Hr881ceiR3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T04:15:40.272247Z"},"content_sha256":"40d40b35ca4f6937fc87d58437a9094be3f0a4cab328dd0cb7bcd2e609d8c0d7","schema_version":"1.0","event_id":"sha256:40d40b35ca4f6937fc87d58437a9094be3f0a4cab328dd0cb7bcd2e609d8c0d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/bundle.json","state_url":"https://pith.science/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/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-09T04:15:40Z","links":{"resolver":"https://pith.science/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D","bundle":"https://pith.science/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/bundle.json","state":"https://pith.science/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FYFX2HM47HMKFEEV7QQ3N2TH3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:FYFX2HM47HMKFEEV7QQ3N2TH3D","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":"d2640bdff9074941dd0b64f1467fe5f99827000cd8e00b33b3b9e376b129b8d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-18T13:50:14Z","title_canon_sha256":"b5ac4b795b05c5fd56c39b7f50496ee5dce1bb104acc38dc5db1bde5246ca341"},"schema_version":"1.0","source":{"id":"2101.07077","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.07077","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"arxiv_version","alias_value":"2101.07077v8","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.07077","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_12","alias_value":"FYFX2HM47HMK","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"FYFX2HM47HMKFEEV","created_at":"2026-07-05T09:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"FYFX2HM4","created_at":"2026-07-05T09:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:40d40b35ca4f6937fc87d58437a9094be3f0a4cab328dd0cb7bcd2e609d8c0d7","target":"graph","created_at":"2026-07-05T09:31:39Z","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/2101.07077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A decision tree looks like a simple directed acyclic computational graph, where only the leaf nodes specify the output values and the non-terminals specify their tests or split conditions. From the numerical perspective, we express decision trees in the language of computational graph. We explicitly parameterize the test phase, traversal phase and prediction phase of decision trees based on the bitvectors of non-terminal nodes. As shown, the decision tree is a shallow binary network in some sense. Especially, we introduce the bitvector matrix to implement the tree traversal in numerical approa","authors_text":"Jinxiong Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-18T13:50:14Z","title":"Yet Another Representation of Binary Decision Trees: A Mathematical Demonstration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.07077","kind":"arxiv","version":8},"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:a44d93c3a0a6fcbaeca052fd6b63cd14bc6bd5bba42f66d755eac717faf61d7b","target":"record","created_at":"2026-07-05T09:31:39Z","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":"d2640bdff9074941dd0b64f1467fe5f99827000cd8e00b33b3b9e376b129b8d2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2021-01-18T13:50:14Z","title_canon_sha256":"b5ac4b795b05c5fd56c39b7f50496ee5dce1bb104acc38dc5db1bde5246ca341"},"schema_version":"1.0","source":{"id":"2101.07077","kind":"arxiv","version":8}},"canonical_sha256":"2e0b7d1d9cf9d8a29095fc21b6ea67d8e4c2a279f9cd86b8f1b0999460a81696","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e0b7d1d9cf9d8a29095fc21b6ea67d8e4c2a279f9cd86b8f1b0999460a81696","first_computed_at":"2026-07-05T09:31:39.336855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:39.336855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DrL2eSpaALv7bzmhHrRgREIwjO0NOqg8dtHyneM2WN2uOUds65De6V2+b4tVtjSRQN3y8C+ZFoO5j6l3Qjc9Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:39.337283Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.07077","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44d93c3a0a6fcbaeca052fd6b63cd14bc6bd5bba42f66d755eac717faf61d7b","sha256:40d40b35ca4f6937fc87d58437a9094be3f0a4cab328dd0cb7bcd2e609d8c0d7"],"state_sha256":"a34faf28a73e5ff0459a897fb23cdcbfaf2169aa5994a347ef4d39a2f342e497"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4F1ebQWZFurLZHKF30sRElbwPo/jD6fazzjqraCWQawakRhq+ouKVv7Pzh7hf/RF1VYO/cB7JqyyOTdUvI/bCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T04:15:40.278420Z","bundle_sha256":"c7912c19eb9af134a60196e663d5c4945d16fbc4147dfb55839ceeaa76f8a7c6"}}