{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LU7W55BIR2ZNDWRXPHUMZSUVJJ","short_pith_number":"pith:LU7W55BI","canonical_record":{"source":{"id":"1612.01103","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-04T11:38:06Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"bd3e606e9b360ebb74a943d39c4785be9c55f553e9ff27aca6da73083eafbb41","abstract_canon_sha256":"ead15b17f38aae75061ee5548b67f2e9da4a7c7d26bed3dfb58c64c2197a629f"},"schema_version":"1.0"},"canonical_sha256":"5d3f6ef4288eb2d1da3779e8ccca954a613fd8b20381fa54740db412757a3fc2","source":{"kind":"arxiv","id":"1612.01103","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01103","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01103v3","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01103","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"LU7W55BIR2ZN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LU7W55BIR2ZNDWRX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LU7W55BI","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LU7W55BIR2ZNDWRXPHUMZSUVJJ","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01103","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-04T11:38:06Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"bd3e606e9b360ebb74a943d39c4785be9c55f553e9ff27aca6da73083eafbb41","abstract_canon_sha256":"ead15b17f38aae75061ee5548b67f2e9da4a7c7d26bed3dfb58c64c2197a629f"},"schema_version":"1.0"},"canonical_sha256":"5d3f6ef4288eb2d1da3779e8ccca954a613fd8b20381fa54740db412757a3fc2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:10.155778Z","signature_b64":"exYt0zdcuIIs3SrgpbPTv/jv/fQ7Ie1jvNxcwHYANSgvASmqyCn8aVY2Si7M+Df1ZMsgBilj1PaPxdgnF7KlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d3f6ef4288eb2d1da3779e8ccca954a613fd8b20381fa54740db412757a3fc2","last_reissued_at":"2026-05-18T00:34:10.155050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:10.155050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01103","source_version":3,"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uoi3ocMPjBGhlSMOzWLShKcYi1q4aqWf6bIWxpw//VAGfkUQrstOAhQXGf7ZQXAtnVlwfpSmw85yUZs6lFeeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:44:30.860080Z"},"content_sha256":"51637b998607088dc3e037f91b8d272dfb61218adb8b041b704fee76086c76d9","schema_version":"1.0","event_id":"sha256:51637b998607088dc3e037f91b8d272dfb61218adb8b041b704fee76086c76d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LU7W55BIR2ZNDWRXPHUMZSUVJJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust nonparametric nearest neighbor random process clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Helmut B\\\"olcskei, Michael Tschannen","submitted_at":"2016-12-04T11:38:06Z","abstract_excerpt":"We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the $L^1$-distance between estimated power spectral densities (PSDs) as a measure of dissimilarity, are analyzed. The first one, termed nearest neighbor process clustering (NNPC), relies on partitioning the nearest neighbor graph of the observations via spectral clustering. The second algorithm, simply referred to as $k$-means (KM), consis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01103","kind":"arxiv","version":3},"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:34:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hZH4Y1o9xOHYLOI3FwkBnUMpdxYSQzs1ch5uWphFm2WnWqlWTo1EtJbCOFTDbsbZtRp5td/7Ij0VaDE1LD6qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:44:30.860852Z"},"content_sha256":"ea99fe63be948c5490ab8c78fe4a5c83b5c72053151022d95cf0cbb65a786f1d","schema_version":"1.0","event_id":"sha256:ea99fe63be948c5490ab8c78fe4a5c83b5c72053151022d95cf0cbb65a786f1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/bundle.json","state_url":"https://pith.science/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/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-09T06:44:30Z","links":{"resolver":"https://pith.science/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ","bundle":"https://pith.science/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/bundle.json","state":"https://pith.science/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LU7W55BIR2ZNDWRXPHUMZSUVJJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LU7W55BIR2ZNDWRXPHUMZSUVJJ","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":"ead15b17f38aae75061ee5548b67f2e9da4a7c7d26bed3dfb58c64c2197a629f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-04T11:38:06Z","title_canon_sha256":"bd3e606e9b360ebb74a943d39c4785be9c55f553e9ff27aca6da73083eafbb41"},"schema_version":"1.0","source":{"id":"1612.01103","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01103","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01103v3","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01103","created_at":"2026-05-18T00:34:10Z"},{"alias_kind":"pith_short_12","alias_value":"LU7W55BIR2ZN","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LU7W55BIR2ZNDWRX","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LU7W55BI","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:ea99fe63be948c5490ab8c78fe4a5c83b5c72053151022d95cf0cbb65a786f1d","target":"graph","created_at":"2026-05-18T00:34:10Z","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 consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the $L^1$-distance between estimated power spectral densities (PSDs) as a measure of dissimilarity, are analyzed. The first one, termed nearest neighbor process clustering (NNPC), relies on partitioning the nearest neighbor graph of the observations via spectral clustering. The second algorithm, simply referred to as $k$-means (KM), consis","authors_text":"Helmut B\\\"olcskei, Michael Tschannen","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-04T11:38:06Z","title":"Robust nonparametric nearest neighbor random process clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01103","kind":"arxiv","version":3},"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:51637b998607088dc3e037f91b8d272dfb61218adb8b041b704fee76086c76d9","target":"record","created_at":"2026-05-18T00:34:10Z","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":"ead15b17f38aae75061ee5548b67f2e9da4a7c7d26bed3dfb58c64c2197a629f","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-04T11:38:06Z","title_canon_sha256":"bd3e606e9b360ebb74a943d39c4785be9c55f553e9ff27aca6da73083eafbb41"},"schema_version":"1.0","source":{"id":"1612.01103","kind":"arxiv","version":3}},"canonical_sha256":"5d3f6ef4288eb2d1da3779e8ccca954a613fd8b20381fa54740db412757a3fc2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d3f6ef4288eb2d1da3779e8ccca954a613fd8b20381fa54740db412757a3fc2","first_computed_at":"2026-05-18T00:34:10.155050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:10.155050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"exYt0zdcuIIs3SrgpbPTv/jv/fQ7Ie1jvNxcwHYANSgvASmqyCn8aVY2Si7M+Df1ZMsgBilj1PaPxdgnF7KlCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:10.155778Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01103","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51637b998607088dc3e037f91b8d272dfb61218adb8b041b704fee76086c76d9","sha256:ea99fe63be948c5490ab8c78fe4a5c83b5c72053151022d95cf0cbb65a786f1d"],"state_sha256":"fd8a32e3c783b546d77d1b6a66d3c54aacfca6b18ca5c3d7ca62906839003183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agTiM5xgoM8khMcJ3gzQdXNRWP7VZ8IJ5zh2roct0ah9hA4SuPC+tz3VZ+zd4fuahjp+bW2Jp7SZBJrlFa8LAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:44:30.865287Z","bundle_sha256":"888482fad1878f4e8f92a31b3f79e38602d5de62368b1d93aa2b7e1e2e985957"}}