{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JHLBV2YGRN72PHOZOUAXUJJZTM","short_pith_number":"pith:JHLBV2YG","canonical_record":{"source":{"id":"1905.07143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-17T07:33:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c4bad5da420e3a7da7f9fe4ce5d7a3b7e678f07c561f31c6bdef0f9387f35a4","abstract_canon_sha256":"66af8e514528eb6d8301929eb7f9826545a6dd92b34260cef165c5990ef9a3a1"},"schema_version":"1.0"},"canonical_sha256":"49d61aeb068b7fa79dd975017a25399b0b5f54cef1ebcb3ddd50092d6153bc91","source":{"kind":"arxiv","id":"1905.07143","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07143","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07143v1","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07143","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"JHLBV2YGRN72","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JHLBV2YGRN72PHOZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JHLBV2YG","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JHLBV2YGRN72PHOZOUAXUJJZTM","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07143","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-17T07:33:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3c4bad5da420e3a7da7f9fe4ce5d7a3b7e678f07c561f31c6bdef0f9387f35a4","abstract_canon_sha256":"66af8e514528eb6d8301929eb7f9826545a6dd92b34260cef165c5990ef9a3a1"},"schema_version":"1.0"},"canonical_sha256":"49d61aeb068b7fa79dd975017a25399b0b5f54cef1ebcb3ddd50092d6153bc91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.210609Z","signature_b64":"O8BTmPGaKLc2hAqo/HxFfa+OVOgrQaBRj1nJklwcmsExvpoUGoJImy0hne5t1lpcOVWsJB4QT1jn0BQO3TPFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49d61aeb068b7fa79dd975017a25399b0b5f54cef1ebcb3ddd50092d6153bc91","last_reissued_at":"2026-05-17T23:45:57.210113Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.210113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07143","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5o6sHG322FMqMFT0+zTYVp1EQCS1mv3EnwMxf8MhUugQZnhYfE71jOtAcGWeYWhO/jYidJsSzdSdBsHI7jEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:06.706969Z"},"content_sha256":"6b083a90444d61de54862f18da5b711c5be03989d99530fe9b1034544e6cdad5","schema_version":"1.0","event_id":"sha256:6b083a90444d61de54862f18da5b711c5be03989d99530fe9b1034544e6cdad5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JHLBV2YGRN72PHOZOUAXUJJZTM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Buffer-aided Resource Allocation for a Price Based Opportunistic Cognitive Radio Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Goutam Das, Nilanjan Biswas, Priyadip Ray","submitted_at":"2019-05-17T07:33:14Z","abstract_excerpt":"In this paper, a resource allocation problem for an opportunistic cooperative cognitive radio network is considered, where cognitive radio nodes send their hard decisions to the fusion center. The fusion center plays dual role, i.e., takes the global decision (i.e., decision about the primary user's activity) as well as allocates transmission time durations among cognitive radio nodes. Revenue based utility functions are considered at the fusion center and cognitive radio nodes. An optimization problem is formulated to maximize the fusion center's revenue while satisfying some well defined con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07143","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-17T23:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lREGmKW/N1bhIoMB0DsPpuEw/AWhFXuUiL5Nuyz4ngUr8wyP0BQMUp3fJ/lKM3Djc6c/6MOvnMXd6fYLG/G9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:33:06.707328Z"},"content_sha256":"762b5f7949b4952804925a64342acc7103757a9ffe73cfa663fe6962a22be5ce","schema_version":"1.0","event_id":"sha256:762b5f7949b4952804925a64342acc7103757a9ffe73cfa663fe6962a22be5ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/bundle.json","state_url":"https://pith.science/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/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-03T01:33:06Z","links":{"resolver":"https://pith.science/pith/JHLBV2YGRN72PHOZOUAXUJJZTM","bundle":"https://pith.science/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/bundle.json","state":"https://pith.science/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHLBV2YGRN72PHOZOUAXUJJZTM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JHLBV2YGRN72PHOZOUAXUJJZTM","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":"66af8e514528eb6d8301929eb7f9826545a6dd92b34260cef165c5990ef9a3a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-17T07:33:14Z","title_canon_sha256":"3c4bad5da420e3a7da7f9fe4ce5d7a3b7e678f07c561f31c6bdef0f9387f35a4"},"schema_version":"1.0","source":{"id":"1905.07143","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07143","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07143v1","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07143","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"JHLBV2YGRN72","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JHLBV2YGRN72PHOZ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JHLBV2YG","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:762b5f7949b4952804925a64342acc7103757a9ffe73cfa663fe6962a22be5ce","target":"graph","created_at":"2026-05-17T23:45:57Z","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 resource allocation problem for an opportunistic cooperative cognitive radio network is considered, where cognitive radio nodes send their hard decisions to the fusion center. The fusion center plays dual role, i.e., takes the global decision (i.e., decision about the primary user's activity) as well as allocates transmission time durations among cognitive radio nodes. Revenue based utility functions are considered at the fusion center and cognitive radio nodes. An optimization problem is formulated to maximize the fusion center's revenue while satisfying some well defined con","authors_text":"Goutam Das, Nilanjan Biswas, Priyadip Ray","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-17T07:33:14Z","title":"Buffer-aided Resource Allocation for a Price Based Opportunistic Cognitive Radio Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07143","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:6b083a90444d61de54862f18da5b711c5be03989d99530fe9b1034544e6cdad5","target":"record","created_at":"2026-05-17T23:45:57Z","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":"66af8e514528eb6d8301929eb7f9826545a6dd92b34260cef165c5990ef9a3a1","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-05-17T07:33:14Z","title_canon_sha256":"3c4bad5da420e3a7da7f9fe4ce5d7a3b7e678f07c561f31c6bdef0f9387f35a4"},"schema_version":"1.0","source":{"id":"1905.07143","kind":"arxiv","version":1}},"canonical_sha256":"49d61aeb068b7fa79dd975017a25399b0b5f54cef1ebcb3ddd50092d6153bc91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49d61aeb068b7fa79dd975017a25399b0b5f54cef1ebcb3ddd50092d6153bc91","first_computed_at":"2026-05-17T23:45:57.210113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.210113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O8BTmPGaKLc2hAqo/HxFfa+OVOgrQaBRj1nJklwcmsExvpoUGoJImy0hne5t1lpcOVWsJB4QT1jn0BQO3TPFDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.210609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07143","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6b083a90444d61de54862f18da5b711c5be03989d99530fe9b1034544e6cdad5","sha256:762b5f7949b4952804925a64342acc7103757a9ffe73cfa663fe6962a22be5ce"],"state_sha256":"06e8f79e6d877f375e44eaf1dffd875e16d3e8edc075dab502b06d0031e90eee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yRhtNJ+42SwtPK4VbRXYTUP/Pb3zP0xsN5Go6Kp/rkC6EiEh5D7aoluxeuOMIICu0ic8/tU0YvCedHpxmPzaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:33:06.709386Z","bundle_sha256":"77183a064127cb5a5b76409dcec32be8adf99fbe611837fea9a18353023081e3"}}