{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FVGLGYQZ2JIL5YP2JCOWIHMUVX","short_pith_number":"pith:FVGLGYQZ","schema_version":"1.0","canonical_sha256":"2d4cb36219d250bee1fa489d641d94adcaef6abacad26cfbf2e27f6cc8a81ada","source":{"kind":"arxiv","id":"1112.2892","version":2},"attestation_state":"computed","paper":{"title":"A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frank R. Kschischang, Tobias Lutz","submitted_at":"2011-12-13T13:53:21Z","abstract_excerpt":"We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays."},"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":"1112.2892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T13:53:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"76db9c3e58862b106a1c829f11fa96a2f328feebd7830aa9ba86e3bc8023d54e","abstract_canon_sha256":"bed225c8350827034d50bd5cb6a01e7f101061de94327b27cdd1ddce80cdbb4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:57.035918Z","signature_b64":"gKPmfxaTP2e20zBz/nkAHprK0U3KJwDkoHZ75fY9uO8Yppw3soJGxH2zCR/JCIpiohYumMh8X99jUw2hfgQNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4cb36219d250bee1fa489d641d94adcaef6abacad26cfbf2e27f6cc8a81ada","last_reissued_at":"2026-05-18T03:20:57.035138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:57.035138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Constrained Coding Approach to Error-Free Half-Duplex Relay Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Frank R. Kschischang, Tobias Lutz","submitted_at":"2011-12-13T13:53:21Z","abstract_excerpt":"We show that the broadcast capacity of an infinite-depth tree-structured network of error-free half-duplex-constrained relays can be achieved using constrained coding at the source and symbol forwarding at the relays."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2892","kind":"arxiv","version":2},"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":"1112.2892","created_at":"2026-05-18T03:20:57.035272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2892v2","created_at":"2026-05-18T03:20:57.035272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2892","created_at":"2026-05-18T03:20:57.035272+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVGLGYQZ2JIL","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVGLGYQZ2JIL5YP2","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVGLGYQZ","created_at":"2026-05-18T12:26:28.662955+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/FVGLGYQZ2JIL5YP2JCOWIHMUVX","json":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX.json","graph_json":"https://pith.science/api/pith-number/FVGLGYQZ2JIL5YP2JCOWIHMUVX/graph.json","events_json":"https://pith.science/api/pith-number/FVGLGYQZ2JIL5YP2JCOWIHMUVX/events.json","paper":"https://pith.science/paper/FVGLGYQZ"},"agent_actions":{"view_html":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX","download_json":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX.json","view_paper":"https://pith.science/paper/FVGLGYQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2892&json=true","fetch_graph":"https://pith.science/api/pith-number/FVGLGYQZ2JIL5YP2JCOWIHMUVX/graph.json","fetch_events":"https://pith.science/api/pith-number/FVGLGYQZ2JIL5YP2JCOWIHMUVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX/action/storage_attestation","attest_author":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX/action/author_attestation","sign_citation":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX/action/citation_signature","submit_replication":"https://pith.science/pith/FVGLGYQZ2JIL5YP2JCOWIHMUVX/action/replication_record"}},"created_at":"2026-05-18T03:20:57.035272+00:00","updated_at":"2026-05-18T03:20:57.035272+00:00"}