{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:64PQ5IBFCJFNPZUWNZSF26VAEU","short_pith_number":"pith:64PQ5IBF","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"},"canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","source":{"kind":"arxiv","id":"1004.0208","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0208","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0208v3","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0208","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"64PQ5IBFCJFN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"64PQ5IBFCJFNPZUW","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"64PQ5IBF","created_at":"2026-05-18T12:26:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:64PQ5IBFCJFNPZUWNZSF26VAEU","target":"record","payload":{"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"},"canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","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"},"source_kind":"arxiv","source_id":"1004.0208","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtGlkiCtauTtKh9VPtSFkoHuhbPkFBCv2ICteuWaXgpNcjPi0LHqWE+4KtatkrTA48YPYVzRXVLN2FCguFT3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:38.156152Z"},"content_sha256":"eb95b75e977a9345dd4548741fccf5372eea5bbd59d5fe70ee53f09b37fbb655","schema_version":"1.0","event_id":"sha256:eb95b75e977a9345dd4548741fccf5372eea5bbd59d5fe70ee53f09b37fbb655"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:64PQ5IBFCJFNPZUWNZSF26VAEU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:05:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pXBHeDY2foDJYu3vmoQg93ND1ko+J9bFnRIRUR+D+NeDBzr9BA0vd1oQ0wt8+3o/09JkERiECfrLfHRq0Q82CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:26:38.156509Z"},"content_sha256":"404330d1528f170b6f069cfc681f14df017b05fc869767a1fab20a86d4e48b4e","schema_version":"1.0","event_id":"sha256:404330d1528f170b6f069cfc681f14df017b05fc869767a1fab20a86d4e48b4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/bundle.json","state_url":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T19:26:38Z","links":{"resolver":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU","bundle":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/bundle.json","state":"https://pith.science/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64PQ5IBFCJFNPZUWNZSF26VAEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:64PQ5IBFCJFNPZUWNZSF26VAEU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d6716279c3cd0df5bd6ab3abf38f0d0fb19e794aadeb845a7d8c14dfa959b1be","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-01T19:04:16Z","title_canon_sha256":"84f7b0b892c61299315f5f718920af6102f8017ad4ad8df88065ebae6a752c3d"},"schema_version":"1.0","source":{"id":"1004.0208","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.0208","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"arxiv_version","alias_value":"1004.0208v3","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.0208","created_at":"2026-05-18T00:05:01Z"},{"alias_kind":"pith_short_12","alias_value":"64PQ5IBFCJFN","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_16","alias_value":"64PQ5IBFCJFNPZUW","created_at":"2026-05-18T12:26:04Z"},{"alias_kind":"pith_short_8","alias_value":"64PQ5IBF","created_at":"2026-05-18T12:26:04Z"}],"graph_snapshots":[{"event_id":"sha256:404330d1528f170b6f069cfc681f14df017b05fc869767a1fab20a86d4e48b4e","target":"graph","created_at":"2026-05-18T00:05:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Matthew Aldridge, Oliver Johnson, Robert Piechocki","cross_cats":["math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-01T19:04:16Z","title":"Delay-rate tradeoff in ergodic interference alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.0208","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:eb95b75e977a9345dd4548741fccf5372eea5bbd59d5fe70ee53f09b37fbb655","target":"record","created_at":"2026-05-18T00:05:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d6716279c3cd0df5bd6ab3abf38f0d0fb19e794aadeb845a7d8c14dfa959b1be","cross_cats_sorted":["math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-01T19:04:16Z","title_canon_sha256":"84f7b0b892c61299315f5f718920af6102f8017ad4ad8df88065ebae6a752c3d"},"schema_version":"1.0","source":{"id":"1004.0208","kind":"arxiv","version":3}},"canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f71f0ea025124ad7e6966e645d7aa0253cab226650125e2148b3b9990df91c81","first_computed_at":"2026-05-18T00:05:01.082872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:01.082872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0IuUONexTW3rF71fIuprXAAl5SRcvBhECe1I92bJ/8/nUJDK0IbeIUsvXv8QGbQRfiH8itE6uhVhe4P870UKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:01.083526Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.0208","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb95b75e977a9345dd4548741fccf5372eea5bbd59d5fe70ee53f09b37fbb655","sha256:404330d1528f170b6f069cfc681f14df017b05fc869767a1fab20a86d4e48b4e"],"state_sha256":"fdd1613c7a2130b66cb2dda6eee2c0cd72632e787fdd9ce52ececbe00cc98299"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zq5+zcG2/BNSoEBN7PBY9OGpQSsfBShwrqMu8mRiYRaEuVAuYsJst21bYM11xVMuT0UN5ajaJBbw/wFbMvItBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:26:38.158857Z","bundle_sha256":"a7ed9c0be7fc6d81d5bffb89643c6a2315c8b8815f30875e5d443460ddce13b5"}}