{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IH2I4R2C4A5BBFX3G7MKZ34RUF","short_pith_number":"pith:IH2I4R2C","canonical_record":{"source":{"id":"2502.00465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:49:18Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"c34b764a24de4d648d62947e6754141acec9533d487028012b2fdd03d11f120c","abstract_canon_sha256":"f316dc08447558a96ae1b9fc1786f8bd912943cd922f81d91c2bdd1ee80dcbe9"},"schema_version":"1.0"},"canonical_sha256":"41f48e4742e03a1096fb37d8acef91a14ce1e6d8f06b5233417dab142d52c47a","source":{"kind":"arxiv","id":"2502.00465","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00465","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00465v1","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00465","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"IH2I4R2C4A5B","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"IH2I4R2C4A5BBFX3","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"IH2I4R2C","created_at":"2026-07-05T10:08:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IH2I4R2C4A5BBFX3G7MKZ34RUF","target":"record","payload":{"canonical_record":{"source":{"id":"2502.00465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:49:18Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"c34b764a24de4d648d62947e6754141acec9533d487028012b2fdd03d11f120c","abstract_canon_sha256":"f316dc08447558a96ae1b9fc1786f8bd912943cd922f81d91c2bdd1ee80dcbe9"},"schema_version":"1.0"},"canonical_sha256":"41f48e4742e03a1096fb37d8acef91a14ce1e6d8f06b5233417dab142d52c47a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:34.060603Z","signature_b64":"rwFRmDbca3rfIaGZ2FDj46ThCr16MbDzt51UoGz1AwNFmbNzqfs9mHjUBZIXt/h2kj84SI4qqiYU4+mWOFECCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41f48e4742e03a1096fb37d8acef91a14ce1e6d8f06b5233417dab142d52c47a","last_reissued_at":"2026-07-05T10:08:34.060080Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:34.060080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.00465","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-05T10:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bLgfzYnzQ2NXIgVcDObbc5UoEttiTK47/W49kxH/vimv5zK7VKZv600aHnDZ9waOdbKyIIaUMKC0gh7yzck3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T06:20:34.124316Z"},"content_sha256":"d7af9f7c50bbbb9fbbd3fe7506fd1d81a655b88340ee4d59ee697931c352c09a","schema_version":"1.0","event_id":"sha256:d7af9f7c50bbbb9fbbd3fe7506fd1d81a655b88340ee4d59ee697931c352c09a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IH2I4R2C4A5BBFX3G7MKZ34RUF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Enhance Learning Efficiency of Oblique Decision Tree via Feature Concatenation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Baoliu Ye, Bin Tang, Shen-Huan Lyu, Yanyan Wang, Yi-Xiao He, Zhihao Qu","submitted_at":"2025-02-01T15:49:18Z","abstract_excerpt":"Oblique Decision Tree (ODT) separates the feature space by linear projections, as opposed to the conventional Decision Tree (DT) that forces axis-parallel splits. ODT has been proven to have a stronger representation ability than DT, as it provides a way to create shallower tree structures while still approximating complex decision boundaries. However, its learning efficiency is still insufficient, since the linear projections cannot be transmitted to the child nodes, resulting in a waste of model parameters. In this work, we propose an enhanced ODT method with Feature Concatenation (\\texttt{F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00465","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/2502.00465/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-05T10:08:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J4lW4/WnhJAN1jW1SrACM7xm5hEevXkBAQx1RYSXuSP6OQ89QbbiW1dtjCkEivIUuUtbLUga/t2KT8I0sOb2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T06:20:34.124972Z"},"content_sha256":"f585eb6088f708b2ae4169bb1717eab4d7e3368a6da12a1e450f2679553cf645","schema_version":"1.0","event_id":"sha256:f585eb6088f708b2ae4169bb1717eab4d7e3368a6da12a1e450f2679553cf645"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/bundle.json","state_url":"https://pith.science/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/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-15T06:20:34Z","links":{"resolver":"https://pith.science/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF","bundle":"https://pith.science/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/bundle.json","state":"https://pith.science/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH2I4R2C4A5BBFX3G7MKZ34RUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IH2I4R2C4A5BBFX3G7MKZ34RUF","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":"f316dc08447558a96ae1b9fc1786f8bd912943cd922f81d91c2bdd1ee80dcbe9","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:49:18Z","title_canon_sha256":"c34b764a24de4d648d62947e6754141acec9533d487028012b2fdd03d11f120c"},"schema_version":"1.0","source":{"id":"2502.00465","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00465","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00465v1","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00465","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"IH2I4R2C4A5B","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_16","alias_value":"IH2I4R2C4A5BBFX3","created_at":"2026-07-05T10:08:34Z"},{"alias_kind":"pith_short_8","alias_value":"IH2I4R2C","created_at":"2026-07-05T10:08:34Z"}],"graph_snapshots":[{"event_id":"sha256:f585eb6088f708b2ae4169bb1717eab4d7e3368a6da12a1e450f2679553cf645","target":"graph","created_at":"2026-07-05T10:08:34Z","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/2502.00465/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Oblique Decision Tree (ODT) separates the feature space by linear projections, as opposed to the conventional Decision Tree (DT) that forces axis-parallel splits. ODT has been proven to have a stronger representation ability than DT, as it provides a way to create shallower tree structures while still approximating complex decision boundaries. However, its learning efficiency is still insufficient, since the linear projections cannot be transmitted to the child nodes, resulting in a waste of model parameters. In this work, we propose an enhanced ODT method with Feature Concatenation (\\texttt{F","authors_text":"Baoliu Ye, Bin Tang, Shen-Huan Lyu, Yanyan Wang, Yi-Xiao He, Zhihao Qu","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:49:18Z","title":"Enhance Learning Efficiency of Oblique Decision Tree via Feature Concatenation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00465","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:d7af9f7c50bbbb9fbbd3fe7506fd1d81a655b88340ee4d59ee697931c352c09a","target":"record","created_at":"2026-07-05T10:08:34Z","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":"f316dc08447558a96ae1b9fc1786f8bd912943cd922f81d91c2bdd1ee80dcbe9","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T15:49:18Z","title_canon_sha256":"c34b764a24de4d648d62947e6754141acec9533d487028012b2fdd03d11f120c"},"schema_version":"1.0","source":{"id":"2502.00465","kind":"arxiv","version":1}},"canonical_sha256":"41f48e4742e03a1096fb37d8acef91a14ce1e6d8f06b5233417dab142d52c47a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41f48e4742e03a1096fb37d8acef91a14ce1e6d8f06b5233417dab142d52c47a","first_computed_at":"2026-07-05T10:08:34.060080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:34.060080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rwFRmDbca3rfIaGZ2FDj46ThCr16MbDzt51UoGz1AwNFmbNzqfs9mHjUBZIXt/h2kj84SI4qqiYU4+mWOFECCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:34.060603Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00465","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7af9f7c50bbbb9fbbd3fe7506fd1d81a655b88340ee4d59ee697931c352c09a","sha256:f585eb6088f708b2ae4169bb1717eab4d7e3368a6da12a1e450f2679553cf645"],"state_sha256":"873868d334f051bea24b82ccb372c85a9130ad58ec7ed9997de647a0c22788e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YUv9h/CkG+ku0IjD3ciRz12P8FSwk9pdRu+fiII2w4MBUfwy7LO86dFPc2gygUB2AKcZgosXrvNsuRRgJT8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T06:20:34.130191Z","bundle_sha256":"66547d8a896be855c4ab9ac8d47bf2c2c0cffad09b9622305e16637ce94ebe94"}}