{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:UMOQTX5IDNMQNW47AINHXP2CLY","short_pith_number":"pith:UMOQTX5I","canonical_record":{"source":{"id":"2502.04052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T13:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"8abb0ccaaefc1bc0bfa7b4fdf7cc0e9823392db7f73d155f345d0c04c9660c88","abstract_canon_sha256":"d95300b36e53229e6bff769cd0de2758501d3fd37bedc7b3df173ec1e495f7ac"},"schema_version":"1.0"},"canonical_sha256":"a31d09dfa81b5906db9f021a7bbf425e00ca392928df4dac50b8a814989ac52b","source":{"kind":"arxiv","id":"2502.04052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04052","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04052v1","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04052","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"UMOQTX5IDNMQ","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_16","alias_value":"UMOQTX5IDNMQNW47","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_8","alias_value":"UMOQTX5I","created_at":"2026-07-05T10:10:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:UMOQTX5IDNMQNW47AINHXP2CLY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.04052","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T13:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"8abb0ccaaefc1bc0bfa7b4fdf7cc0e9823392db7f73d155f345d0c04c9660c88","abstract_canon_sha256":"d95300b36e53229e6bff769cd0de2758501d3fd37bedc7b3df173ec1e495f7ac"},"schema_version":"1.0"},"canonical_sha256":"a31d09dfa81b5906db9f021a7bbf425e00ca392928df4dac50b8a814989ac52b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:10:33.420103Z","signature_b64":"YubEJ73ifx5h9FvL5mqAA5aguLuZ+i0WewMAJ8Gm7X7hk58rN5TRl4wgGBjiK6zbXQoM8JIgHzV64mZ77iC9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a31d09dfa81b5906db9f021a7bbf425e00ca392928df4dac50b8a814989ac52b","last_reissued_at":"2026-07-05T10:10:33.419661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:10:33.419661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.04052","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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFS/zG0+Y8Luh4lVOL/3d3UnlsrR/xzgvE17n0q3arDlDp187rRlHJqXKRRfjs68hhhmP/jaj5yFL4O5u6QoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T04:13:48.461047Z"},"content_sha256":"4a5c21a08bdfac3d1925c858c306869557210e4aefb3b29d45520b9e6aca9918","schema_version":"1.0","event_id":"sha256:4a5c21a08bdfac3d1925c858c306869557210e4aefb3b29d45520b9e6aca9918"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:UMOQTX5IDNMQNW47AINHXP2CLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Moritz Schneider, Sascha Marton","submitted_at":"2025-02-06T13:11:50Z","abstract_excerpt":"Neural architectures such as Recurrent Neural Networks (RNNs), Transformers, and State-Space Models have shown great success in handling sequential data by learning temporal dependencies. Decision Trees (DTs), on the other hand, remain a widely used class of models for structured tabular data but are typically not designed to capture sequential patterns directly. Instead, DT-based approaches for time-series data often rely on feature engineering, such as manually incorporating lag features, which can be suboptimal for capturing complex temporal dependencies. To address this limitation, we intr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04052","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.04052/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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7D2Ocn8/ojaZ4JFwKWDZvklXvnHpao2t4hnXqmzI6Lx+RDkLEy8Rk+nZmNjPfmOtKhvhTnAw5Bn1ekCn4jyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T04:13:48.461550Z"},"content_sha256":"4c3f49701ac14e4a9ef2e4bb7f0cd4730b2e48322e49fd426b9eb78b039df4ef","schema_version":"1.0","event_id":"sha256:4c3f49701ac14e4a9ef2e4bb7f0cd4730b2e48322e49fd426b9eb78b039df4ef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMOQTX5IDNMQNW47AINHXP2CLY/bundle.json","state_url":"https://pith.science/pith/UMOQTX5IDNMQNW47AINHXP2CLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMOQTX5IDNMQNW47AINHXP2CLY/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-10T04:13:48Z","links":{"resolver":"https://pith.science/pith/UMOQTX5IDNMQNW47AINHXP2CLY","bundle":"https://pith.science/pith/UMOQTX5IDNMQNW47AINHXP2CLY/bundle.json","state":"https://pith.science/pith/UMOQTX5IDNMQNW47AINHXP2CLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMOQTX5IDNMQNW47AINHXP2CLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:UMOQTX5IDNMQNW47AINHXP2CLY","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":"d95300b36e53229e6bff769cd0de2758501d3fd37bedc7b3df173ec1e495f7ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T13:11:50Z","title_canon_sha256":"8abb0ccaaefc1bc0bfa7b4fdf7cc0e9823392db7f73d155f345d0c04c9660c88"},"schema_version":"1.0","source":{"id":"2502.04052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.04052","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"2502.04052v1","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.04052","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"UMOQTX5IDNMQ","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_16","alias_value":"UMOQTX5IDNMQNW47","created_at":"2026-07-05T10:10:33Z"},{"alias_kind":"pith_short_8","alias_value":"UMOQTX5I","created_at":"2026-07-05T10:10:33Z"}],"graph_snapshots":[{"event_id":"sha256:4c3f49701ac14e4a9ef2e4bb7f0cd4730b2e48322e49fd426b9eb78b039df4ef","target":"graph","created_at":"2026-07-05T10:10:33Z","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.04052/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Neural architectures such as Recurrent Neural Networks (RNNs), Transformers, and State-Space Models have shown great success in handling sequential data by learning temporal dependencies. Decision Trees (DTs), on the other hand, remain a widely used class of models for structured tabular data but are typically not designed to capture sequential patterns directly. Instead, DT-based approaches for time-series data often rely on feature engineering, such as manually incorporating lag features, which can be suboptimal for capturing complex temporal dependencies. To address this limitation, we intr","authors_text":"Moritz Schneider, Sascha Marton","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T13:11:50Z","title":"Decision Trees That Remember: Gradient-Based Learning of Recurrent Decision Trees with Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.04052","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:4a5c21a08bdfac3d1925c858c306869557210e4aefb3b29d45520b9e6aca9918","target":"record","created_at":"2026-07-05T10:10:33Z","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":"d95300b36e53229e6bff769cd0de2758501d3fd37bedc7b3df173ec1e495f7ac","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-06T13:11:50Z","title_canon_sha256":"8abb0ccaaefc1bc0bfa7b4fdf7cc0e9823392db7f73d155f345d0c04c9660c88"},"schema_version":"1.0","source":{"id":"2502.04052","kind":"arxiv","version":1}},"canonical_sha256":"a31d09dfa81b5906db9f021a7bbf425e00ca392928df4dac50b8a814989ac52b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a31d09dfa81b5906db9f021a7bbf425e00ca392928df4dac50b8a814989ac52b","first_computed_at":"2026-07-05T10:10:33.419661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:33.419661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YubEJ73ifx5h9FvL5mqAA5aguLuZ+i0WewMAJ8Gm7X7hk58rN5TRl4wgGBjiK6zbXQoM8JIgHzV64mZ77iC9Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:33.420103Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.04052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a5c21a08bdfac3d1925c858c306869557210e4aefb3b29d45520b9e6aca9918","sha256:4c3f49701ac14e4a9ef2e4bb7f0cd4730b2e48322e49fd426b9eb78b039df4ef"],"state_sha256":"a0b7ca2945213df40a9c026f6b381215ccc12e80a9c65e0babf0e83f0d09f41d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk7aZ6lA+3nyp7SCmvUGtF7Uwsj1aUy2/3QaYAEYUbsPC0Zoe9KQvONLSq3GdS69+CmhcGp9frrsnh5tO4t+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T04:13:48.468126Z","bundle_sha256":"88f01844112c012dfac997aea10da330506f17daf3388ecbc0d56d09d74482ee"}}