{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:JEBEJUSG7XTCJGUNR73UP4M2AL","short_pith_number":"pith:JEBEJUSG","canonical_record":{"source":{"id":"1012.5327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T00:22:12Z","cross_cats_sorted":["cs.PF","math.IT","stat.ML"],"title_canon_sha256":"ed42a643b828b82f325f68b9482be88abd109103548c789963661889fa88df13","abstract_canon_sha256":"acca10b0c4ac9e4515a9d98f39a39a32b7881ace9bce1c20bbdc4488b865ce0a"},"schema_version":"1.0"},"canonical_sha256":"490244d246fde6249a8d8ff747f19a02e631124ef76c63db9157dc3114dce58d","source":{"kind":"arxiv","id":"1012.5327","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5327","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5327v3","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5327","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEBEJUSG7XTC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JEBEJUSG7XTCJGUN","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JEBEJUSG","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:JEBEJUSG7XTCJGUNR73UP4M2AL","target":"record","payload":{"canonical_record":{"source":{"id":"1012.5327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T00:22:12Z","cross_cats_sorted":["cs.PF","math.IT","stat.ML"],"title_canon_sha256":"ed42a643b828b82f325f68b9482be88abd109103548c789963661889fa88df13","abstract_canon_sha256":"acca10b0c4ac9e4515a9d98f39a39a32b7881ace9bce1c20bbdc4488b865ce0a"},"schema_version":"1.0"},"canonical_sha256":"490244d246fde6249a8d8ff747f19a02e631124ef76c63db9157dc3114dce58d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:16.497177Z","signature_b64":"2C1fHFzPykYiPRTyoY1XUE3vx8S2PuGOFs5VXUp1NoX+rvtq9Grg5Pr+pCdCg1JRRJVsI+L7PddB8zz1m/smDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"490244d246fde6249a8d8ff747f19a02e631124ef76c63db9157dc3114dce58d","last_reissued_at":"2026-05-18T04:14:16.496386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:16.496386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.5327","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-18T04:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/8fdvKcwHgvPd3aH5549M5rUnHDwxGZZcgs+eqGoDSW+A1kRJ3kJub0tTLBBYwhmdCCOlZ8h1MUzER6eGLlGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:02:39.717573Z"},"content_sha256":"349cda20aa1740a9ce62e692f8ceefa17ace8899c19501f23cb22caf3b73894d","schema_version":"1.0","event_id":"sha256:349cda20aa1740a9ce62e692f8ceefa17ace8899c19501f23cb22caf3b73894d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:JEBEJUSG7XTCJGUNR73UP4M2AL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computationally Efficient Modulation Level Classification Based on Probability Distribution Distance Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Danijela \\v{C}abri\\'c, Eric Rebeiz, Paulo Urriza, Przemys{\\l}aw Pawe{\\l}czak","submitted_at":"2010-12-24T00:22:12Z","abstract_excerpt":"We present a novel modulation level classification (MLC) method based on probability distribution distance functions. The proposed method uses modified Kuiper and Kolmogorov-Smirnov distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit tests. We derive the theoretical performance of the proposed MLC method and verify it via simulations. The best classification accuracy, under AWGN with SNR mismatch and phase jitter, is achieved with the proposed MLC method using Kuiper distances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5327","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-18T04:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"priG/a90xytHx14ER2GObFDF4Oyj5Dalhc+yVeJFStQecRhsehR2E1hJLPp64vBFvYaS7bAoSpJGR0ha8AJGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:02:39.718005Z"},"content_sha256":"0ac298ae50d36e9cee2978208a301924da6129ceca91758f8d81325efc6e71a5","schema_version":"1.0","event_id":"sha256:0ac298ae50d36e9cee2978208a301924da6129ceca91758f8d81325efc6e71a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/bundle.json","state_url":"https://pith.science/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/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-01T23:02:39Z","links":{"resolver":"https://pith.science/pith/JEBEJUSG7XTCJGUNR73UP4M2AL","bundle":"https://pith.science/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/bundle.json","state":"https://pith.science/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEBEJUSG7XTCJGUNR73UP4M2AL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:JEBEJUSG7XTCJGUNR73UP4M2AL","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":"acca10b0c4ac9e4515a9d98f39a39a32b7881ace9bce1c20bbdc4488b865ce0a","cross_cats_sorted":["cs.PF","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T00:22:12Z","title_canon_sha256":"ed42a643b828b82f325f68b9482be88abd109103548c789963661889fa88df13"},"schema_version":"1.0","source":{"id":"1012.5327","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.5327","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"1012.5327v3","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.5327","created_at":"2026-05-18T04:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"JEBEJUSG7XTC","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"JEBEJUSG7XTCJGUN","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"JEBEJUSG","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:0ac298ae50d36e9cee2978208a301924da6129ceca91758f8d81325efc6e71a5","target":"graph","created_at":"2026-05-18T04:14:16Z","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 present a novel modulation level classification (MLC) method based on probability distribution distance functions. The proposed method uses modified Kuiper and Kolmogorov-Smirnov distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit tests. We derive the theoretical performance of the proposed MLC method and verify it via simulations. The best classification accuracy, under AWGN with SNR mismatch and phase jitter, is achieved with the proposed MLC method using Kuiper distances.","authors_text":"Danijela \\v{C}abri\\'c, Eric Rebeiz, Paulo Urriza, Przemys{\\l}aw Pawe{\\l}czak","cross_cats":["cs.PF","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T00:22:12Z","title":"Computationally Efficient Modulation Level Classification Based on Probability Distribution Distance Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.5327","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:349cda20aa1740a9ce62e692f8ceefa17ace8899c19501f23cb22caf3b73894d","target":"record","created_at":"2026-05-18T04:14:16Z","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":"acca10b0c4ac9e4515a9d98f39a39a32b7881ace9bce1c20bbdc4488b865ce0a","cross_cats_sorted":["cs.PF","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-12-24T00:22:12Z","title_canon_sha256":"ed42a643b828b82f325f68b9482be88abd109103548c789963661889fa88df13"},"schema_version":"1.0","source":{"id":"1012.5327","kind":"arxiv","version":3}},"canonical_sha256":"490244d246fde6249a8d8ff747f19a02e631124ef76c63db9157dc3114dce58d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"490244d246fde6249a8d8ff747f19a02e631124ef76c63db9157dc3114dce58d","first_computed_at":"2026-05-18T04:14:16.496386Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:16.496386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2C1fHFzPykYiPRTyoY1XUE3vx8S2PuGOFs5VXUp1NoX+rvtq9Grg5Pr+pCdCg1JRRJVsI+L7PddB8zz1m/smDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:16.497177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.5327","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:349cda20aa1740a9ce62e692f8ceefa17ace8899c19501f23cb22caf3b73894d","sha256:0ac298ae50d36e9cee2978208a301924da6129ceca91758f8d81325efc6e71a5"],"state_sha256":"808857ecab451f358c4b2d19946133e69abb57a8739f1f77244a261b18fb180e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpGZhtH6dN4ps8GVuYJfN3LsPDY/7+nCP/cuPiLiiLuKBS5uEZ2qgHnBbhp5VJsafaf97uQUSGSy8CI9aOkvBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:02:39.720010Z","bundle_sha256":"cebbd8c232f351b0831d3c83244c01510d83640b57b15f5f7decb9261db99349"}}