{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IANRYCSMVRU3PNGBS2X2K5P6Q2","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":"88736ab7ebc757f6beec19d7bd7b31b70e58945b75521023d0c370804875a264","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T12:14:19Z","title_canon_sha256":"5b6946d762b61f804dde3a3751e2c4a01e97612b4fa45cb3fd17cc0931a2c1a3"},"schema_version":"1.0","source":{"id":"1301.2941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2941","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2941v1","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2941","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"IANRYCSMVRU3","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IANRYCSMVRU3PNGB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IANRYCSM","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:6ad261b87c315bf4d986bdd0c861dd1e703e5f2a26c74efb0aa0c7857b0465ff","target":"graph","created_at":"2026-05-18T00:59:04Z","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 develops a sum-power minimized resource allocation (RA) algorithm subject to a sum-rate constraint for cooperative orthogonal frequency division modulation (OFDM) transmission with subcarrier-pair based opportunistic decode-and-forward (DF) relaying. The improved DF protocol first proposed in [1] is used with optimized subcarrier pairing. Instrumental to the RA algorithm design is appropriate definition of variables to represent source/relay power allocation, subcarrier pairing and transmission-mode selection elegantly, so that after continuous relaxation, the dual method and the Hu","authors_text":"Luc Vandendorpe, Tao Wang, Yong Fang","cross_cats":["cs.NI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T12:14:19Z","title":"Power minimization for OFDM Transmission with Subcarrier-pair based Opportunistic DF Relaying"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2941","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:0cc4d954f472a8dc37110a132b1263e8bb0884a81df0e55a28215e3b79cbda78","target":"record","created_at":"2026-05-18T00:59:04Z","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":"88736ab7ebc757f6beec19d7bd7b31b70e58945b75521023d0c370804875a264","cross_cats_sorted":["cs.NI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-14T12:14:19Z","title_canon_sha256":"5b6946d762b61f804dde3a3751e2c4a01e97612b4fa45cb3fd17cc0931a2c1a3"},"schema_version":"1.0","source":{"id":"1301.2941","kind":"arxiv","version":1}},"canonical_sha256":"401b1c0a4cac69b7b4c196afa575fe869e3db9dcfac1d2447fa07c76cd0816d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"401b1c0a4cac69b7b4c196afa575fe869e3db9dcfac1d2447fa07c76cd0816d0","first_computed_at":"2026-05-18T00:59:04.526523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.526523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pd0HW3sJ1l9Ft70s1DIO6kLqB1nhwPuhtPkDKdt0DcvB9zuEARMPhwCJxXQsQZGfU4gPiUzl/ytGYPPxayThBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.527241Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cc4d954f472a8dc37110a132b1263e8bb0884a81df0e55a28215e3b79cbda78","sha256:6ad261b87c315bf4d986bdd0c861dd1e703e5f2a26c74efb0aa0c7857b0465ff"],"state_sha256":"aa47b93420c27e2e01fa95f497ca61395fa7c1b34f1dbe9ab39641fd9a1d5304"}