{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E2QOQW25Z4Q77YKDG5H6MAFU67","short_pith_number":"pith:E2QOQW25","canonical_record":{"source":{"id":"1504.05059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-20T13:48:45Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"5787baf0d38529ade3ede843e97ff1511121e68ac1e269204cea6ba76771204c","abstract_canon_sha256":"2e75eac0f0a6dfee603b99a31a47f604c5c759908fd4b87958ba013b3c817f29"},"schema_version":"1.0"},"canonical_sha256":"26a0e85b5dcf21ffe143374fe600b4f7ee7d42b6e83b3bcea62a94f633cf11c6","source":{"kind":"arxiv","id":"1504.05059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05059","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05059v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05059","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"E2QOQW25Z4Q7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2QOQW25Z4Q77YKD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2QOQW25","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E2QOQW25Z4Q77YKDG5H6MAFU67","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-20T13:48:45Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"5787baf0d38529ade3ede843e97ff1511121e68ac1e269204cea6ba76771204c","abstract_canon_sha256":"2e75eac0f0a6dfee603b99a31a47f604c5c759908fd4b87958ba013b3c817f29"},"schema_version":"1.0"},"canonical_sha256":"26a0e85b5dcf21ffe143374fe600b4f7ee7d42b6e83b3bcea62a94f633cf11c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:50.712223Z","signature_b64":"tb+OT8v7RxJUN7MEbs+jtRCrh94DCJXe2aaKjtx18IRyb+SbsyTEmXI6mMkXPznq4iw4MGE9Sqj9J9dH9VY/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26a0e85b5dcf21ffe143374fe600b4f7ee7d42b6e83b3bcea62a94f633cf11c6","last_reissued_at":"2026-05-18T00:57:50.711595Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:50.711595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05059","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3bybmxln1z8soMzDzytHezZEzFeVr4Riu1KKd0NuX8ALqvgx4lYHqbksWksKSqVsFLL/MG9QjklAbmgud6cBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:23:13.305691Z"},"content_sha256":"cac6564961dca5dd6bd9d100842da5d42f232bfd4c5022f38e61b8673451b147","schema_version":"1.0","event_id":"sha256:cac6564961dca5dd6bd9d100842da5d42f232bfd4c5022f38e61b8673451b147"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E2QOQW25Z4Q77YKDG5H6MAFU67","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonparametric Nearest Neighbor Random Process Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"stat.ML","authors_text":"Helmut B\\\"olcskei, Michael Tschannen","submitted_at":"2015-04-20T13:48:45Z","abstract_excerpt":"We consider the problem of clustering noisy finite-length observations of stationary ergodic random processes according to their nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectral densities (PSDs) as a measure of dissimilarity, are analyzed. The first algorithm, termed nearest neighbor process clustering (NNPC), to the best of our knowledge, is new and relies on partitioning the nearest neighbor graph of the observations via spectral clustering. The seco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05059","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:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4FUJ8fih2kZ9RfMqsrKtSMXnqfX1MC/PJ1+tpJzNwVGxurjs1WYk89bar+zCKMVgzlKwKMFUpLKYP5kySO9jAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:23:13.306414Z"},"content_sha256":"232364655edabac048abac7e514d16a0ea588cbed4ee66104b314e9b0c71a7de","schema_version":"1.0","event_id":"sha256:232364655edabac048abac7e514d16a0ea588cbed4ee66104b314e9b0c71a7de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/bundle.json","state_url":"https://pith.science/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/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-09T03:23:13Z","links":{"resolver":"https://pith.science/pith/E2QOQW25Z4Q77YKDG5H6MAFU67","bundle":"https://pith.science/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/bundle.json","state":"https://pith.science/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2QOQW25Z4Q77YKDG5H6MAFU67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E2QOQW25Z4Q77YKDG5H6MAFU67","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":"2e75eac0f0a6dfee603b99a31a47f604c5c759908fd4b87958ba013b3c817f29","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-20T13:48:45Z","title_canon_sha256":"5787baf0d38529ade3ede843e97ff1511121e68ac1e269204cea6ba76771204c"},"schema_version":"1.0","source":{"id":"1504.05059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05059","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05059v1","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05059","created_at":"2026-05-18T00:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"E2QOQW25Z4Q7","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2QOQW25Z4Q77YKD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2QOQW25","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:232364655edabac048abac7e514d16a0ea588cbed4ee66104b314e9b0c71a7de","target":"graph","created_at":"2026-05-18T00:57:50Z","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 nonparametric generative models without prior knowledge of the model statistics and the number of generative models. Two algorithms, both using the L1-distance between estimated power spectral densities (PSDs) as a measure of dissimilarity, are analyzed. The first algorithm, termed nearest neighbor process clustering (NNPC), to the best of our knowledge, is new and relies on partitioning the nearest neighbor graph of the observations via spectral clustering. The seco","authors_text":"Helmut B\\\"olcskei, Michael Tschannen","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-20T13:48:45Z","title":"Nonparametric Nearest Neighbor Random Process Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05059","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:cac6564961dca5dd6bd9d100842da5d42f232bfd4c5022f38e61b8673451b147","target":"record","created_at":"2026-05-18T00:57:50Z","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":"2e75eac0f0a6dfee603b99a31a47f604c5c759908fd4b87958ba013b3c817f29","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-04-20T13:48:45Z","title_canon_sha256":"5787baf0d38529ade3ede843e97ff1511121e68ac1e269204cea6ba76771204c"},"schema_version":"1.0","source":{"id":"1504.05059","kind":"arxiv","version":1}},"canonical_sha256":"26a0e85b5dcf21ffe143374fe600b4f7ee7d42b6e83b3bcea62a94f633cf11c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26a0e85b5dcf21ffe143374fe600b4f7ee7d42b6e83b3bcea62a94f633cf11c6","first_computed_at":"2026-05-18T00:57:50.711595Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:50.711595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tb+OT8v7RxJUN7MEbs+jtRCrh94DCJXe2aaKjtx18IRyb+SbsyTEmXI6mMkXPznq4iw4MGE9Sqj9J9dH9VY/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:50.712223Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cac6564961dca5dd6bd9d100842da5d42f232bfd4c5022f38e61b8673451b147","sha256:232364655edabac048abac7e514d16a0ea588cbed4ee66104b314e9b0c71a7de"],"state_sha256":"e97b9e8e4505963e641d86edb50e1c456d026b54215bc8a0fe2eb820b159b970"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRiZDDPRXkjc+wV1yn0vwbZ98J9TVgmahwmxin+jnN5xfjAptpO6V3+T8BqTntltQsGUwmCpsl3kvK4XrIerCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:23:13.311359Z","bundle_sha256":"be3746d5a84c61450d746763ec5438a36225cd954fd226c80a3c9fc3e25085ad"}}