{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DQ7JXMXUJT3URXOJTN5SDVGCXA","short_pith_number":"pith:DQ7JXMXU","canonical_record":{"source":{"id":"1302.3639","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-14T22:12:40Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"56805f12b7f21b6766c650869f7a88d53382968ffba2b890922317973a2e5d9f","abstract_canon_sha256":"d12feec34c85c5bf434d3be93f12dc75652e41d3266f37c005a91a38bcbab30b"},"schema_version":"1.0"},"canonical_sha256":"1c3e9bb2f44cf748ddc99b7b21d4c2b83e0c28b2d0a644b11c3610cfa167f1a1","source":{"kind":"arxiv","id":"1302.3639","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3639","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3639v5","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3639","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"DQ7JXMXUJT3U","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DQ7JXMXUJT3URXOJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DQ7JXMXU","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DQ7JXMXUJT3URXOJTN5SDVGCXA","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3639","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-14T22:12:40Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"56805f12b7f21b6766c650869f7a88d53382968ffba2b890922317973a2e5d9f","abstract_canon_sha256":"d12feec34c85c5bf434d3be93f12dc75652e41d3266f37c005a91a38bcbab30b"},"schema_version":"1.0"},"canonical_sha256":"1c3e9bb2f44cf748ddc99b7b21d4c2b83e0c28b2d0a644b11c3610cfa167f1a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:49.600428Z","signature_b64":"LfjOAAHdj+YT/6OprjyiGi0fF4CvyRtMmgpyJcQryt6jbg+bb6V0CmXLivIkl0eR3eP1lSMow2UM+bqhbbbqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c3e9bb2f44cf748ddc99b7b21d4c2b83e0c28b2d0a644b11c3610cfa167f1a1","last_reissued_at":"2026-05-18T03:04:49.599670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:49.599670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3639","source_version":5,"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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bh/SDVoKuvDk/E1NJeoWJ0yqZGI86XpVQOgnnKMKGzePab3K/CCrFtR/VI+B8b62MASg18WYYgpIq+hLF82iDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:35:11.127897Z"},"content_sha256":"a01f8b65d524472c07be75bf220ff263c99cacd6baffa022ba0300d21620d7cd","schema_version":"1.0","event_id":"sha256:a01f8b65d524472c07be75bf220ff263c99cacd6baffa022ba0300d21620d7cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DQ7JXMXUJT3URXOJTN5SDVGCXA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Latent Source Model for Nonparametric Time Series Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"stat.ML","authors_text":"Devavrat Shah, George H. Chen, Stanislav Nikolov","submitted_at":"2013-02-14T22:12:40Z","abstract_excerpt":"For classifying time series, a nearest-neighbor approach is widely used in practice with performance often competitive with or better than more elaborate methods such as neural networks, decision trees, and support vector machines. We develop theoretical justification for the effectiveness of nearest-neighbor-like classification of time series. Our guiding hypothesis is that in many applications, such as forecasting which topics will become trends on Twitter, there aren't actually that many prototypical time series to begin with, relative to the number of time series we have access to, e.g., t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3639","kind":"arxiv","version":5},"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:04:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k9Oa8XoG8hyaAwhl6krBLhQyqAVR8RR7M3QItX5rd5OMp9yuzkRTV1COMrgfXetnh2+zMmb61N5cXn1cFaj/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:35:11.128243Z"},"content_sha256":"2811fed9e43a18e81d2f44e62cf0287843b6ee3a98c553441fb06c8ae209b57f","schema_version":"1.0","event_id":"sha256:2811fed9e43a18e81d2f44e62cf0287843b6ee3a98c553441fb06c8ae209b57f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/bundle.json","state_url":"https://pith.science/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/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-05T00:35:11Z","links":{"resolver":"https://pith.science/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA","bundle":"https://pith.science/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/bundle.json","state":"https://pith.science/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DQ7JXMXUJT3URXOJTN5SDVGCXA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DQ7JXMXUJT3URXOJTN5SDVGCXA","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":"d12feec34c85c5bf434d3be93f12dc75652e41d3266f37c005a91a38bcbab30b","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-14T22:12:40Z","title_canon_sha256":"56805f12b7f21b6766c650869f7a88d53382968ffba2b890922317973a2e5d9f"},"schema_version":"1.0","source":{"id":"1302.3639","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3639","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3639v5","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3639","created_at":"2026-05-18T03:04:49Z"},{"alias_kind":"pith_short_12","alias_value":"DQ7JXMXUJT3U","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DQ7JXMXUJT3URXOJ","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DQ7JXMXU","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:2811fed9e43a18e81d2f44e62cf0287843b6ee3a98c553441fb06c8ae209b57f","target":"graph","created_at":"2026-05-18T03:04:49Z","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":"For classifying time series, a nearest-neighbor approach is widely used in practice with performance often competitive with or better than more elaborate methods such as neural networks, decision trees, and support vector machines. We develop theoretical justification for the effectiveness of nearest-neighbor-like classification of time series. Our guiding hypothesis is that in many applications, such as forecasting which topics will become trends on Twitter, there aren't actually that many prototypical time series to begin with, relative to the number of time series we have access to, e.g., t","authors_text":"Devavrat Shah, George H. Chen, Stanislav Nikolov","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-14T22:12:40Z","title":"A Latent Source Model for Nonparametric Time Series Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3639","kind":"arxiv","version":5},"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:a01f8b65d524472c07be75bf220ff263c99cacd6baffa022ba0300d21620d7cd","target":"record","created_at":"2026-05-18T03:04:49Z","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":"d12feec34c85c5bf434d3be93f12dc75652e41d3266f37c005a91a38bcbab30b","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-14T22:12:40Z","title_canon_sha256":"56805f12b7f21b6766c650869f7a88d53382968ffba2b890922317973a2e5d9f"},"schema_version":"1.0","source":{"id":"1302.3639","kind":"arxiv","version":5}},"canonical_sha256":"1c3e9bb2f44cf748ddc99b7b21d4c2b83e0c28b2d0a644b11c3610cfa167f1a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1c3e9bb2f44cf748ddc99b7b21d4c2b83e0c28b2d0a644b11c3610cfa167f1a1","first_computed_at":"2026-05-18T03:04:49.599670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:49.599670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LfjOAAHdj+YT/6OprjyiGi0fF4CvyRtMmgpyJcQryt6jbg+bb6V0CmXLivIkl0eR3eP1lSMow2UM+bqhbbbqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:49.600428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3639","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a01f8b65d524472c07be75bf220ff263c99cacd6baffa022ba0300d21620d7cd","sha256:2811fed9e43a18e81d2f44e62cf0287843b6ee3a98c553441fb06c8ae209b57f"],"state_sha256":"6878c074e98bae4fde6398c0c9891a8fdda527dbd2e07e47a27d4285ea5eae57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mjs/2BW5SkJVhkHwkVDekmvl12oTcPTX59onGuO9C2eYcnx/LzpBYX/UpeXmY/M1y9THLGotIeg7/z99fZixBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:35:11.130382Z","bundle_sha256":"5fbb6fce80bbf7eae630f5a07f324f08cb4e9ba89b50edbf722953b0c20269ec"}}