{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:77G7JAREY3EIXSKQRXYFMUPV3Y","short_pith_number":"pith:77G7JARE","canonical_record":{"source":{"id":"1808.10594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T04:17:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3afa2fd5f6af78886d49c220fa2c5689acf79ea48d78de9a635a341ae14967b2","abstract_canon_sha256":"64047e3b7663082c5420f79e795d4ce8266a39a3169adf9fe0ef0b93a0394e47"},"schema_version":"1.0"},"canonical_sha256":"ffcdf48224c6c88bc9508df05651f5de37466a0e9e739c630cb21dd4e03969c6","source":{"kind":"arxiv","id":"1808.10594","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10594","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10594v2","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10594","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"77G7JAREY3EI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77G7JAREY3EIXSKQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77G7JARE","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:77G7JAREY3EIXSKQRXYFMUPV3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1808.10594","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T04:17:44Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3afa2fd5f6af78886d49c220fa2c5689acf79ea48d78de9a635a341ae14967b2","abstract_canon_sha256":"64047e3b7663082c5420f79e795d4ce8266a39a3169adf9fe0ef0b93a0394e47"},"schema_version":"1.0"},"canonical_sha256":"ffcdf48224c6c88bc9508df05651f5de37466a0e9e739c630cb21dd4e03969c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:22.616139Z","signature_b64":"muhr06rbVwnTE2gcnft2WxbHpEiKVDYZQ4uHvoYPIC4a28rhzNmPnnCTnoHQz7WJQVZ8ldLLF91StaSP3i9tCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffcdf48224c6c88bc9508df05651f5de37466a0e9e739c630cb21dd4e03969c6","last_reissued_at":"2026-05-17T23:54:22.615553Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:22.615553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.10594","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-17T23:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuspurLAWXWPFV+oxAkrkjCA8oXkx8t6/AaQiDyzkTBhXXMwYQnons6dwC69ouboW3sUYJD6ltbo/Dkr1W+wCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:14:38.881376Z"},"content_sha256":"71d71ef08984e1ed3c9aa5961ced0f0fe4c50ca1610518de9749b15ff3cb960b","schema_version":"1.0","event_id":"sha256:71d71ef08984e1ed3c9aa5961ced0f0fe4c50ca1610518de9749b15ff3cb960b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:77G7JAREY3EIXSKQRXYFMUPV3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximity Forest: An effective and scalable distance-based classifier for time series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmed Shifaz, Bart Goethals, Benjamin Lucas, Charlotte Pelletier, Francois Petitjean, Geoffrey I. Webb, Lachlan O'Neill, Nayyar Zaidi","submitted_at":"2018-08-31T04:17:44Z","abstract_excerpt":"Research into the classification of time series has made enormous progress in the last decade. The UCR time series archive has played a significant role in challenging and guiding the development of new learners for time series classification. The largest dataset in the UCR archive holds 10 thousand time series only; which may explain why the primary research focus has been in creating algorithms that have high accuracy on relatively small datasets.\n  This paper introduces Proximity Forest, an algorithm that learns accurate models from datasets with millions of time series, and classifies a ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10594","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-17T23:54:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZMa6tjPK87ESuxf8YBANGgjTeH/LuSUGkiS7HQPIQZcKwH/pqqEVERHU9QQJ+FGHY6966FxywzHup8oki83DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:14:38.882091Z"},"content_sha256":"3f05bcfc97ad764831eea086daf1ef2e8ae4d5108b473a900e115a19dbb56d3c","schema_version":"1.0","event_id":"sha256:3f05bcfc97ad764831eea086daf1ef2e8ae4d5108b473a900e115a19dbb56d3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/bundle.json","state_url":"https://pith.science/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/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-05-25T23:14:38Z","links":{"resolver":"https://pith.science/pith/77G7JAREY3EIXSKQRXYFMUPV3Y","bundle":"https://pith.science/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/bundle.json","state":"https://pith.science/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/77G7JAREY3EIXSKQRXYFMUPV3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:77G7JAREY3EIXSKQRXYFMUPV3Y","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":"64047e3b7663082c5420f79e795d4ce8266a39a3169adf9fe0ef0b93a0394e47","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T04:17:44Z","title_canon_sha256":"3afa2fd5f6af78886d49c220fa2c5689acf79ea48d78de9a635a341ae14967b2"},"schema_version":"1.0","source":{"id":"1808.10594","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.10594","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.10594v2","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.10594","created_at":"2026-05-17T23:54:22Z"},{"alias_kind":"pith_short_12","alias_value":"77G7JAREY3EI","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"77G7JAREY3EIXSKQ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"77G7JARE","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:3f05bcfc97ad764831eea086daf1ef2e8ae4d5108b473a900e115a19dbb56d3c","target":"graph","created_at":"2026-05-17T23:54:22Z","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":"Research into the classification of time series has made enormous progress in the last decade. The UCR time series archive has played a significant role in challenging and guiding the development of new learners for time series classification. The largest dataset in the UCR archive holds 10 thousand time series only; which may explain why the primary research focus has been in creating algorithms that have high accuracy on relatively small datasets.\n  This paper introduces Proximity Forest, an algorithm that learns accurate models from datasets with millions of time series, and classifies a ti","authors_text":"Ahmed Shifaz, Bart Goethals, Benjamin Lucas, Charlotte Pelletier, Francois Petitjean, Geoffrey I. Webb, Lachlan O'Neill, Nayyar Zaidi","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T04:17:44Z","title":"Proximity Forest: An effective and scalable distance-based classifier for time series"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.10594","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:71d71ef08984e1ed3c9aa5961ced0f0fe4c50ca1610518de9749b15ff3cb960b","target":"record","created_at":"2026-05-17T23:54:22Z","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":"64047e3b7663082c5420f79e795d4ce8266a39a3169adf9fe0ef0b93a0394e47","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-08-31T04:17:44Z","title_canon_sha256":"3afa2fd5f6af78886d49c220fa2c5689acf79ea48d78de9a635a341ae14967b2"},"schema_version":"1.0","source":{"id":"1808.10594","kind":"arxiv","version":2}},"canonical_sha256":"ffcdf48224c6c88bc9508df05651f5de37466a0e9e739c630cb21dd4e03969c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffcdf48224c6c88bc9508df05651f5de37466a0e9e739c630cb21dd4e03969c6","first_computed_at":"2026-05-17T23:54:22.615553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:22.615553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"muhr06rbVwnTE2gcnft2WxbHpEiKVDYZQ4uHvoYPIC4a28rhzNmPnnCTnoHQz7WJQVZ8ldLLF91StaSP3i9tCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:22.616139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.10594","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:71d71ef08984e1ed3c9aa5961ced0f0fe4c50ca1610518de9749b15ff3cb960b","sha256:3f05bcfc97ad764831eea086daf1ef2e8ae4d5108b473a900e115a19dbb56d3c"],"state_sha256":"845aff3816dc60112ff61148f0f2bb3d503bfadfef8d77cda355d761d8084c64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FiinavRoTTJrtQomX0X1tqiydiAVdidtHRDpnv+8efkH2oh46rqvVfqqshmTBbaRjaEDiWxm/LusB+I1XkiVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:14:38.885966Z","bundle_sha256":"adc2a76a67de046d7fa8b0d21f0a6c90abba66a50447b32bd4d8b04f4cd62943"}}