{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HJSV2BHPUQC24NWVU2T2HQZHVI","short_pith_number":"pith:HJSV2BHP","canonical_record":{"source":{"id":"1906.05774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-13T16:02:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"833e26ed3532220f576994e48364af1d13be361d6d1149c0a9eda751562e389b","abstract_canon_sha256":"5b5ca5497e8e735132887a490888d6473399e25f52f8d2d01e71488a41b0c14a"},"schema_version":"1.0"},"canonical_sha256":"3a655d04efa405ae36d5a6a7a3c327aa1b96f272dcb7a919e51b2855a1cb145c","source":{"kind":"arxiv","id":"1906.05774","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05774","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05774v2","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05774","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"HJSV2BHPUQC2","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_16","alias_value":"HJSV2BHPUQC24NWV","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_8","alias_value":"HJSV2BHP","created_at":"2026-07-05T00:10:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HJSV2BHPUQC24NWVU2T2HQZHVI","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05774","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-13T16:02:52Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"833e26ed3532220f576994e48364af1d13be361d6d1149c0a9eda751562e389b","abstract_canon_sha256":"5b5ca5497e8e735132887a490888d6473399e25f52f8d2d01e71488a41b0c14a"},"schema_version":"1.0"},"canonical_sha256":"3a655d04efa405ae36d5a6a7a3c327aa1b96f272dcb7a919e51b2855a1cb145c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:38.375408Z","signature_b64":"QNc1/Yizjs/g4jI1SutOAK/xVLg1zyQSlEHsM3+yiZNm6Jm1popaqtefIoFr7yfg0a/dbOCSSUX+bXuHkSsBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a655d04efa405ae36d5a6a7a3c327aa1b96f272dcb7a919e51b2855a1cb145c","last_reissued_at":"2026-07-05T00:10:38.374949Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:38.374949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05774","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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDi8Qys7ClqMO7Qb9yeLI46t7Ff4mm088SiezQQoWt+FwYK4ogqf3nxLpNYfi6jfv9qbkrAEbtwqv1+/SEGQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:03.868323Z"},"content_sha256":"3e378a085051ef9b07ccfe80db055cc2ecee6fe578356970e92d48ffba7ff076","schema_version":"1.0","event_id":"sha256:3e378a085051ef9b07ccfe80db055cc2ecee6fe578356970e92d48ffba7ff076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HJSV2BHPUQC24NWVU2T2HQZHVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Unfolding for Communications Systems: A Survey and Some New Directions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"eess.SP","authors_text":"Alexios Balatsoukas-Stimming, Christoph Studer","submitted_at":"2019-06-13T16:02:52Z","abstract_excerpt":"Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey summarizes the principle of deep unfolding and discusses its recent use for communication systems with focus on detection and precoding in multi-antenna (MIMO) wireless systems and belief propagation decoding of error-correcting codes. To showcase the efficacy and generality of deep unfolding, we describe a range of other tasks relevant to commu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05774","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/1906.05774/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:10:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blgENhZzOvbVX9RJv7UDpqyaybxjGTl6o8EO/w4zGqdS1lsKuAhSqaMFMkZwy3Ro5bTNiPX4t2kR0fxjsDDiCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T00:41:03.868822Z"},"content_sha256":"e8c140bc10f97512c32ff6a92ef2295746f463601bf83d719cb3c0a89300af05","schema_version":"1.0","event_id":"sha256:e8c140bc10f97512c32ff6a92ef2295746f463601bf83d719cb3c0a89300af05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/bundle.json","state_url":"https://pith.science/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/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-09T00:41:03Z","links":{"resolver":"https://pith.science/pith/HJSV2BHPUQC24NWVU2T2HQZHVI","bundle":"https://pith.science/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/bundle.json","state":"https://pith.science/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HJSV2BHPUQC24NWVU2T2HQZHVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HJSV2BHPUQC24NWVU2T2HQZHVI","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":"5b5ca5497e8e735132887a490888d6473399e25f52f8d2d01e71488a41b0c14a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-13T16:02:52Z","title_canon_sha256":"833e26ed3532220f576994e48364af1d13be361d6d1149c0a9eda751562e389b"},"schema_version":"1.0","source":{"id":"1906.05774","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05774","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05774v2","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05774","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_12","alias_value":"HJSV2BHPUQC2","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_16","alias_value":"HJSV2BHPUQC24NWV","created_at":"2026-07-05T00:10:38Z"},{"alias_kind":"pith_short_8","alias_value":"HJSV2BHP","created_at":"2026-07-05T00:10:38Z"}],"graph_snapshots":[{"event_id":"sha256:e8c140bc10f97512c32ff6a92ef2295746f463601bf83d719cb3c0a89300af05","target":"graph","created_at":"2026-07-05T00:10:38Z","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/1906.05774/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Deep unfolding is a method of growing popularity that fuses iterative optimization algorithms with tools from neural networks to efficiently solve a range of tasks in machine learning, signal and image processing, and communication systems. This survey summarizes the principle of deep unfolding and discusses its recent use for communication systems with focus on detection and precoding in multi-antenna (MIMO) wireless systems and belief propagation decoding of error-correcting codes. To showcase the efficacy and generality of deep unfolding, we describe a range of other tasks relevant to commu","authors_text":"Alexios Balatsoukas-Stimming, Christoph Studer","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-13T16:02:52Z","title":"Deep Unfolding for Communications Systems: A Survey and Some New Directions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05774","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:3e378a085051ef9b07ccfe80db055cc2ecee6fe578356970e92d48ffba7ff076","target":"record","created_at":"2026-07-05T00:10:38Z","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":"5b5ca5497e8e735132887a490888d6473399e25f52f8d2d01e71488a41b0c14a","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-06-13T16:02:52Z","title_canon_sha256":"833e26ed3532220f576994e48364af1d13be361d6d1149c0a9eda751562e389b"},"schema_version":"1.0","source":{"id":"1906.05774","kind":"arxiv","version":2}},"canonical_sha256":"3a655d04efa405ae36d5a6a7a3c327aa1b96f272dcb7a919e51b2855a1cb145c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3a655d04efa405ae36d5a6a7a3c327aa1b96f272dcb7a919e51b2855a1cb145c","first_computed_at":"2026-07-05T00:10:38.374949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:38.374949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNc1/Yizjs/g4jI1SutOAK/xVLg1zyQSlEHsM3+yiZNm6Jm1popaqtefIoFr7yfg0a/dbOCSSUX+bXuHkSsBDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:38.375408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05774","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e378a085051ef9b07ccfe80db055cc2ecee6fe578356970e92d48ffba7ff076","sha256:e8c140bc10f97512c32ff6a92ef2295746f463601bf83d719cb3c0a89300af05"],"state_sha256":"f4b1b20ae6765a27ff3fe37bbfbad40832773af5a6473ca223ea386cc1d38953"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WM2d6AMc6FeUiu80/yos8hAj3xtWc5gsRZ9S6I7uhJHDeXWtaDd1InL50CPnMwLpXCDcFUQAIbyyXyQ5etZiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T00:41:03.873397Z","bundle_sha256":"cf7a6de90634882efbf21de8e8d03ba1ae166418f77e8da218c7d8c5b87a804f"}}