{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3ZMXNKQDNENFZ3J6SMLA6QXWY5","short_pith_number":"pith:3ZMXNKQD","canonical_record":{"source":{"id":"1703.08403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-24T13:29:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9989d7f6725e138c191889c8aa35b72c879e835afb5197d9cae1e90298d32602","abstract_canon_sha256":"1ade78d95c17e92ba8ccbbbf4cfde77f0a6bcb85f1c2fb955541500c21e8b187"},"schema_version":"1.0"},"canonical_sha256":"de5976aa03691a5ced3e93160f42f6c7522382bf1436de34d2b4b292b9e4d8f0","source":{"kind":"arxiv","id":"1703.08403","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08403","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08403v1","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08403","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"3ZMXNKQDNENF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZMXNKQDNENFZ3J6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZMXNKQD","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3ZMXNKQDNENFZ3J6SMLA6QXWY5","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08403","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-24T13:29:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9989d7f6725e138c191889c8aa35b72c879e835afb5197d9cae1e90298d32602","abstract_canon_sha256":"1ade78d95c17e92ba8ccbbbf4cfde77f0a6bcb85f1c2fb955541500c21e8b187"},"schema_version":"1.0"},"canonical_sha256":"de5976aa03691a5ced3e93160f42f6c7522382bf1436de34d2b4b292b9e4d8f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:00.017817Z","signature_b64":"2jAINRnwqDFOBzKpFr2mdg3slQy7ON7KACKpw3I3PmND0bjDBhddl20taVWnPv0zYphhjkLT6N3Z5PcAmUywAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de5976aa03691a5ced3e93160f42f6c7522382bf1436de34d2b4b292b9e4d8f0","last_reissued_at":"2026-05-18T00:48:00.017284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:00.017284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08403","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-05-18T00:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wKbw8g5yY3Up68dsnJoUo/cNswAptrkxkZiIfUUXW39cI/T8+NZ5fqJAn1sLuRiFzGebo3QWNSQZ48dFbx/MAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:19:22.364238Z"},"content_sha256":"8bffdc4616207394c607e689b767d3ee981ee9536b4acdaba694cdb6da9991a5","schema_version":"1.0","event_id":"sha256:8bffdc4616207394c607e689b767d3ee981ee9536b4acdaba694cdb6da9991a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3ZMXNKQDNENFZ3J6SMLA6QXWY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymmetric Learning Vector Quantization for Efficient Nearest Neighbor Classification in Dynamic Time Warping Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Brijnesh Jain, David Schultz","submitted_at":"2017-03-24T13:29:52Z","abstract_excerpt":"The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification. This method suffers from high storage and computation requirements for large training sets. As a solution to both drawbacks, this article extends learning vector quantization (LVQ) from Euclidean spaces to DTW spaces. The proposed LVQ scheme uses asymmetric weighted averaging as update rule. Empirical results exhibited superior performance of asymmetric generalized LVQ (GLVQ) over other state-of-the-art prototype generation methods for nearest n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08403","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":""},"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-18T00:48:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8Dm20+5zeQeYxCdyYG71RvjujcneGB9U6+drO3IOuSPt4F/W9J8qBUe5vARRCpwzeJEbNF0FhSMBGNFlpRiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:19:22.364912Z"},"content_sha256":"e348a734284dd489c8c3385326611483a6ce00f1b12ffc1b9899da8cbb87d784","schema_version":"1.0","event_id":"sha256:e348a734284dd489c8c3385326611483a6ce00f1b12ffc1b9899da8cbb87d784"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/bundle.json","state_url":"https://pith.science/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/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:19:22Z","links":{"resolver":"https://pith.science/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5","bundle":"https://pith.science/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/bundle.json","state":"https://pith.science/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZMXNKQDNENFZ3J6SMLA6QXWY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3ZMXNKQDNENFZ3J6SMLA6QXWY5","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":"1ade78d95c17e92ba8ccbbbf4cfde77f0a6bcb85f1c2fb955541500c21e8b187","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-24T13:29:52Z","title_canon_sha256":"9989d7f6725e138c191889c8aa35b72c879e835afb5197d9cae1e90298d32602"},"schema_version":"1.0","source":{"id":"1703.08403","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08403","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08403v1","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08403","created_at":"2026-05-18T00:48:00Z"},{"alias_kind":"pith_short_12","alias_value":"3ZMXNKQDNENF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3ZMXNKQDNENFZ3J6","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3ZMXNKQD","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:e348a734284dd489c8c3385326611483a6ce00f1b12ffc1b9899da8cbb87d784","target":"graph","created_at":"2026-05-18T00:48:00Z","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":"The nearest neighbor method together with the dynamic time warping (DTW) distance is one of the most popular approaches in time series classification. This method suffers from high storage and computation requirements for large training sets. As a solution to both drawbacks, this article extends learning vector quantization (LVQ) from Euclidean spaces to DTW spaces. The proposed LVQ scheme uses asymmetric weighted averaging as update rule. Empirical results exhibited superior performance of asymmetric generalized LVQ (GLVQ) over other state-of-the-art prototype generation methods for nearest n","authors_text":"Brijnesh Jain, David Schultz","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-24T13:29:52Z","title":"Asymmetric Learning Vector Quantization for Efficient Nearest Neighbor Classification in Dynamic Time Warping Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08403","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:8bffdc4616207394c607e689b767d3ee981ee9536b4acdaba694cdb6da9991a5","target":"record","created_at":"2026-05-18T00:48:00Z","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":"1ade78d95c17e92ba8ccbbbf4cfde77f0a6bcb85f1c2fb955541500c21e8b187","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-03-24T13:29:52Z","title_canon_sha256":"9989d7f6725e138c191889c8aa35b72c879e835afb5197d9cae1e90298d32602"},"schema_version":"1.0","source":{"id":"1703.08403","kind":"arxiv","version":1}},"canonical_sha256":"de5976aa03691a5ced3e93160f42f6c7522382bf1436de34d2b4b292b9e4d8f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de5976aa03691a5ced3e93160f42f6c7522382bf1436de34d2b4b292b9e4d8f0","first_computed_at":"2026-05-18T00:48:00.017284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:00.017284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jAINRnwqDFOBzKpFr2mdg3slQy7ON7KACKpw3I3PmND0bjDBhddl20taVWnPv0zYphhjkLT6N3Z5PcAmUywAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:00.017817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08403","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bffdc4616207394c607e689b767d3ee981ee9536b4acdaba694cdb6da9991a5","sha256:e348a734284dd489c8c3385326611483a6ce00f1b12ffc1b9899da8cbb87d784"],"state_sha256":"061e34334f2d15e329d039f0f7a6066dfe682dc3ed338172f1d5b6424be704d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rKALxvCf+AIy77u5kbDyh/0kcO+dIG5fdHNShN43/aux50W25e/F9EykX9gxyuyWvihavU+BTrylKcncN2VkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:19:22.368341Z","bundle_sha256":"3fed5658daf9a38c14a4edba53dfb5c4095f6b646a28312d26490bd389ccfb65"}}