{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GIFBXCNNV6546INGZIU53LMXF2","short_pith_number":"pith:GIFBXCNN","canonical_record":{"source":{"id":"1710.08335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T15:31:32Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"a64d31adca955b8135f9a869a3921fc6a525d1124754c600dfbfcbed10803d74","abstract_canon_sha256":"e1429f05c1fcbfd7b4cf4e298d5d7dd81b025b3a81667c387fb6b5b6adbadd05"},"schema_version":"1.0"},"canonical_sha256":"320a1b89adafbbcf21a6ca29ddad972ebd5273038452fee7b653ca476f594162","source":{"kind":"arxiv","id":"1710.08335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08335","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08335v1","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08335","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"GIFBXCNNV654","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GIFBXCNNV6546ING","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GIFBXCNN","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GIFBXCNNV6546INGZIU53LMXF2","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08335","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T15:31:32Z","cross_cats_sorted":["cs.LG","math.IT"],"title_canon_sha256":"a64d31adca955b8135f9a869a3921fc6a525d1124754c600dfbfcbed10803d74","abstract_canon_sha256":"e1429f05c1fcbfd7b4cf4e298d5d7dd81b025b3a81667c387fb6b5b6adbadd05"},"schema_version":"1.0"},"canonical_sha256":"320a1b89adafbbcf21a6ca29ddad972ebd5273038452fee7b653ca476f594162","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:22.131369Z","signature_b64":"ryllzxYXpWqZvjO+kkX59UyHttuQP8a4v8sbMLyaAnGBgp7GNSbAummg0r/gOocP0xhHIP884iLROtWhWrcmCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320a1b89adafbbcf21a6ca29ddad972ebd5273038452fee7b653ca476f594162","last_reissued_at":"2026-05-18T00:21:22.130680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:22.130680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08335","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETt3MnxUzJbRwiL5ownzHp7UQBFHP8q1fUiBvtTrNoNDlH90j4+kClmvxaN+SQVToPG0Fw/FMJVxU5+7ruzpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:01:01.597834Z"},"content_sha256":"42c6e416802a115689e690a9b406c16f6f994463b0a9889b4dbdd14f611e542d","schema_version":"1.0","event_id":"sha256:42c6e416802a115689e690a9b406c16f6f994463b0a9889b4dbdd14f611e542d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GIFBXCNNV6546INGZIU53LMXF2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constrained Bayesian Active Learning of Interference Channels in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Anestis Tsakmalis, Bj\\\"orn Ottersten, Symeon Chatzinotas","submitted_at":"2017-10-23T15:31:32Z","abstract_excerpt":"In this paper, a sequential probing method for interference constraint learning is proposed to allow a centralized Cognitive Radio Network (CRN) accessing the frequency band of a Primary User (PU) in an underlay cognitive scenario with a designed PU protection specification. The main idea is that the CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire the binary ACK/NACK packet. This feedback indicates whether the probing-induced interference is harmful or not and can be used to learn the PU interference constraint. The cognitive part of this sequential probing process"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08335","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:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlTESpgB8AKcGN1k3QW05AM5vvjvJwduqzhrniOjRnfFGyVUUzG5p+EolWoQNqplMb4bL8PhmdPLVubt5HG7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:01:01.598181Z"},"content_sha256":"7a597950fcca0e9baa9a16c5a9bf8a36ac7694c9558e0fcb17537d8376c3cb0e","schema_version":"1.0","event_id":"sha256:7a597950fcca0e9baa9a16c5a9bf8a36ac7694c9558e0fcb17537d8376c3cb0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIFBXCNNV6546INGZIU53LMXF2/bundle.json","state_url":"https://pith.science/pith/GIFBXCNNV6546INGZIU53LMXF2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIFBXCNNV6546INGZIU53LMXF2/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-03T00:01:01Z","links":{"resolver":"https://pith.science/pith/GIFBXCNNV6546INGZIU53LMXF2","bundle":"https://pith.science/pith/GIFBXCNNV6546INGZIU53LMXF2/bundle.json","state":"https://pith.science/pith/GIFBXCNNV6546INGZIU53LMXF2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIFBXCNNV6546INGZIU53LMXF2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GIFBXCNNV6546INGZIU53LMXF2","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":"e1429f05c1fcbfd7b4cf4e298d5d7dd81b025b3a81667c387fb6b5b6adbadd05","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T15:31:32Z","title_canon_sha256":"a64d31adca955b8135f9a869a3921fc6a525d1124754c600dfbfcbed10803d74"},"schema_version":"1.0","source":{"id":"1710.08335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08335","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08335v1","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08335","created_at":"2026-05-18T00:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"GIFBXCNNV654","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GIFBXCNNV6546ING","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GIFBXCNN","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:7a597950fcca0e9baa9a16c5a9bf8a36ac7694c9558e0fcb17537d8376c3cb0e","target":"graph","created_at":"2026-05-18T00:21:22Z","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 paper, a sequential probing method for interference constraint learning is proposed to allow a centralized Cognitive Radio Network (CRN) accessing the frequency band of a Primary User (PU) in an underlay cognitive scenario with a designed PU protection specification. The main idea is that the CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire the binary ACK/NACK packet. This feedback indicates whether the probing-induced interference is harmful or not and can be used to learn the PU interference constraint. The cognitive part of this sequential probing process","authors_text":"Anestis Tsakmalis, Bj\\\"orn Ottersten, Symeon Chatzinotas","cross_cats":["cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T15:31:32Z","title":"Constrained Bayesian Active Learning of Interference Channels in Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08335","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:42c6e416802a115689e690a9b406c16f6f994463b0a9889b4dbdd14f611e542d","target":"record","created_at":"2026-05-18T00:21:22Z","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":"e1429f05c1fcbfd7b4cf4e298d5d7dd81b025b3a81667c387fb6b5b6adbadd05","cross_cats_sorted":["cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-10-23T15:31:32Z","title_canon_sha256":"a64d31adca955b8135f9a869a3921fc6a525d1124754c600dfbfcbed10803d74"},"schema_version":"1.0","source":{"id":"1710.08335","kind":"arxiv","version":1}},"canonical_sha256":"320a1b89adafbbcf21a6ca29ddad972ebd5273038452fee7b653ca476f594162","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320a1b89adafbbcf21a6ca29ddad972ebd5273038452fee7b653ca476f594162","first_computed_at":"2026-05-18T00:21:22.130680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:22.130680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ryllzxYXpWqZvjO+kkX59UyHttuQP8a4v8sbMLyaAnGBgp7GNSbAummg0r/gOocP0xhHIP884iLROtWhWrcmCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:22.131369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42c6e416802a115689e690a9b406c16f6f994463b0a9889b4dbdd14f611e542d","sha256:7a597950fcca0e9baa9a16c5a9bf8a36ac7694c9558e0fcb17537d8376c3cb0e"],"state_sha256":"85f48e29865537e312875a5367389d8b48db375ca57f05afb3c2edf81125f34f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptLnyxHQe0bQNuFqdrD67Nk8Nu+GZ2d6WQKvbSaKkyJ3DaOvQQJSmf28gBiFiexZGE+SchOwuPQrO/iW48gYAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:01:01.600466Z","bundle_sha256":"1d7192a698afdf1c8c7ace796a70be3ddbf946310db52f1ea1f3cc49980dac27"}}