{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WW7WOENXRN3BK372TVT3EAK5AK","short_pith_number":"pith:WW7WOENX","canonical_record":{"source":{"id":"1212.2752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-12T09:59:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4c0e28969ed34d2ed9398df214a71d1a33b1537cedb9138863ac899f49a1ceb","abstract_canon_sha256":"e56bd480d2397941b73ee0bbd841a5aebe37c2db646bf70be9992730dfa1e035"},"schema_version":"1.0"},"canonical_sha256":"b5bf6711b78b76156ffa9d67b2015d0292cffa121f06dfea35c0827fa38192e7","source":{"kind":"arxiv","id":"1212.2752","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2752","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2752v2","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2752","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"WW7WOENXRN3B","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WW7WOENXRN3BK372","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WW7WOENX","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WW7WOENXRN3BK372TVT3EAK5AK","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2752","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-12T09:59:03Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f4c0e28969ed34d2ed9398df214a71d1a33b1537cedb9138863ac899f49a1ceb","abstract_canon_sha256":"e56bd480d2397941b73ee0bbd841a5aebe37c2db646bf70be9992730dfa1e035"},"schema_version":"1.0"},"canonical_sha256":"b5bf6711b78b76156ffa9d67b2015d0292cffa121f06dfea35c0827fa38192e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:09.435385Z","signature_b64":"BHk5g+YoOZ64ZlNKChu5nMlHkdyoPty6o7pWrhBjJgEf1pPbxaMMR+EeOsrQb5sTfqbtzZ7Pl3lqC0w4q4hXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5bf6711b78b76156ffa9d67b2015d0292cffa121f06dfea35c0827fa38192e7","last_reissued_at":"2026-05-18T03:20:09.434810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:09.434810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2752","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:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnaFwRLnKSbtl17BJinrSuhDstwBBf3pErPtuMMdrwpTntySr2p1X0jd9qjRhG6zhzq9lDhbAnbpqqnwGBjrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:38:53.101185Z"},"content_sha256":"f6cfcf0f79e42e2beed4ac8bf7d95013cd2ab66ce7c6ffc374b8b2d05ce82017","schema_version":"1.0","event_id":"sha256:f6cfcf0f79e42e2beed4ac8bf7d95013cd2ab66ce7c6ffc374b8b2d05ce82017"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WW7WOENXRN3BK372TVT3EAK5AK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secondary Resource Allocation for Opportunistic Spectrum Sharing with IR-HARQ based Primary Users","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charly Poulliat, Inbar Fijalkow, Romain Tajan","submitted_at":"2012-12-12T09:59:03Z","abstract_excerpt":"We propose to address the problem of a secondary resource allocation when a primary Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) protocol. The Secondary Users (SUs) intend to use their knowledge of the IR-HARQ protocol to maximize their long-term throughput under a constraint of minimal Primary Users (PUs) throughput. The ACcumulated Mutual Information (ACMI), required to model the primary IR-HARQ protocol, is used to define a Constrained Markov Decision Process (CMDP). The SUs resource allocation is then shown to be a solution of this CMDP. The allocation problem is then c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2752","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:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6dhjDxpb4tq3CNO+2F0WJnXw1cBOBQsh/hCNvYC7qDiJjB7vOWpbhxIkmsgYT0VTBKtPEwyeduw3OnjOfzcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T06:38:53.101534Z"},"content_sha256":"1ef0a40b5b74692b7b674059dc3972503ffe2fe0980b1597a4d9227f8b46a6d2","schema_version":"1.0","event_id":"sha256:1ef0a40b5b74692b7b674059dc3972503ffe2fe0980b1597a4d9227f8b46a6d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WW7WOENXRN3BK372TVT3EAK5AK/bundle.json","state_url":"https://pith.science/pith/WW7WOENXRN3BK372TVT3EAK5AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WW7WOENXRN3BK372TVT3EAK5AK/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-27T06:38:53Z","links":{"resolver":"https://pith.science/pith/WW7WOENXRN3BK372TVT3EAK5AK","bundle":"https://pith.science/pith/WW7WOENXRN3BK372TVT3EAK5AK/bundle.json","state":"https://pith.science/pith/WW7WOENXRN3BK372TVT3EAK5AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WW7WOENXRN3BK372TVT3EAK5AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WW7WOENXRN3BK372TVT3EAK5AK","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":"e56bd480d2397941b73ee0bbd841a5aebe37c2db646bf70be9992730dfa1e035","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-12T09:59:03Z","title_canon_sha256":"f4c0e28969ed34d2ed9398df214a71d1a33b1537cedb9138863ac899f49a1ceb"},"schema_version":"1.0","source":{"id":"1212.2752","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2752","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2752v2","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2752","created_at":"2026-05-18T03:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"WW7WOENXRN3B","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"WW7WOENXRN3BK372","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"WW7WOENX","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:1ef0a40b5b74692b7b674059dc3972503ffe2fe0980b1597a4d9227f8b46a6d2","target":"graph","created_at":"2026-05-18T03:20:09Z","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":"We propose to address the problem of a secondary resource allocation when a primary Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) protocol. The Secondary Users (SUs) intend to use their knowledge of the IR-HARQ protocol to maximize their long-term throughput under a constraint of minimal Primary Users (PUs) throughput. The ACcumulated Mutual Information (ACMI), required to model the primary IR-HARQ protocol, is used to define a Constrained Markov Decision Process (CMDP). The SUs resource allocation is then shown to be a solution of this CMDP. The allocation problem is then c","authors_text":"Charly Poulliat, Inbar Fijalkow, Romain Tajan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-12T09:59:03Z","title":"Secondary Resource Allocation for Opportunistic Spectrum Sharing with IR-HARQ based Primary Users"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2752","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:f6cfcf0f79e42e2beed4ac8bf7d95013cd2ab66ce7c6ffc374b8b2d05ce82017","target":"record","created_at":"2026-05-18T03:20:09Z","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":"e56bd480d2397941b73ee0bbd841a5aebe37c2db646bf70be9992730dfa1e035","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-12-12T09:59:03Z","title_canon_sha256":"f4c0e28969ed34d2ed9398df214a71d1a33b1537cedb9138863ac899f49a1ceb"},"schema_version":"1.0","source":{"id":"1212.2752","kind":"arxiv","version":2}},"canonical_sha256":"b5bf6711b78b76156ffa9d67b2015d0292cffa121f06dfea35c0827fa38192e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5bf6711b78b76156ffa9d67b2015d0292cffa121f06dfea35c0827fa38192e7","first_computed_at":"2026-05-18T03:20:09.434810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:09.434810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BHk5g+YoOZ64ZlNKChu5nMlHkdyoPty6o7pWrhBjJgEf1pPbxaMMR+EeOsrQb5sTfqbtzZ7Pl3lqC0w4q4hXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:09.435385Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2752","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6cfcf0f79e42e2beed4ac8bf7d95013cd2ab66ce7c6ffc374b8b2d05ce82017","sha256:1ef0a40b5b74692b7b674059dc3972503ffe2fe0980b1597a4d9227f8b46a6d2"],"state_sha256":"a7963eb46c8c947a06bee454316746b103a3990436bd1403a2de89a9a3fc37c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBKjtCoEt2FDlYPPe0MtB5dMaIZI1Ctuw6ULgk+3wrScDemznY092TvVzDLYM7IVNXCW7QROdr3ivQ2fALSACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T06:38:53.103389Z","bundle_sha256":"ed5ed3aefc5e43d5d501f171d592917388a675c7f0190c543fc906c66a55dc89"}}