{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QR7LN7C32FODAP4A6ZWIAC6IZQ","short_pith_number":"pith:QR7LN7C3","canonical_record":{"source":{"id":"1007.1174","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T16:06:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ab8fe42cdb6b6366f15e478cf2b3cbc9a71b6136dd3d8095cb5ffad1c87a525","abstract_canon_sha256":"8a7924091315be6843cc3efe424fd440ba7dd3815b6fa870e5854d5e9b3525dd"},"schema_version":"1.0"},"canonical_sha256":"847eb6fc5bd15c303f80f66c800bc8cc3bc762dcdbdf9a0643e05fc2db062b79","source":{"kind":"arxiv","id":"1007.1174","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1174","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1174v3","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1174","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"QR7LN7C32FOD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QR7LN7C32FODAP4A","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QR7LN7C3","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QR7LN7C32FODAP4A6ZWIAC6IZQ","target":"record","payload":{"canonical_record":{"source":{"id":"1007.1174","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T16:06:01Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"3ab8fe42cdb6b6366f15e478cf2b3cbc9a71b6136dd3d8095cb5ffad1c87a525","abstract_canon_sha256":"8a7924091315be6843cc3efe424fd440ba7dd3815b6fa870e5854d5e9b3525dd"},"schema_version":"1.0"},"canonical_sha256":"847eb6fc5bd15c303f80f66c800bc8cc3bc762dcdbdf9a0643e05fc2db062b79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:10.824148Z","signature_b64":"KI2/LRNToGAaR1QQdPWhrnYGsIVlbj7F9AMUal5f3hUXhC6vE32STkNW/6DGJrWnr8WEORgjpxd0NLWM544DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"847eb6fc5bd15c303f80f66c800bc8cc3bc762dcdbdf9a0643e05fc2db062b79","last_reissued_at":"2026-05-18T00:59:10.823471Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:10.823471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.1174","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPuCJCl1vzntlJFX3JYZNYIiYHAYlRSHmshCKzUU0XbeID2IJixBi+tMuv2+j5kwuFf81M8s41FeL2a38rfSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:57.342023Z"},"content_sha256":"ac8df0148326185f784bc7f56a71df3f92fa179e7a8bc180976be5e0021d9733","schema_version":"1.0","event_id":"sha256:ac8df0148326185f784bc7f56a71df3f92fa179e7a8bc180976be5e0021d9733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QR7LN7C32FODAP4A6ZWIAC6IZQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Based Interference Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jiandong Li, Qin Liu, Rui Chen, Yanjun Ma","submitted_at":"2010-07-07T16:06:01Z","abstract_excerpt":"In the $K$-user single-input single-output (SISO) frequency-selective fading interference channel, it is shown that the maximal achievable multiplexing gain is almost surely $K/2$ by using interference alignment (IA). However, when the signaling dimensions are limited, allocating all the resources to all users simultaneously is not optimal. So, a group based interference alignment (GIA) scheme is proposed, and it is formulated as an unbounded knapsack problem. Optimal and greedy search algorithms are proposed to obtain group patterns. Analysis and numerical results show that the GIA scheme can"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1174","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:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"odTb4POIWnXRAjqMcBk1wAeYHAONZaH2kV80+KcXeA4Hzcb1zyzOFJ3PXDM6wSwdEcdgFjFRdqu0iYdIgpFfBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T11:21:57.342378Z"},"content_sha256":"398ae8b35810b9a24b909a8db96838c65b67de82d511bcbed5959d1076a636ed","schema_version":"1.0","event_id":"sha256:398ae8b35810b9a24b909a8db96838c65b67de82d511bcbed5959d1076a636ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/bundle.json","state_url":"https://pith.science/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/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-08T11:21:57Z","links":{"resolver":"https://pith.science/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ","bundle":"https://pith.science/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/bundle.json","state":"https://pith.science/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QR7LN7C32FODAP4A6ZWIAC6IZQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QR7LN7C32FODAP4A6ZWIAC6IZQ","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":"8a7924091315be6843cc3efe424fd440ba7dd3815b6fa870e5854d5e9b3525dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T16:06:01Z","title_canon_sha256":"3ab8fe42cdb6b6366f15e478cf2b3cbc9a71b6136dd3d8095cb5ffad1c87a525"},"schema_version":"1.0","source":{"id":"1007.1174","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.1174","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1007.1174v3","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1174","created_at":"2026-05-18T00:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"QR7LN7C32FOD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QR7LN7C32FODAP4A","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QR7LN7C3","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:398ae8b35810b9a24b909a8db96838c65b67de82d511bcbed5959d1076a636ed","target":"graph","created_at":"2026-05-18T00:59:10Z","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":"In the $K$-user single-input single-output (SISO) frequency-selective fading interference channel, it is shown that the maximal achievable multiplexing gain is almost surely $K/2$ by using interference alignment (IA). However, when the signaling dimensions are limited, allocating all the resources to all users simultaneously is not optimal. So, a group based interference alignment (GIA) scheme is proposed, and it is formulated as an unbounded knapsack problem. Optimal and greedy search algorithms are proposed to obtain group patterns. Analysis and numerical results show that the GIA scheme can","authors_text":"Jiandong Li, Qin Liu, Rui Chen, Yanjun Ma","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T16:06:01Z","title":"Group Based Interference Alignment"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1174","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:ac8df0148326185f784bc7f56a71df3f92fa179e7a8bc180976be5e0021d9733","target":"record","created_at":"2026-05-18T00:59:10Z","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":"8a7924091315be6843cc3efe424fd440ba7dd3815b6fa870e5854d5e9b3525dd","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T16:06:01Z","title_canon_sha256":"3ab8fe42cdb6b6366f15e478cf2b3cbc9a71b6136dd3d8095cb5ffad1c87a525"},"schema_version":"1.0","source":{"id":"1007.1174","kind":"arxiv","version":3}},"canonical_sha256":"847eb6fc5bd15c303f80f66c800bc8cc3bc762dcdbdf9a0643e05fc2db062b79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"847eb6fc5bd15c303f80f66c800bc8cc3bc762dcdbdf9a0643e05fc2db062b79","first_computed_at":"2026-05-18T00:59:10.823471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:10.823471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KI2/LRNToGAaR1QQdPWhrnYGsIVlbj7F9AMUal5f3hUXhC6vE32STkNW/6DGJrWnr8WEORgjpxd0NLWM544DBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:10.824148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.1174","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac8df0148326185f784bc7f56a71df3f92fa179e7a8bc180976be5e0021d9733","sha256:398ae8b35810b9a24b909a8db96838c65b67de82d511bcbed5959d1076a636ed"],"state_sha256":"7d89da668472d01f58aceea715fb15a3d407b20e827ae70a2dd8acd4223fd112"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bwe4mWTj1EXj4CvnFJDJbjRwAOpilYuMX/P6rsZ7hlIsMUBFzWrZubuee6RyH7LCAahF1V6ZhZMdHKZ4SqVAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T11:21:57.344457Z","bundle_sha256":"8153cac3ed1b12195ec90f1171b1401b835480a17ab11265bda51ba5ee2c0aaf"}}