{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:K7Z7ARJJDR26WVU5ROHF7REWGK","short_pith_number":"pith:K7Z7ARJJ","schema_version":"1.0","canonical_sha256":"57f3f045291c75eb569d8b8e5fc49632a2eb9f06823e9071d8f1c58c5a41a6ad","source":{"kind":"arxiv","id":"0910.0555","version":1},"attestation_state":"computed","paper":{"title":"Exploiting Channel Correlations - Simple Interference Alignment Schemes with no CSIT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar","submitted_at":"2009-10-05T02:51:18Z","abstract_excerpt":"We explore 5 network communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with channel uncertainty at the transmitters are unknown. These problems share the common property that in each case the best known outer bounds are essentially robust to channel uncertainty and represent the outcome with interference alignment, but the best inner bounds -- in some cases conjectured to be optimal -- predict a total collapse of DoF, thus indicating the infeasibility of interference alignment under channel uncertainty at trans"},"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":"0910.0555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-10-05T02:51:18Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"429dddaae4ca60dc3f13483cce98d40ddc66c1132ec61dc02ee1337c18685f39","abstract_canon_sha256":"0e70a90d50cfd80912fe11a2612032691841dd1715fa227931841c1ae21840e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.991962Z","signature_b64":"OW50CBo6CWQtymkkfKgRREO+4XEDil8NNNjqvXLAEUqm3y7y+54VEhjGRWZ8R9DAOFali+NnxLQuWf0TSEZ4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57f3f045291c75eb569d8b8e5fc49632a2eb9f06823e9071d8f1c58c5a41a6ad","last_reissued_at":"2026-05-18T00:57:57.991372Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.991372Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploiting Channel Correlations - Simple Interference Alignment Schemes with no CSIT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Syed A. Jafar","submitted_at":"2009-10-05T02:51:18Z","abstract_excerpt":"We explore 5 network communication problems where the possibility of interference alignment, and consequently the total number of degrees of freedom (DoF) with channel uncertainty at the transmitters are unknown. These problems share the common property that in each case the best known outer bounds are essentially robust to channel uncertainty and represent the outcome with interference alignment, but the best inner bounds -- in some cases conjectured to be optimal -- predict a total collapse of DoF, thus indicating the infeasibility of interference alignment under channel uncertainty at trans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.0555","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":"0910.0555","created_at":"2026-05-18T00:57:57.991469+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.0555v1","created_at":"2026-05-18T00:57:57.991469+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.0555","created_at":"2026-05-18T00:57:57.991469+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7Z7ARJJDR26","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7Z7ARJJDR26WVU5","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7Z7ARJJ","created_at":"2026-05-18T12:26:00.592388+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/K7Z7ARJJDR26WVU5ROHF7REWGK","json":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK.json","graph_json":"https://pith.science/api/pith-number/K7Z7ARJJDR26WVU5ROHF7REWGK/graph.json","events_json":"https://pith.science/api/pith-number/K7Z7ARJJDR26WVU5ROHF7REWGK/events.json","paper":"https://pith.science/paper/K7Z7ARJJ"},"agent_actions":{"view_html":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK","download_json":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK.json","view_paper":"https://pith.science/paper/K7Z7ARJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.0555&json=true","fetch_graph":"https://pith.science/api/pith-number/K7Z7ARJJDR26WVU5ROHF7REWGK/graph.json","fetch_events":"https://pith.science/api/pith-number/K7Z7ARJJDR26WVU5ROHF7REWGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK/action/storage_attestation","attest_author":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK/action/author_attestation","sign_citation":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK/action/citation_signature","submit_replication":"https://pith.science/pith/K7Z7ARJJDR26WVU5ROHF7REWGK/action/replication_record"}},"created_at":"2026-05-18T00:57:57.991469+00:00","updated_at":"2026-05-18T00:57:57.991469+00:00"}