{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:SJ6QWAM7D6UVRP6OFCIXYKIOO4","short_pith_number":"pith:SJ6QWAM7","schema_version":"1.0","canonical_sha256":"927d0b019f1fa958bfce28917c290e773977fc0f8a1e9e2839acac92056ea376","source":{"kind":"arxiv","id":"1006.0871","version":1},"attestation_state":"computed","paper":{"title":"Capacity for Half-Duplex Line Networks with Two Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hausl, Gerhard Kramer, Tobias Lutz","submitted_at":"2010-06-04T11:34:32Z","abstract_excerpt":"The focus is on noise-free half-duplex line networks with two sources where the first node and either the second node or the second-last node in the cascade act as sources. In both cases, we establish the capacity region of rates at which both sources can transmit independent information to a common sink. The achievability scheme presented for the first case is constructive while the achievability scheme for the second case is based on a random coding argument."},"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":"1006.0871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-06-04T11:34:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4e00f2b4929a8f13701aa0bb022d63f26d145c964487992e63dc757fdf47b71","abstract_canon_sha256":"b00662cc3900a29d8c90a3838b91993dd72235673d51e2ad5df8b2a718036302"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.909014Z","signature_b64":"8QN/YdsyL70jyv67DiJYXfUOV7NeD2ANN8tzbr6BAuxdm6wcnDiigBTMBPpXbkuOFsDdsqYngFxS5GpOQ87DCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"927d0b019f1fa958bfce28917c290e773977fc0f8a1e9e2839acac92056ea376","last_reissued_at":"2026-05-18T00:59:10.908346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.908346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Capacity for Half-Duplex Line Networks with Two Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Christoph Hausl, Gerhard Kramer, Tobias Lutz","submitted_at":"2010-06-04T11:34:32Z","abstract_excerpt":"The focus is on noise-free half-duplex line networks with two sources where the first node and either the second node or the second-last node in the cascade act as sources. In both cases, we establish the capacity region of rates at which both sources can transmit independent information to a common sink. The achievability scheme presented for the first case is constructive while the achievability scheme for the second case is based on a random coding argument."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.0871","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":"1006.0871","created_at":"2026-05-18T00:59:10.908478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.0871v1","created_at":"2026-05-18T00:59:10.908478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.0871","created_at":"2026-05-18T00:59:10.908478+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJ6QWAM7D6UV","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJ6QWAM7D6UVRP6O","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJ6QWAM7","created_at":"2026-05-18T12:26:13.927090+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/SJ6QWAM7D6UVRP6OFCIXYKIOO4","json":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4.json","graph_json":"https://pith.science/api/pith-number/SJ6QWAM7D6UVRP6OFCIXYKIOO4/graph.json","events_json":"https://pith.science/api/pith-number/SJ6QWAM7D6UVRP6OFCIXYKIOO4/events.json","paper":"https://pith.science/paper/SJ6QWAM7"},"agent_actions":{"view_html":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4","download_json":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4.json","view_paper":"https://pith.science/paper/SJ6QWAM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.0871&json=true","fetch_graph":"https://pith.science/api/pith-number/SJ6QWAM7D6UVRP6OFCIXYKIOO4/graph.json","fetch_events":"https://pith.science/api/pith-number/SJ6QWAM7D6UVRP6OFCIXYKIOO4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4/action/storage_attestation","attest_author":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4/action/author_attestation","sign_citation":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4/action/citation_signature","submit_replication":"https://pith.science/pith/SJ6QWAM7D6UVRP6OFCIXYKIOO4/action/replication_record"}},"created_at":"2026-05-18T00:59:10.908478+00:00","updated_at":"2026-05-18T00:59:10.908478+00:00"}