{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:P6DFV3LVUJ2FY2DFXVSWWFZARS","short_pith_number":"pith:P6DFV3LV","canonical_record":{"source":{"id":"2002.02750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T13:03:22Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"5de09e059e4e2705bea66d00a992ce5ded62fb6b357aec4457f1119902ab532e","abstract_canon_sha256":"de5f1a51d548a78a27cf10bb98b9367091135d66e9bb7a9c2f970aab2aec4326"},"schema_version":"1.0"},"canonical_sha256":"7f865aed75a2745c6865bd656b17208c83d15baedbfe4d4f4fe4b02a5793ea8b","source":{"kind":"arxiv","id":"2002.02750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02750","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02750v2","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02750","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"P6DFV3LVUJ2F","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"P6DFV3LVUJ2FY2DF","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"P6DFV3LV","created_at":"2026-07-05T00:39:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:P6DFV3LVUJ2FY2DFXVSWWFZARS","target":"record","payload":{"canonical_record":{"source":{"id":"2002.02750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T13:03:22Z","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"title_canon_sha256":"5de09e059e4e2705bea66d00a992ce5ded62fb6b357aec4457f1119902ab532e","abstract_canon_sha256":"de5f1a51d548a78a27cf10bb98b9367091135d66e9bb7a9c2f970aab2aec4326"},"schema_version":"1.0"},"canonical_sha256":"7f865aed75a2745c6865bd656b17208c83d15baedbfe4d4f4fe4b02a5793ea8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:39:17.668388Z","signature_b64":"nK/ro1xKVDA4qA63uNbk1e/bdQOq/h5o7tQkgpw9UQsxoArn5hvmVNMvFZj7KN8rro29b4fJs0AFMnJ/KmPfDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f865aed75a2745c6865bd656b17208c83d15baedbfe4d4f4fe4b02a5793ea8b","last_reissued_at":"2026-07-05T00:39:17.668005Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:39:17.668005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2002.02750","source_version":2,"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-07-05T00:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6v/WBuU0F8+grsuMTncI9fMwUPH+hFMYgMLhEffubRZ8dqJlI0MHXXCABFIL8ev/Laul9ru4LWkLsAZ9Z/sNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:25:02.240909Z"},"content_sha256":"64bbd35eb5671309d2db68552e0bbe6c4300ee1624181a4a32412134f67c34d8","schema_version":"1.0","event_id":"sha256:64bbd35eb5671309d2db68552e0bbe6c4300ee1624181a4a32412134f67c34d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:P6DFV3LVUJ2FY2DFXVSWWFZARS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep HyperNetwork-Based MIMO Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","math.IT"],"primary_cat":"cs.IT","authors_text":"Fay\\c{c}al Ait Aoudia, Jakob Hoydis, Mathieu Goutay","submitted_at":"2020-02-07T13:03:22Z","abstract_excerpt":"Optimal symbol detection for multiple-input multiple-output (MIMO) systems is known to be an NP-hard problem. Conventional heuristic algorithms are either too complex to be practical or suffer from poor performance. Recently, several approaches tried to address those challenges by implementing the detector as a deep neural network. However, they either still achieve unsatisfying performance on practical spatially correlated channels, or are computationally demanding since they require retraining for each channel realization. In this work, we address both issues by training an additional neural"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02750","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2002.02750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eaG2IZU/XtE1DpEB2EjgS9q60aZNTdFviH5H0hoLu6grJg0C0fvm/1/H7kyOPDPb0ou2Oi54gKoNMN9l0p2gCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T12:25:02.241419Z"},"content_sha256":"f39ad9d9e2c062c60b30d468da98bf3981a3c5a627ec726ebdd5f8ada2bbe0c2","schema_version":"1.0","event_id":"sha256:f39ad9d9e2c062c60b30d468da98bf3981a3c5a627ec726ebdd5f8ada2bbe0c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/bundle.json","state_url":"https://pith.science/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/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-08-16T12:25:02Z","links":{"resolver":"https://pith.science/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS","bundle":"https://pith.science/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/bundle.json","state":"https://pith.science/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6DFV3LVUJ2FY2DFXVSWWFZARS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:P6DFV3LVUJ2FY2DFXVSWWFZARS","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":"de5f1a51d548a78a27cf10bb98b9367091135d66e9bb7a9c2f970aab2aec4326","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T13:03:22Z","title_canon_sha256":"5de09e059e4e2705bea66d00a992ce5ded62fb6b357aec4457f1119902ab532e"},"schema_version":"1.0","source":{"id":"2002.02750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2002.02750","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2002.02750v2","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02750","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"P6DFV3LVUJ2F","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"P6DFV3LVUJ2FY2DF","created_at":"2026-07-05T00:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"P6DFV3LV","created_at":"2026-07-05T00:39:17Z"}],"graph_snapshots":[{"event_id":"sha256:f39ad9d9e2c062c60b30d468da98bf3981a3c5a627ec726ebdd5f8ada2bbe0c2","target":"graph","created_at":"2026-07-05T00:39:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2002.02750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal symbol detection for multiple-input multiple-output (MIMO) systems is known to be an NP-hard problem. Conventional heuristic algorithms are either too complex to be practical or suffer from poor performance. Recently, several approaches tried to address those challenges by implementing the detector as a deep neural network. However, they either still achieve unsatisfying performance on practical spatially correlated channels, or are computationally demanding since they require retraining for each channel realization. In this work, we address both issues by training an additional neural","authors_text":"Fay\\c{c}al Ait Aoudia, Jakob Hoydis, Mathieu Goutay","cross_cats":["cs.LG","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T13:03:22Z","title":"Deep HyperNetwork-Based MIMO Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02750","kind":"arxiv","version":2},"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:64bbd35eb5671309d2db68552e0bbe6c4300ee1624181a4a32412134f67c34d8","target":"record","created_at":"2026-07-05T00:39:17Z","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":"de5f1a51d548a78a27cf10bb98b9367091135d66e9bb7a9c2f970aab2aec4326","cross_cats_sorted":["cs.LG","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-02-07T13:03:22Z","title_canon_sha256":"5de09e059e4e2705bea66d00a992ce5ded62fb6b357aec4457f1119902ab532e"},"schema_version":"1.0","source":{"id":"2002.02750","kind":"arxiv","version":2}},"canonical_sha256":"7f865aed75a2745c6865bd656b17208c83d15baedbfe4d4f4fe4b02a5793ea8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f865aed75a2745c6865bd656b17208c83d15baedbfe4d4f4fe4b02a5793ea8b","first_computed_at":"2026-07-05T00:39:17.668005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:39:17.668005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nK/ro1xKVDA4qA63uNbk1e/bdQOq/h5o7tQkgpw9UQsxoArn5hvmVNMvFZj7KN8rro29b4fJs0AFMnJ/KmPfDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:39:17.668388Z","signed_message":"canonical_sha256_bytes"},"source_id":"2002.02750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64bbd35eb5671309d2db68552e0bbe6c4300ee1624181a4a32412134f67c34d8","sha256:f39ad9d9e2c062c60b30d468da98bf3981a3c5a627ec726ebdd5f8ada2bbe0c2"],"state_sha256":"a3cc7f96e08c9552ef8996ec0eb0680aeb76e0ccafef1a8cbb2faf7575d0b54c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxmoSIXWXnvYMOJTz0YUJ1CABSdiH+SraJ427MCl4ZOaewV9t7tx+C+LknYXeRSbP/rGl6j/aFlSmjqwVkxICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T12:25:02.246347Z","bundle_sha256":"271f491b4bf88170175d9b18f5dec1d2865ee22e067ce04ffd7e245b44498637"}}