{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H6OFE7AN6RMZKJCLEE365AJ6RI","short_pith_number":"pith:H6OFE7AN","canonical_record":{"source":{"id":"1204.2651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-12T08:14:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d651154d1e9723800ce5ba9e544fbfd4997e4c607759e02ab978381f9e1a027","abstract_canon_sha256":"6d260ac59e4962252ceaa6967683a7e93d3430e5680442a76a784e98961bddd2"},"schema_version":"1.0"},"canonical_sha256":"3f9c527c0df45995244b2137ee813e8a0fda07ae7676fab9d7cca001d63459c4","source":{"kind":"arxiv","id":"1204.2651","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2651","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2651v1","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2651","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"H6OFE7AN6RMZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6OFE7AN6RMZKJCL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6OFE7AN","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H6OFE7AN6RMZKJCLEE365AJ6RI","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2651","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-12T08:14:51Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6d651154d1e9723800ce5ba9e544fbfd4997e4c607759e02ab978381f9e1a027","abstract_canon_sha256":"6d260ac59e4962252ceaa6967683a7e93d3430e5680442a76a784e98961bddd2"},"schema_version":"1.0"},"canonical_sha256":"3f9c527c0df45995244b2137ee813e8a0fda07ae7676fab9d7cca001d63459c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:53.232382Z","signature_b64":"1fGWeKC34aXxrr1aiY5LDiTTTdCM5ksUSFY8klNtbJWNUiJo5YqDkX4Gj8Li0C4Xh4FN7B/pB1SMOOwSQMEQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f9c527c0df45995244b2137ee813e8a0fda07ae7676fab9d7cca001d63459c4","last_reissued_at":"2026-05-18T01:57:53.231984Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:53.231984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2651","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-18T01:57:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0/vwHMl1hVL4PQ8bDPlaLM8MFcOLRTlsALVF+5Na99msCDj90gFM1cpX3x35gPiRjBp223R7KD/iBfcdt5ZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:50.949088Z"},"content_sha256":"636b238bf1b524ad31fbdf2645c74afadf80abe0cdccac1427d53abe0b618836","schema_version":"1.0","event_id":"sha256:636b238bf1b524ad31fbdf2645c74afadf80abe0cdccac1427d53abe0b618836"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H6OFE7AN6RMZKJCLEE365AJ6RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cooperative Cognitive Networks: Optimal, Distributed and Low-Complexity Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Bjorn Ottersten, Gan Zheng, Kai-Kit Wong, S. H. Song","submitted_at":"2012-04-12T08:14:51Z","abstract_excerpt":"This paper considers the cooperation between a cognitive system and a primary system where multiple cognitive base stations (CBSs) relay the primary user's (PU) signals in exchange for more opportunity to transmit their own signals. The CBSs use amplify-and-forward (AF) relaying and coordinated beamforming to relay the primary signals and transmit their own signals. The objective is to minimize the overall transmit power of the CBSs given the rate requirements of the PU and the cognitive users (CUs). We show that the relaying matrices have unit rank and perform two functions: Matched filter re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2651","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-18T01:57:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbRcUOiLiX+27W+sAmD08L3XJOFIhStBqDyv+tlnqxMcx380gjzZwDUGNYWEnTpaAIpYoqQpgHx19fnSXFb0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:33:50.949482Z"},"content_sha256":"78d33462ea81b4fe9bb92d551a89df0646cc549e6213896d58ee17f8c7464d3a","schema_version":"1.0","event_id":"sha256:78d33462ea81b4fe9bb92d551a89df0646cc549e6213896d58ee17f8c7464d3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/bundle.json","state_url":"https://pith.science/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/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-07T18:33:50Z","links":{"resolver":"https://pith.science/pith/H6OFE7AN6RMZKJCLEE365AJ6RI","bundle":"https://pith.science/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/bundle.json","state":"https://pith.science/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6OFE7AN6RMZKJCLEE365AJ6RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H6OFE7AN6RMZKJCLEE365AJ6RI","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":"6d260ac59e4962252ceaa6967683a7e93d3430e5680442a76a784e98961bddd2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-12T08:14:51Z","title_canon_sha256":"6d651154d1e9723800ce5ba9e544fbfd4997e4c607759e02ab978381f9e1a027"},"schema_version":"1.0","source":{"id":"1204.2651","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2651","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2651v1","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2651","created_at":"2026-05-18T01:57:53Z"},{"alias_kind":"pith_short_12","alias_value":"H6OFE7AN6RMZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H6OFE7AN6RMZKJCL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H6OFE7AN","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:78d33462ea81b4fe9bb92d551a89df0646cc549e6213896d58ee17f8c7464d3a","target":"graph","created_at":"2026-05-18T01:57:53Z","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":"This paper considers the cooperation between a cognitive system and a primary system where multiple cognitive base stations (CBSs) relay the primary user's (PU) signals in exchange for more opportunity to transmit their own signals. The CBSs use amplify-and-forward (AF) relaying and coordinated beamforming to relay the primary signals and transmit their own signals. The objective is to minimize the overall transmit power of the CBSs given the rate requirements of the PU and the cognitive users (CUs). We show that the relaying matrices have unit rank and perform two functions: Matched filter re","authors_text":"Bjorn Ottersten, Gan Zheng, Kai-Kit Wong, S. H. Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-12T08:14:51Z","title":"Cooperative Cognitive Networks: Optimal, Distributed and Low-Complexity Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2651","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:636b238bf1b524ad31fbdf2645c74afadf80abe0cdccac1427d53abe0b618836","target":"record","created_at":"2026-05-18T01:57:53Z","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":"6d260ac59e4962252ceaa6967683a7e93d3430e5680442a76a784e98961bddd2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-04-12T08:14:51Z","title_canon_sha256":"6d651154d1e9723800ce5ba9e544fbfd4997e4c607759e02ab978381f9e1a027"},"schema_version":"1.0","source":{"id":"1204.2651","kind":"arxiv","version":1}},"canonical_sha256":"3f9c527c0df45995244b2137ee813e8a0fda07ae7676fab9d7cca001d63459c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f9c527c0df45995244b2137ee813e8a0fda07ae7676fab9d7cca001d63459c4","first_computed_at":"2026-05-18T01:57:53.231984Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:57:53.231984Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1fGWeKC34aXxrr1aiY5LDiTTTdCM5ksUSFY8klNtbJWNUiJo5YqDkX4Gj8Li0C4Xh4FN7B/pB1SMOOwSQMEQAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:57:53.232382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2651","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:636b238bf1b524ad31fbdf2645c74afadf80abe0cdccac1427d53abe0b618836","sha256:78d33462ea81b4fe9bb92d551a89df0646cc549e6213896d58ee17f8c7464d3a"],"state_sha256":"144fb5d3d27822ac29fbb8b538eb03686831efe52a0a1e37aecae0c7b7a8b517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QaULu8jWKqcuVXrnLzegF+uGUp7ww+Gqt23Yy1kWlhUa5smZigUCYoK8zOzzoUr2q8eb5uxDo+HUdFu2/ygjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:33:50.951650Z","bundle_sha256":"793d8fd53e78dbdcec9731e712ceb6e3b81640143482fa5b55d15b1b4d267fdc"}}