{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6PT6K3LK4RNX2UBVAUTLKDIGZB","short_pith_number":"pith:6PT6K3LK","canonical_record":{"source":{"id":"1302.4773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-19T22:59:44Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"0ab5e4be0508d3dca1d0157d84ab006a791080a7d71ea9ac709dfe52a843ac67","abstract_canon_sha256":"563b5fbcdc5261250d3421106612114d59e75f5894eaf55cfcd1f7a8f6f263d6"},"schema_version":"1.0"},"canonical_sha256":"f3e7e56d6ae45b7d50350526b50d06c87209ff775a30b177505a4bf2cb7ae3a6","source":{"kind":"arxiv","id":"1302.4773","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4773","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4773v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4773","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"6PT6K3LK4RNX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6PT6K3LK4RNX2UBV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6PT6K3LK","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6PT6K3LK4RNX2UBVAUTLKDIGZB","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-19T22:59:44Z","cross_cats_sorted":["cs.LG","cs.PF"],"title_canon_sha256":"0ab5e4be0508d3dca1d0157d84ab006a791080a7d71ea9ac709dfe52a843ac67","abstract_canon_sha256":"563b5fbcdc5261250d3421106612114d59e75f5894eaf55cfcd1f7a8f6f263d6"},"schema_version":"1.0"},"canonical_sha256":"f3e7e56d6ae45b7d50350526b50d06c87209ff775a30b177505a4bf2cb7ae3a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.417891Z","signature_b64":"ai5TxouEHU3qsGu0/e8lt/BsTEUMiqmt0tbDrEG7UqgNoh/dlpzlmgNZ3PiigVVS3n1ts0FeUGMotA9EnwtTBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3e7e56d6ae45b7d50350526b50d06c87209ff775a30b177505a4bf2cb7ae3a6","last_reissued_at":"2026-05-18T00:59:04.417036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.417036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4773","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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLLx2De2noC/yP1kueIj3qQQFRQjYPkjRPrh9kfS5snMniXFHORVOkFvBDdkYMfvhT1vJ2H0TXZjktvlveAbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:27.714578Z"},"content_sha256":"58175a185c7238885cc8e6d06c0bf3203aeb4022eb4309d50947b137c3a8c49f","schema_version":"1.0","event_id":"sha256:58175a185c7238885cc8e6d06c0bf3203aeb4022eb4309d50947b137c3a8c49f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6PT6K3LK4RNX2UBVAUTLKDIGZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Discriminant Functions Based On Sampled Distribution Distance for Modulation Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.PF"],"primary_cat":"stat.ML","authors_text":"Danijela Cabric, Eric Rebeiz, Paulo Urriza","submitted_at":"2013-02-19T22:59:44Z","abstract_excerpt":"In this letter, we derive the optimal discriminant functions for modulation classification based on the sampled distribution distance. The proposed method classifies various candidate constellations using a low complexity approach based on the distribution distance at specific testpoints along the cumulative distribution function. This method, based on the Bayesian decision criteria, asymptotically provides the minimum classification error possible given a set of testpoints. Testpoint locations are also optimized to improve classification performance. The method provides significant gains over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4773","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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORK4cXKvxXkjwUxs6t/1cOudj2meqa0joxxALY8FwHXkzoMNJbyp2XefgR0PtsO/kUJ5VfjOvyiKnbeOSHcbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:18:27.715214Z"},"content_sha256":"f0517abcd2c9507f8ee65b2c06bf82461a8bf6f55f900927b16c874ea718d805","schema_version":"1.0","event_id":"sha256:f0517abcd2c9507f8ee65b2c06bf82461a8bf6f55f900927b16c874ea718d805"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/bundle.json","state_url":"https://pith.science/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/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-02T12:18:27Z","links":{"resolver":"https://pith.science/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB","bundle":"https://pith.science/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/bundle.json","state":"https://pith.science/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6PT6K3LK4RNX2UBVAUTLKDIGZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6PT6K3LK4RNX2UBVAUTLKDIGZB","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":"563b5fbcdc5261250d3421106612114d59e75f5894eaf55cfcd1f7a8f6f263d6","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-19T22:59:44Z","title_canon_sha256":"0ab5e4be0508d3dca1d0157d84ab006a791080a7d71ea9ac709dfe52a843ac67"},"schema_version":"1.0","source":{"id":"1302.4773","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4773","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4773v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4773","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"6PT6K3LK4RNX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6PT6K3LK4RNX2UBV","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6PT6K3LK","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:f0517abcd2c9507f8ee65b2c06bf82461a8bf6f55f900927b16c874ea718d805","target":"graph","created_at":"2026-05-18T00:59:04Z","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":"In this letter, we derive the optimal discriminant functions for modulation classification based on the sampled distribution distance. The proposed method classifies various candidate constellations using a low complexity approach based on the distribution distance at specific testpoints along the cumulative distribution function. This method, based on the Bayesian decision criteria, asymptotically provides the minimum classification error possible given a set of testpoints. Testpoint locations are also optimized to improve classification performance. The method provides significant gains over","authors_text":"Danijela Cabric, Eric Rebeiz, Paulo Urriza","cross_cats":["cs.LG","cs.PF"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-19T22:59:44Z","title":"Optimal Discriminant Functions Based On Sampled Distribution Distance for Modulation Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4773","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:58175a185c7238885cc8e6d06c0bf3203aeb4022eb4309d50947b137c3a8c49f","target":"record","created_at":"2026-05-18T00:59:04Z","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":"563b5fbcdc5261250d3421106612114d59e75f5894eaf55cfcd1f7a8f6f263d6","cross_cats_sorted":["cs.LG","cs.PF"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-19T22:59:44Z","title_canon_sha256":"0ab5e4be0508d3dca1d0157d84ab006a791080a7d71ea9ac709dfe52a843ac67"},"schema_version":"1.0","source":{"id":"1302.4773","kind":"arxiv","version":1}},"canonical_sha256":"f3e7e56d6ae45b7d50350526b50d06c87209ff775a30b177505a4bf2cb7ae3a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3e7e56d6ae45b7d50350526b50d06c87209ff775a30b177505a4bf2cb7ae3a6","first_computed_at":"2026-05-18T00:59:04.417036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.417036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ai5TxouEHU3qsGu0/e8lt/BsTEUMiqmt0tbDrEG7UqgNoh/dlpzlmgNZ3PiigVVS3n1ts0FeUGMotA9EnwtTBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.417891Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4773","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58175a185c7238885cc8e6d06c0bf3203aeb4022eb4309d50947b137c3a8c49f","sha256:f0517abcd2c9507f8ee65b2c06bf82461a8bf6f55f900927b16c874ea718d805"],"state_sha256":"d58292f96de69f344ac617feaa181ddbd5f1d44e0ca6c406b5d92727abc9cf19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvWGzlQr2al4oQ7Ep0pqsSPc6O+gJWNcANOcrYbSBEpC+RQ5x5mCcmYx+NIjF8Apnsyxv26ASDwdPHoydpvxDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:18:27.718631Z","bundle_sha256":"76055e75ef4793a74dff9804852b567f8e538fb86d391203288bf01c9884c993"}}