{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:55FITQL7MWPYGT3Z72XFFI3LSI","short_pith_number":"pith:55FITQL7","canonical_record":{"source":{"id":"1302.2277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-09T22:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"8a0dee4aea82a0fe72759bc6100daa49b0fe22d5f2d4f4ef2854b90333ddaead","abstract_canon_sha256":"a143eba8cc7e298d600c74f33d13913e4c090ea9db0997f4227c88b77d35e9cd"},"schema_version":"1.0"},"canonical_sha256":"ef4a89c17f659f834f79feae52a36b9214b2853e0467cbc70dbcab27c693c74e","source":{"kind":"arxiv","id":"1302.2277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2277","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2277v2","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2277","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"55FITQL7MWPY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"55FITQL7MWPYGT3Z","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"55FITQL7","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:55FITQL7MWPYGT3Z72XFFI3LSI","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-09T22:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"8a0dee4aea82a0fe72759bc6100daa49b0fe22d5f2d4f4ef2854b90333ddaead","abstract_canon_sha256":"a143eba8cc7e298d600c74f33d13913e4c090ea9db0997f4227c88b77d35e9cd"},"schema_version":"1.0"},"canonical_sha256":"ef4a89c17f659f834f79feae52a36b9214b2853e0467cbc70dbcab27c693c74e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:22:05.527825Z","signature_b64":"cplPvsCAwDQBt6Q2SRA78MXXTxpQaZFPJ+Q26OZt6sd52jCyzeQiN4lkr6zKqJXr3KOeWSwhZcKiPGfyAUj9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef4a89c17f659f834f79feae52a36b9214b2853e0467cbc70dbcab27c693c74e","last_reissued_at":"2026-05-18T03:22:05.526954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:22:05.526954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2277","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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNx10piflr/IOKkQo6Jd5HgPRDab+k8bjbK0SYeEP1afSvL+fqFSQLLWMZYsO4LphIC7Z9FAYW3OdABDrze4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:21:43.024343Z"},"content_sha256":"ac0df61336f633525262d38bb8252983e936f2456e5279c7672a9ea93e9174cb","schema_version":"1.0","event_id":"sha256:ac0df61336f633525262d38bb8252983e936f2456e5279c7672a9ea93e9174cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:55FITQL7MWPYGT3Z72XFFI3LSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Time Series Forest for Classification and Feature Extraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eugene Tuv, George Runger, Houtao Deng, Martyanov Vladimir","submitted_at":"2013-02-09T22:56:45Z","abstract_excerpt":"We propose a tree ensemble method, referred to as time series forest (TSF), for time series classification. TSF employs a combination of the entropy gain and a distance measure, referred to as the Entrance (entropy and distance) gain, for evaluating the splits. Experimental studies show that the Entrance gain criterion improves the accuracy of TSF. TSF randomly samples features at each tree node and has a computational complexity linear in the length of a time series and can be built using parallel computing techniques such as multi-core computing used here. The temporal importance curve is al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2277","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:22:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KuHLA2bLhGoK8ncJG8bUdwSYg361o2pb+TBHDpuGw4+8IloDOPBy8D3OXtWjA6fAf/tyd3NCfj5VpzX9zJIaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:21:43.025116Z"},"content_sha256":"11bba23c78a836f5edbbbdf68b6870bb7fcf8a52ebf6e446c6fc2d8baa973829","schema_version":"1.0","event_id":"sha256:11bba23c78a836f5edbbbdf68b6870bb7fcf8a52ebf6e446c6fc2d8baa973829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55FITQL7MWPYGT3Z72XFFI3LSI/bundle.json","state_url":"https://pith.science/pith/55FITQL7MWPYGT3Z72XFFI3LSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55FITQL7MWPYGT3Z72XFFI3LSI/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-11T21:21:43Z","links":{"resolver":"https://pith.science/pith/55FITQL7MWPYGT3Z72XFFI3LSI","bundle":"https://pith.science/pith/55FITQL7MWPYGT3Z72XFFI3LSI/bundle.json","state":"https://pith.science/pith/55FITQL7MWPYGT3Z72XFFI3LSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55FITQL7MWPYGT3Z72XFFI3LSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:55FITQL7MWPYGT3Z72XFFI3LSI","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":"a143eba8cc7e298d600c74f33d13913e4c090ea9db0997f4227c88b77d35e9cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-09T22:56:45Z","title_canon_sha256":"8a0dee4aea82a0fe72759bc6100daa49b0fe22d5f2d4f4ef2854b90333ddaead"},"schema_version":"1.0","source":{"id":"1302.2277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2277","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2277v2","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2277","created_at":"2026-05-18T03:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"55FITQL7MWPY","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"55FITQL7MWPYGT3Z","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"55FITQL7","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:11bba23c78a836f5edbbbdf68b6870bb7fcf8a52ebf6e446c6fc2d8baa973829","target":"graph","created_at":"2026-05-18T03:22:05Z","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":"We propose a tree ensemble method, referred to as time series forest (TSF), for time series classification. TSF employs a combination of the entropy gain and a distance measure, referred to as the Entrance (entropy and distance) gain, for evaluating the splits. Experimental studies show that the Entrance gain criterion improves the accuracy of TSF. TSF randomly samples features at each tree node and has a computational complexity linear in the length of a time series and can be built using parallel computing techniques such as multi-core computing used here. The temporal importance curve is al","authors_text":"Eugene Tuv, George Runger, Houtao Deng, Martyanov Vladimir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-09T22:56:45Z","title":"A Time Series Forest for Classification and Feature Extraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2277","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:ac0df61336f633525262d38bb8252983e936f2456e5279c7672a9ea93e9174cb","target":"record","created_at":"2026-05-18T03:22:05Z","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":"a143eba8cc7e298d600c74f33d13913e4c090ea9db0997f4227c88b77d35e9cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-09T22:56:45Z","title_canon_sha256":"8a0dee4aea82a0fe72759bc6100daa49b0fe22d5f2d4f4ef2854b90333ddaead"},"schema_version":"1.0","source":{"id":"1302.2277","kind":"arxiv","version":2}},"canonical_sha256":"ef4a89c17f659f834f79feae52a36b9214b2853e0467cbc70dbcab27c693c74e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef4a89c17f659f834f79feae52a36b9214b2853e0467cbc70dbcab27c693c74e","first_computed_at":"2026-05-18T03:22:05.526954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:22:05.526954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cplPvsCAwDQBt6Q2SRA78MXXTxpQaZFPJ+Q26OZt6sd52jCyzeQiN4lkr6zKqJXr3KOeWSwhZcKiPGfyAUj9AA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:22:05.527825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac0df61336f633525262d38bb8252983e936f2456e5279c7672a9ea93e9174cb","sha256:11bba23c78a836f5edbbbdf68b6870bb7fcf8a52ebf6e446c6fc2d8baa973829"],"state_sha256":"2e0db1a6c2f34ec008838f65dee6695d6de05d9e3d8d188485afc43e5c9cbbbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I4DdGCCPnAc/kKJxLZ+5rtWjI9TmCaDypK8gjDqBiUtw5muhrGwEe0+GnFsPdB9OHYfTneN5f6uKidIP8H80Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:21:43.029600Z","bundle_sha256":"18681d242b705dc4a40f2f2758b254622990517bba9030c828402dfd2245e1eb"}}