{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DABZ2WWATFE2VBVWAYFFPKNKGC","short_pith_number":"pith:DABZ2WWA","canonical_record":{"source":{"id":"1310.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T08:55:46Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.IT"],"title_canon_sha256":"b2300282cca576c52af75b2394b22302d2257201c97acd7d25b28817f721f22c","abstract_canon_sha256":"a64a9a03955649c346eebe9382ecb4c933ffead5acd650bfba43b57d2602e8c4"},"schema_version":"1.0"},"canonical_sha256":"18039d5ac09949aa86b6060a57a9aa30996c9c13cdfe3597a86f3b0da60f611e","source":{"kind":"arxiv","id":"1310.5468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5468","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5468v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5468","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"DABZ2WWATFE2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DABZ2WWATFE2VBVW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DABZ2WWA","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DABZ2WWATFE2VBVWAYFFPKNKGC","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T08:55:46Z","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.IT"],"title_canon_sha256":"b2300282cca576c52af75b2394b22302d2257201c97acd7d25b28817f721f22c","abstract_canon_sha256":"a64a9a03955649c346eebe9382ecb4c933ffead5acd650bfba43b57d2602e8c4"},"schema_version":"1.0"},"canonical_sha256":"18039d5ac09949aa86b6060a57a9aa30996c9c13cdfe3597a86f3b0da60f611e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:35.555155Z","signature_b64":"aTe/WgsNuz5BifWIe1RN7PSS33MkOt8KNs4sDoPxNJAEJG2iM+m7aBWI8RPZGOGBC4EDY40BJf0OcjhYT6qyBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18039d5ac09949aa86b6060a57a9aa30996c9c13cdfe3597a86f3b0da60f611e","last_reissued_at":"2026-05-18T03:09:35.554379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:35.554379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5468","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-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ReaQZ9bPWx1Ga00cxtu0ym9XMvcYCg7IvA3ToxjLFiYCgiIBSxBGsXcpRbrlougdeVfhvdEUif5hGPqT4A52Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:19:05.402679Z"},"content_sha256":"b58ce8d662ab495be83e79c6d49cedc547b15b3d8a9786f4974e5d14384d197c","schema_version":"1.0","event_id":"sha256:b58ce8d662ab495be83e79c6d49cedc547b15b3d8a9786f4974e5d14384d197c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DABZ2WWATFE2VBVWAYFFPKNKGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms for Optimal Utilization of Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"David Saad, Georgios Rodolakis, Hamed Mahmoudi, Leonidas Georgiadis","submitted_at":"2013-10-21T08:55:46Z","abstract_excerpt":"Cognitive Radio has been proposed as a key technology to significantly improve spectrum usage in wireless networks by enabling unlicensed users to access unused resource. We present new algorithms that are needed for the implementation of opportunistic scheduling policies that maximize the throughput utilization of resources by secondary users, under maximum interference constraints imposed by existing primary users. Our approach is based on the Belief Propagation (BP) algorithm, which is advantageous due to its simplicity and potential for distributed implementation. We examine convergence pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5468","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-18T03:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b/hyQp/rxeVAgAGbkeHwmyvbT8muXeu5HCv20h1BGrJ83dbo9SOuycXl9J4c97+CIjELeA7W3x1OIfwX/Ma5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:19:05.403037Z"},"content_sha256":"5c454d8c1ccff0c9ab750db1adfdb4da816b877470b6e2346354b7ee7e1bff0b","schema_version":"1.0","event_id":"sha256:5c454d8c1ccff0c9ab750db1adfdb4da816b877470b6e2346354b7ee7e1bff0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/bundle.json","state_url":"https://pith.science/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/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-11T10:19:05Z","links":{"resolver":"https://pith.science/pith/DABZ2WWATFE2VBVWAYFFPKNKGC","bundle":"https://pith.science/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/bundle.json","state":"https://pith.science/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DABZ2WWATFE2VBVWAYFFPKNKGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DABZ2WWATFE2VBVWAYFFPKNKGC","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":"a64a9a03955649c346eebe9382ecb4c933ffead5acd650bfba43b57d2602e8c4","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T08:55:46Z","title_canon_sha256":"b2300282cca576c52af75b2394b22302d2257201c97acd7d25b28817f721f22c"},"schema_version":"1.0","source":{"id":"1310.5468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5468","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5468v1","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5468","created_at":"2026-05-18T03:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"DABZ2WWATFE2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DABZ2WWATFE2VBVW","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DABZ2WWA","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:5c454d8c1ccff0c9ab750db1adfdb4da816b877470b6e2346354b7ee7e1bff0b","target":"graph","created_at":"2026-05-18T03:09:35Z","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":"Cognitive Radio has been proposed as a key technology to significantly improve spectrum usage in wireless networks by enabling unlicensed users to access unused resource. We present new algorithms that are needed for the implementation of opportunistic scheduling policies that maximize the throughput utilization of resources by secondary users, under maximum interference constraints imposed by existing primary users. Our approach is based on the Belief Propagation (BP) algorithm, which is advantageous due to its simplicity and potential for distributed implementation. We examine convergence pr","authors_text":"David Saad, Georgios Rodolakis, Hamed Mahmoudi, Leonidas Georgiadis","cross_cats":["cond-mat.stat-mech","cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T08:55:46Z","title":"Message-Passing Algorithms for Optimal Utilization of Cognitive Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5468","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:b58ce8d662ab495be83e79c6d49cedc547b15b3d8a9786f4974e5d14384d197c","target":"record","created_at":"2026-05-18T03:09:35Z","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":"a64a9a03955649c346eebe9382ecb4c933ffead5acd650bfba43b57d2602e8c4","cross_cats_sorted":["cond-mat.stat-mech","cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-10-21T08:55:46Z","title_canon_sha256":"b2300282cca576c52af75b2394b22302d2257201c97acd7d25b28817f721f22c"},"schema_version":"1.0","source":{"id":"1310.5468","kind":"arxiv","version":1}},"canonical_sha256":"18039d5ac09949aa86b6060a57a9aa30996c9c13cdfe3597a86f3b0da60f611e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18039d5ac09949aa86b6060a57a9aa30996c9c13cdfe3597a86f3b0da60f611e","first_computed_at":"2026-05-18T03:09:35.554379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:35.554379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aTe/WgsNuz5BifWIe1RN7PSS33MkOt8KNs4sDoPxNJAEJG2iM+m7aBWI8RPZGOGBC4EDY40BJf0OcjhYT6qyBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:35.555155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b58ce8d662ab495be83e79c6d49cedc547b15b3d8a9786f4974e5d14384d197c","sha256:5c454d8c1ccff0c9ab750db1adfdb4da816b877470b6e2346354b7ee7e1bff0b"],"state_sha256":"7aa598ee8d14fbf04c9af4db0ceb2490f3c50903cc5eef3d3dc75815d2f2842c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UDFLd1Q0XzhzAXTMA0+M5S+KgnNGzpPLVRbv33TqCF0ku2z8SrF1+WIZBVR2yi6+BPV0+rxSVicKSkLsOcUBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:19:05.405031Z","bundle_sha256":"ff96f4528f0bdb096b5bcf02677a5235017975938ea027605c9181fe6c5f8568"}}