{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:64PQ5IBFCJFNPZUWNZSF26VAEU","short_pith_number":"pith:64PQ5IBF","schema_version":"1.0","canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","source":{"kind":"arxiv","id":"1004.0208","version":3},"attestation_state":"computed","paper":{"title":"Delay-rate tradeoff in ergodic interference alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge, Oliver Johnson, Robert Piechocki","submitted_at":"2010-04-01T19:04:16Z","abstract_excerpt":"Ergodic interference alignment, as introduced by Nazer et al (NGJV), is a technique that allows high-rate communication in n-user interference networks with fast fading. It works by splitting communication across a pair of fading matrices. However, it comes with the overhead of a long time delay until matchable matrices occur: the delay is q^n^2 for field size q.\n  In this paper, we outline two new families of schemes, called JAP and JAP-B, that reduce the expected delay, sometimes at the cost of a reduction in rate from the NGJV scheme. In particular, we give examples of good schemes for netw"},"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":"1004.0208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-01T19:04:16Z","cross_cats_sorted":["math.IT","math.PR"],"title_canon_sha256":"84f7b0b892c61299315f5f718920af6102f8017ad4ad8df88065ebae6a752c3d","abstract_canon_sha256":"d6716279c3cd0df5bd6ab3abf38f0d0fb19e794aadeb845a7d8c14dfa959b1be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:01.083526Z","signature_b64":"0IuUONexTW3rF71fIuprXAAl5SRcvBhECe1I92bJ/8/nUJDK0IbeIUsvXv8QGbQRfiH8itE6uhVhe4P870UKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","last_reissued_at":"2026-05-18T00:05:01.082872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:01.082872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delay-rate tradeoff in ergodic interference alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Matthew Aldridge, Oliver Johnson, Robert Piechocki","submitted_at":"2010-04-01T19:04:16Z","abstract_excerpt":"Ergodic interference alignment, as introduced by Nazer et al (NGJV), is a technique that allows high-rate communication in n-user interference networks with fast fading. It works by splitting communication across a pair of fading matrices. However, it comes with the overhead of a long time delay until matchable matrices occur: the delay is q^n^2 for field size q.\n  In this paper, we outline two new families of schemes, called JAP and JAP-B, that reduce the expected delay, sometimes at the cost of a reduction in rate from the NGJV scheme. In particular, we give examples of good schemes for netw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0208","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":"1004.0208","created_at":"2026-05-18T00:05:01.082953+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.0208v3","created_at":"2026-05-18T00:05:01.082953+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0208","created_at":"2026-05-18T00:05:01.082953+00:00"},{"alias_kind":"pith_short_12","alias_value":"64PQ5IBFCJFN","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"64PQ5IBFCJFNPZUW","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"64PQ5IBF","created_at":"2026-05-18T12:26:04.259169+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/64PQ5IBFCJFNPZUWNZSF26VAEU","json":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU.json","graph_json":"https://pith.science/api/pith-number/64PQ5IBFCJFNPZUWNZSF26VAEU/graph.json","events_json":"https://pith.science/api/pith-number/64PQ5IBFCJFNPZUWNZSF26VAEU/events.json","paper":"https://pith.science/paper/64PQ5IBF"},"agent_actions":{"view_html":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU","download_json":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU.json","view_paper":"https://pith.science/paper/64PQ5IBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.0208&json=true","fetch_graph":"https://pith.science/api/pith-number/64PQ5IBFCJFNPZUWNZSF26VAEU/graph.json","fetch_events":"https://pith.science/api/pith-number/64PQ5IBFCJFNPZUWNZSF26VAEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/action/storage_attestation","attest_author":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/action/author_attestation","sign_citation":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/action/citation_signature","submit_replication":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/action/replication_record"}},"created_at":"2026-05-18T00:05:01.082953+00:00","updated_at":"2026-05-18T00:05:01.082953+00:00"}