{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TBAZDTALBSWRUYGNK6COZ4NJHP","short_pith_number":"pith:TBAZDTAL","schema_version":"1.0","canonical_sha256":"984191cc0b0cad1a60cd5784ecf1a93bea75172da330260b2bf7a1f9fa12e3f6","source":{"kind":"arxiv","id":"1301.6397","version":1},"attestation_state":"computed","paper":{"title":"Scalar Quantize-and-Forward for Symmetric Half-duplex Two-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Rosanka, Michael Heindlmaier, Onurcan Iscan","submitted_at":"2013-01-27T20:41:20Z","abstract_excerpt":"Scalar Quantize & Forward (QF) schemes are studied for the Two-Way Relay Channel. Different QF approaches are compared in terms of rates as well as relay and decoder complexity. A coding scheme not requiring Slepian-Wolf coding at the relay is proposed and properties of the corresponding sum-rate optimization problem are presented. A numerical scheme similar to the Blahut-Arimoto algorithm is derived that guides optimized quantizer design. The results are supported by simulations."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1301.6397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-27T20:41:20Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"013bbf23fa792da2828552496480b98787d0757feb2be2caee252e1b9f611a49","abstract_canon_sha256":"2266bdfc817216a642edb541cfbd8f1e7a0fb7d3b9cdf1b7790d5da49ec5e4af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:15.518193Z","signature_b64":"tU4gpmNpXXh5ZpBMELNGWCBSknQFGbYqYoyjCCVw8T9b0X6RKW2on5JXx3KgnVVug9XmKXzHdUG5JNDPyDWqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"984191cc0b0cad1a60cd5784ecf1a93bea75172da330260b2bf7a1f9fa12e3f6","last_reissued_at":"2026-05-18T03:35:15.517501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:15.517501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalar Quantize-and-Forward for Symmetric Half-duplex Two-Way Relay Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christopher Rosanka, Michael Heindlmaier, Onurcan Iscan","submitted_at":"2013-01-27T20:41:20Z","abstract_excerpt":"Scalar Quantize & Forward (QF) schemes are studied for the Two-Way Relay Channel. Different QF approaches are compared in terms of rates as well as relay and decoder complexity. A coding scheme not requiring Slepian-Wolf coding at the relay is proposed and properties of the corresponding sum-rate optimization problem are presented. A numerical scheme similar to the Blahut-Arimoto algorithm is derived that guides optimized quantizer design. The results are supported by simulations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6397","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.6397","created_at":"2026-05-18T03:35:15.517605+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6397v1","created_at":"2026-05-18T03:35:15.517605+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6397","created_at":"2026-05-18T03:35:15.517605+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBAZDTALBSWR","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBAZDTALBSWRUYGN","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBAZDTAL","created_at":"2026-05-18T12:27:59.945178+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP","json":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP.json","graph_json":"https://pith.science/api/pith-number/TBAZDTALBSWRUYGNK6COZ4NJHP/graph.json","events_json":"https://pith.science/api/pith-number/TBAZDTALBSWRUYGNK6COZ4NJHP/events.json","paper":"https://pith.science/paper/TBAZDTAL"},"agent_actions":{"view_html":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP","download_json":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP.json","view_paper":"https://pith.science/paper/TBAZDTAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6397&json=true","fetch_graph":"https://pith.science/api/pith-number/TBAZDTALBSWRUYGNK6COZ4NJHP/graph.json","fetch_events":"https://pith.science/api/pith-number/TBAZDTALBSWRUYGNK6COZ4NJHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP/action/storage_attestation","attest_author":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP/action/author_attestation","sign_citation":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP/action/citation_signature","submit_replication":"https://pith.science/pith/TBAZDTALBSWRUYGNK6COZ4NJHP/action/replication_record"}},"created_at":"2026-05-18T03:35:15.517605+00:00","updated_at":"2026-05-18T03:35:15.517605+00:00"}