{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:26PZZCAHL5EPKNQR5A2USHPZWQ","short_pith_number":"pith:26PZZCAH","canonical_record":{"source":{"id":"1104.5553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7f8d2c5a092e2d9cf693c8375cb4fb6a865c2e5ac90bbadb2dd1655801f6a98","abstract_canon_sha256":"3d60e4778d7cd33edf9c20bfe66d1d1c66085a59af0f8995ecd246971b896372"},"schema_version":"1.0"},"canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","source":{"kind":"arxiv","id":"1104.5553","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5553","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5553v3","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5553","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"26PZZCAHL5EP","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"26PZZCAHL5EPKNQR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"26PZZCAH","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:26PZZCAHL5EPKNQR5A2USHPZWQ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5553","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"a7f8d2c5a092e2d9cf693c8375cb4fb6a865c2e5ac90bbadb2dd1655801f6a98","abstract_canon_sha256":"3d60e4778d7cd33edf9c20bfe66d1d1c66085a59af0f8995ecd246971b896372"},"schema_version":"1.0"},"canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:33.203457Z","signature_b64":"LM+UHmt76lQ6D58BHNVjq5kADcLPUnTmSWBube5Ct4M6TlLbROVDrt89S7lPLd3Q2zpiy+h2f0QzAnnSSb3YAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","last_reissued_at":"2026-05-18T04:06:33.202676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:33.202676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5553","source_version":3,"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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g39GoQbgFsXMsj1TaTh92MKCIan3zQKXW/Chw7N1F3STbEKGr6YM4CSRgxai6oEtMEWvkcO4k2qhpeGz7jtFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:33:27.692165Z"},"content_sha256":"2e7e1ef8f3fd98ec113256c827f46550319e36e8c4c17f9713cd214e4737ff4d","schema_version":"1.0","event_id":"sha256:2e7e1ef8f3fd98ec113256c827f46550319e36e8c4c17f9713cd214e4737ff4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:26PZZCAHL5EPKNQR5A2USHPZWQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation for Selection-Based Cooperative OFDM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Kianoush Hosseini, Raviraj S. Adve","submitted_at":"2011-04-29T06:11:47Z","abstract_excerpt":"This paper considers resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of transmission strategy selection, relay assignment, and power allocation is a combinatorial problem with exponential complexity. To develop effective solutions to these questions, we approach these problems in two stages. The first set of problems assume ideal source-relay channels; this simplification helps illustrate our general methodology and also why our solutio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5553","kind":"arxiv","version":3},"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-18T04:06:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkgko2yChjgqTSUcDuYgkIUd7DiV9kqrbC0/w7nZ4skiuT4tt6ZeC4tiCzqjdfyyVANyvydFuUAR4G3sHpWMBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:33:27.692532Z"},"content_sha256":"5639d7681a590b567ef17f636efadc9c43bc8a04542cffdc327635479fa8feac","schema_version":"1.0","event_id":"sha256:5639d7681a590b567ef17f636efadc9c43bc8a04542cffdc327635479fa8feac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/bundle.json","state_url":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/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-04T19:33:27Z","links":{"resolver":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ","bundle":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/bundle.json","state":"https://pith.science/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26PZZCAHL5EPKNQR5A2USHPZWQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:26PZZCAHL5EPKNQR5A2USHPZWQ","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":"3d60e4778d7cd33edf9c20bfe66d1d1c66085a59af0f8995ecd246971b896372","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","title_canon_sha256":"a7f8d2c5a092e2d9cf693c8375cb4fb6a865c2e5ac90bbadb2dd1655801f6a98"},"schema_version":"1.0","source":{"id":"1104.5553","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5553","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5553v3","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5553","created_at":"2026-05-18T04:06:33Z"},{"alias_kind":"pith_short_12","alias_value":"26PZZCAHL5EP","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"26PZZCAHL5EPKNQR","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"26PZZCAH","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:5639d7681a590b567ef17f636efadc9c43bc8a04542cffdc327635479fa8feac","target":"graph","created_at":"2026-05-18T04:06:33Z","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 resource allocation to achieve max-min fairness in a selection-based orthogonal frequency division multiplexing network wherein source nodes are assisted by fixed decode-and-forward relays. The joint problem of transmission strategy selection, relay assignment, and power allocation is a combinatorial problem with exponential complexity. To develop effective solutions to these questions, we approach these problems in two stages. The first set of problems assume ideal source-relay channels; this simplification helps illustrate our general methodology and also why our solutio","authors_text":"Kianoush Hosseini, Raviraj S. Adve","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","title":"Resource Allocation for Selection-Based Cooperative OFDM Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5553","kind":"arxiv","version":3},"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:2e7e1ef8f3fd98ec113256c827f46550319e36e8c4c17f9713cd214e4737ff4d","target":"record","created_at":"2026-05-18T04:06:33Z","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":"3d60e4778d7cd33edf9c20bfe66d1d1c66085a59af0f8995ecd246971b896372","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-04-29T06:11:47Z","title_canon_sha256":"a7f8d2c5a092e2d9cf693c8375cb4fb6a865c2e5ac90bbadb2dd1655801f6a98"},"schema_version":"1.0","source":{"id":"1104.5553","kind":"arxiv","version":3}},"canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d79f9c88075f48f53611e835491df9b42c0b97b31c8229dbf82c2d9447350bea","first_computed_at":"2026-05-18T04:06:33.202676Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:33.202676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LM+UHmt76lQ6D58BHNVjq5kADcLPUnTmSWBube5Ct4M6TlLbROVDrt89S7lPLd3Q2zpiy+h2f0QzAnnSSb3YAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:33.203457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5553","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7e1ef8f3fd98ec113256c827f46550319e36e8c4c17f9713cd214e4737ff4d","sha256:5639d7681a590b567ef17f636efadc9c43bc8a04542cffdc327635479fa8feac"],"state_sha256":"7a4d6df6cb3559fa996008a0613ccb22d273301b59b562d15116213607e83a7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DRE4B0CU3kCgGnxpyJyDbRkE+aCwKic/T06qaeX9oMUO3SV6NtkLa0OXnZZQ+HMgC3BSe9SMQkAwldmwMx24Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:33:27.694571Z","bundle_sha256":"809cc24a6f16159cffa6ec0797d84755288d6fd3770631880ff0517cb9f04cc7"}}