{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:2QGHWSWJFJ2FUWSYAWWE6HRNGR","short_pith_number":"pith:2QGHWSWJ","schema_version":"1.0","canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","source":{"kind":"arxiv","id":"0906.1599","version":3},"attestation_state":"computed","paper":{"title":"Bits Through Deterministic Relay Cascades with Half-Duplex Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hausl, Ralf K\\\"otter, Tobias Lutz","submitted_at":"2009-06-08T21:39:44Z","abstract_excerpt":"Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronizati"},"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":"0906.1599","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-08T21:39:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"04c9730c5e550b29f66bf1a56aa1f6b3a32ccdb641e22cd0b762f0d7c572cb2c","abstract_canon_sha256":"21ed9de394fbb28ac3bc82d9b80fb7a5e7dd4194de41717d408d2875e60d2350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:48.065125Z","signature_b64":"JUrobPtf0LE+HYoEscaEls5pxToNi8AtVIb0rsuBvdUOESLVCpHD19W/aCdPyhqFtwDM0BLrfHAhhZhHCJ+cCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d40c7b4ac92a745a5a5805ac4f1e2d3478965e27ef3df3ffab16c6c16d32b8c8","last_reissued_at":"2026-05-18T00:58:48.064630Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:48.064630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bits Through Deterministic Relay Cascades with Half-Duplex Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hausl, Ralf K\\\"otter, Tobias Lutz","submitted_at":"2009-06-08T21:39:44Z","abstract_excerpt":"Consider a relay cascade, i.e. a network where a source node, a sink node and a certain number of intermediate source/relay nodes are arranged on a line and where adjacent node pairs are connected by error-free (q+1)-ary pipes. Suppose the source and a subset of the relays wish to communicate independent information to the sink under the condition that each relay in the cascade is half-duplex constrained. A coding scheme is developed which transfers information by an information-dependent allocation of the transmission and reception slots of the relays. The coding scheme requires synchronizati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1599","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0906.1599","created_at":"2026-05-18T00:58:48.064707+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.1599v3","created_at":"2026-05-18T00:58:48.064707+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1599","created_at":"2026-05-18T00:58:48.064707+00:00"},{"alias_kind":"pith_short_12","alias_value":"2QGHWSWJFJ2F","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"2QGHWSWJFJ2FUWSY","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"2QGHWSWJ","created_at":"2026-05-18T12:25:58.018023+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/2QGHWSWJFJ2FUWSYAWWE6HRNGR","json":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR.json","graph_json":"https://pith.science/api/pith-number/2QGHWSWJFJ2FUWSYAWWE6HRNGR/graph.json","events_json":"https://pith.science/api/pith-number/2QGHWSWJFJ2FUWSYAWWE6HRNGR/events.json","paper":"https://pith.science/paper/2QGHWSWJ"},"agent_actions":{"view_html":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR","download_json":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR.json","view_paper":"https://pith.science/paper/2QGHWSWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.1599&json=true","fetch_graph":"https://pith.science/api/pith-number/2QGHWSWJFJ2FUWSYAWWE6HRNGR/graph.json","fetch_events":"https://pith.science/api/pith-number/2QGHWSWJFJ2FUWSYAWWE6HRNGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/action/storage_attestation","attest_author":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/action/author_attestation","sign_citation":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/action/citation_signature","submit_replication":"https://pith.science/pith/2QGHWSWJFJ2FUWSYAWWE6HRNGR/action/replication_record"}},"created_at":"2026-05-18T00:58:48.064707+00:00","updated_at":"2026-05-18T00:58:48.064707+00:00"}