{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZKKCJKO76ECQKGTBZCF2H2QDW3","short_pith_number":"pith:ZKKCJKO7","canonical_record":{"source":{"id":"1007.1272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-08T01:28:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cfe3cabb5081fbeac8aa91e992ae9a46307aa342e7527f7d84b3a8efd417a56c","abstract_canon_sha256":"48d2b3ccfc33679ade493c3a6a2e334fe3bb567135490018aa6d00c43d03729b"},"schema_version":"1.0"},"canonical_sha256":"ca9424a9dff105051a61c88ba3ea03b6c8990c28d69e5cb93befc885424809dc","source":{"kind":"arxiv","id":"1007.1272","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1272","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1272v2","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1272","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZKKCJKO76ECQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZKKCJKO76ECQKGTB","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZKKCJKO7","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZKKCJKO76ECQKGTBZCF2H2QDW3","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-08T01:28:34Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cfe3cabb5081fbeac8aa91e992ae9a46307aa342e7527f7d84b3a8efd417a56c","abstract_canon_sha256":"48d2b3ccfc33679ade493c3a6a2e334fe3bb567135490018aa6d00c43d03729b"},"schema_version":"1.0"},"canonical_sha256":"ca9424a9dff105051a61c88ba3ea03b6c8990c28d69e5cb93befc885424809dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:27.388057Z","signature_b64":"X+v3mVaOu9SBxcubiVbjgXDpkupUgBbivdaS8hAz40mN+sOa0jQcjWCUNm4XuLMlo9992vaZwYEORbd96bfbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca9424a9dff105051a61c88ba3ea03b6c8990c28d69e5cb93befc885424809dc","last_reissued_at":"2026-05-18T03:57:27.387418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:27.387418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1272","source_version":2,"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:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rcRyCbE7Byzj2mABtl7wqwylsQit26BBAGh9f3KJ3sr37ou/OahnzTHYuRj3Zmz5rEwlE2Bv2zlLOAr2+axuCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:27:45.226740Z"},"content_sha256":"129f3f066fa66de54c1a5658a19e37718b2ca8d41d9ad6c5591f9b380ca290b0","schema_version":"1.0","event_id":"sha256:129f3f066fa66de54c1a5658a19e37718b2ca8d41d9ad6c5591f9b380ca290b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZKKCJKO76ECQKGTBZCF2H2QDW3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Binary is Good: A Binary Inference Framework for Primary User Separation in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Huy Nguyen, Rong Zheng, Zhu Han","submitted_at":"2010-07-08T01:28:34Z","abstract_excerpt":"Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in the context of collaborative spectrum sensing and monitor selection. In this paper, we model the observations of monitors as boolean OR mixtures of underlying binary latency sources for PUs, and devise a novel binary inference algorithm for PU separation. Simulation results show that without prior knowledge regarding PUs' activities, the algorithm achieves high inference accuracy. An interesting implication of the pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1272","kind":"arxiv","version":2},"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:57:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ha3d4JyzvLuVyR8pg1ufkorYMMXiB/dEqXlRE/vn89MBLUhl66i+sMVH5q/l17cx2UTIKJfwMcpf7osh2gWaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:27:45.227087Z"},"content_sha256":"52428551f99071830ab12df8482352d0857e93928bdabb075252a7bd565b2383","schema_version":"1.0","event_id":"sha256:52428551f99071830ab12df8482352d0857e93928bdabb075252a7bd565b2383"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/bundle.json","state_url":"https://pith.science/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/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-04T00:27:45Z","links":{"resolver":"https://pith.science/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3","bundle":"https://pith.science/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/bundle.json","state":"https://pith.science/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKKCJKO76ECQKGTBZCF2H2QDW3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZKKCJKO76ECQKGTBZCF2H2QDW3","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":"48d2b3ccfc33679ade493c3a6a2e334fe3bb567135490018aa6d00c43d03729b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-08T01:28:34Z","title_canon_sha256":"cfe3cabb5081fbeac8aa91e992ae9a46307aa342e7527f7d84b3a8efd417a56c"},"schema_version":"1.0","source":{"id":"1007.1272","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1272","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1272v2","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1272","created_at":"2026-05-18T03:57:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZKKCJKO76ECQ","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"ZKKCJKO76ECQKGTB","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"ZKKCJKO7","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:52428551f99071830ab12df8482352d0857e93928bdabb075252a7bd565b2383","target":"graph","created_at":"2026-05-18T03:57:27Z","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":"Primary users (PU) separation concerns with the issues of distinguishing and characterizing primary users in cognitive radio (CR) networks. We argue the need for PU separation in the context of collaborative spectrum sensing and monitor selection. In this paper, we model the observations of monitors as boolean OR mixtures of underlying binary latency sources for PUs, and devise a novel binary inference algorithm for PU separation. Simulation results show that without prior knowledge regarding PUs' activities, the algorithm achieves high inference accuracy. An interesting implication of the pro","authors_text":"Huy Nguyen, Rong Zheng, Zhu Han","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-08T01:28:34Z","title":"Binary is Good: A Binary Inference Framework for Primary User Separation in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1272","kind":"arxiv","version":2},"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:129f3f066fa66de54c1a5658a19e37718b2ca8d41d9ad6c5591f9b380ca290b0","target":"record","created_at":"2026-05-18T03:57:27Z","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":"48d2b3ccfc33679ade493c3a6a2e334fe3bb567135490018aa6d00c43d03729b","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-07-08T01:28:34Z","title_canon_sha256":"cfe3cabb5081fbeac8aa91e992ae9a46307aa342e7527f7d84b3a8efd417a56c"},"schema_version":"1.0","source":{"id":"1007.1272","kind":"arxiv","version":2}},"canonical_sha256":"ca9424a9dff105051a61c88ba3ea03b6c8990c28d69e5cb93befc885424809dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca9424a9dff105051a61c88ba3ea03b6c8990c28d69e5cb93befc885424809dc","first_computed_at":"2026-05-18T03:57:27.387418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:27.387418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X+v3mVaOu9SBxcubiVbjgXDpkupUgBbivdaS8hAz40mN+sOa0jQcjWCUNm4XuLMlo9992vaZwYEORbd96bfbAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:27.388057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1272","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:129f3f066fa66de54c1a5658a19e37718b2ca8d41d9ad6c5591f9b380ca290b0","sha256:52428551f99071830ab12df8482352d0857e93928bdabb075252a7bd565b2383"],"state_sha256":"a314a85791aee885cb39e8539de8ac1a58323095f9515a5af478b3ec267d6302"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tHLQWnxYrIhZkhUmA5beXm9dIE/K/uhyFqAB9M8cbbzeGStQ1/ytOaEr5HrswTLGWS2ZNYVrfZ/mIhgwsAUHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:27:45.229035Z","bundle_sha256":"6d73b630c95db141fb74d6b3e56ccd6cc1aae3d058543ad4d9ef2fdac2f095fe"}}