{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W74F3FNNKEKGSKUNY6WBENSZU2","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":"14db928748e0e46a78bc99e84458693449b05975a767f7f27e5a76454259e89d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T12:18:54Z","title_canon_sha256":"757cd583fc2a3868bf58ec7aa4136020cf86bb2754cd34b187f29755c95a373c"},"schema_version":"1.0","source":{"id":"1304.7971","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.7971","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"1304.7971v2","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7971","created_at":"2026-05-18T03:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"W74F3FNNKEKG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W74F3FNNKEKGSKUN","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W74F3FNN","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:2e714dcfb47f670b8f29db73670b06e1f4745cd6f8d86135bf64840678ce2c2c","target":"graph","created_at":"2026-05-18T03:21:11Z","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, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not present. In this network, there exist six possible transmission modes: four point-to-point modes (user 1-to-relay, user 2-to-relay, relay-to-user 1, relay-to-user 2), a multiple access mode (both users to the relay), and a broadcast mode (the relay to both users). Most existing protocols assume a fixed schedule of using a subset of the aforementioned transmis","authors_text":"Aissa Ikhlef, Nikola Zlatanov, Robert Schober, Vahid Jamali","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T12:18:54Z","title":"Adaptive Mode Selection and Power Allocation in Bidirectional Buffer-aided Relay Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7971","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:a7816c41c25d8f8ba0effe9e3c4b2fc92fbc9c52872146737710fe8bdc3b38c2","target":"record","created_at":"2026-05-18T03:21:11Z","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":"14db928748e0e46a78bc99e84458693449b05975a767f7f27e5a76454259e89d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-30T12:18:54Z","title_canon_sha256":"757cd583fc2a3868bf58ec7aa4136020cf86bb2754cd34b187f29755c95a373c"},"schema_version":"1.0","source":{"id":"1304.7971","kind":"arxiv","version":2}},"canonical_sha256":"b7f85d95ad5114692a8dc7ac123659a6b212ead88780bf5fda734e6844f34ab2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7f85d95ad5114692a8dc7ac123659a6b212ead88780bf5fda734e6844f34ab2","first_computed_at":"2026-05-18T03:21:11.526329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:11.526329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gBoPY3EsncSqnyOcezbbc2HFrGgjNWzZoU0S/iHASWGLjzy5oKtiuBp8lA8AxaoIrKGKGpi/6EYQIRcJE3XuAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:11.527015Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.7971","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7816c41c25d8f8ba0effe9e3c4b2fc92fbc9c52872146737710fe8bdc3b38c2","sha256:2e714dcfb47f670b8f29db73670b06e1f4745cd6f8d86135bf64840678ce2c2c"],"state_sha256":"de756cc3ac7dba62707f315473adacd5d520bedf26c893433ba723028925d372"}