{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AFDUDRZ5DSZSASSV4XGNDNY633","short_pith_number":"pith:AFDUDRZ5","schema_version":"1.0","canonical_sha256":"014741c73d1cb3204a55e5ccd1b71edeecd629a3dae1fe94e2169169f157bb48","source":{"kind":"arxiv","id":"1709.04379","version":1},"attestation_state":"computed","paper":{"title":"Layered Space-Time Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong, Yu-Chih Huang","submitted_at":"2017-09-13T15:26:35Z","abstract_excerpt":"Multicasting $K$ independent messages via multiple-input multiple-output (MIMO) channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the p"},"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":"1709.04379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-13T15:26:35Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ec2560ff61f223d32f7c7e9717629ada4531c03d3005f5ca79d59b3c7d1bdcce","abstract_canon_sha256":"da3707ffe2d4e8476f82560dd5278c11081c4f9a647e36d2c6a1e79beaf2f15d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:14.528845Z","signature_b64":"7EE8p3iTYhoM4mZnhLlAaww6TluMdzCSA/XuOTGmLHx6ExOBG2GZxf29Pl8Bruj/rzO4OPWOAlSZzpQmaQcuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014741c73d1cb3204a55e5ccd1b71edeecd629a3dae1fe94e2169169f157bb48","last_reissued_at":"2026-05-18T00:35:14.528132Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:14.528132Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layered Space-Time Index Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Emanuele Viterbo, Lakshmi Natarajan, Yi Hong, Yu-Chih Huang","submitted_at":"2017-09-13T15:26:35Z","abstract_excerpt":"Multicasting $K$ independent messages via multiple-input multiple-output (MIMO) channels to multiple users where each user already has a subset of messages as side information is studied. A general framework of constructing layered space-time index coding (LSTIC) from a large class of space-time block codes (STBC), including perfect STBC, is proposed. We analyze the proposed LSTIC and show that it provides minimum determinant gains that are exponential with the amount of information contained in the side information for any possible side information. When constructed over a perfect STBC, the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.04379","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":"1709.04379","created_at":"2026-05-18T00:35:14.528244+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.04379v1","created_at":"2026-05-18T00:35:14.528244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.04379","created_at":"2026-05-18T00:35:14.528244+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFDUDRZ5DSZS","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFDUDRZ5DSZSASSV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFDUDRZ5","created_at":"2026-05-18T12:31:05.417338+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/AFDUDRZ5DSZSASSV4XGNDNY633","json":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633.json","graph_json":"https://pith.science/api/pith-number/AFDUDRZ5DSZSASSV4XGNDNY633/graph.json","events_json":"https://pith.science/api/pith-number/AFDUDRZ5DSZSASSV4XGNDNY633/events.json","paper":"https://pith.science/paper/AFDUDRZ5"},"agent_actions":{"view_html":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633","download_json":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633.json","view_paper":"https://pith.science/paper/AFDUDRZ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.04379&json=true","fetch_graph":"https://pith.science/api/pith-number/AFDUDRZ5DSZSASSV4XGNDNY633/graph.json","fetch_events":"https://pith.science/api/pith-number/AFDUDRZ5DSZSASSV4XGNDNY633/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633/action/storage_attestation","attest_author":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633/action/author_attestation","sign_citation":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633/action/citation_signature","submit_replication":"https://pith.science/pith/AFDUDRZ5DSZSASSV4XGNDNY633/action/replication_record"}},"created_at":"2026-05-18T00:35:14.528244+00:00","updated_at":"2026-05-18T00:35:14.528244+00:00"}