{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EHKSNMGPN5V3L3APQY7PZOHZC4","short_pith_number":"pith:EHKSNMGP","canonical_record":{"source":{"id":"1801.02442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T14:33:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e0dde5491689ad3a4e24bdd1cd5cde5b5d39b2889df08694974b17d24477784","abstract_canon_sha256":"0ce06f143d6c8293e7e56edb37fe55bb076017876b9716241f1aa5f058333d44"},"schema_version":"1.0"},"canonical_sha256":"21d526b0cf6f6bb5ec0f863efcb8f91701448d44ce62421a3d3f6fef5f437834","source":{"kind":"arxiv","id":"1801.02442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02442","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02442v1","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02442","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"EHKSNMGPN5V3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EHKSNMGPN5V3L3AP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EHKSNMGP","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EHKSNMGPN5V3L3APQY7PZOHZC4","target":"record","payload":{"canonical_record":{"source":{"id":"1801.02442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T14:33:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7e0dde5491689ad3a4e24bdd1cd5cde5b5d39b2889df08694974b17d24477784","abstract_canon_sha256":"0ce06f143d6c8293e7e56edb37fe55bb076017876b9716241f1aa5f058333d44"},"schema_version":"1.0"},"canonical_sha256":"21d526b0cf6f6bb5ec0f863efcb8f91701448d44ce62421a3d3f6fef5f437834","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:31.606228Z","signature_b64":"OXPO8wiuwt6gIx0r9RfZMnFXmfbqa3K8e4bvrMoY0oho3R41ALIJ/wrreHmwlSOI1iot58B63yipn3fRW693CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21d526b0cf6f6bb5ec0f863efcb8f91701448d44ce62421a3d3f6fef5f437834","last_reissued_at":"2026-05-18T00:26:31.605574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:31.605574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.02442","source_version":1,"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hQKzjqvpMNgBfpRDRX9IFN3CIrAj2t17HhNO2G0tqwjuygox+psO6uYtXUikYFDljWGyv9hSWLZYK7UI9vdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:00.375950Z"},"content_sha256":"811771c28dd279d2bcdcdd59e3d0ce888679f683bf95c8a6dcec79eccb6f7a21","schema_version":"1.0","event_id":"sha256:811771c28dd279d2bcdcdd59e3d0ce888679f683bf95c8a6dcec79eccb6f7a21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EHKSNMGPN5V3L3APQY7PZOHZC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Precoding via Approximate Message Passing with Instantaneous Signal Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ali Bereyhi, Mohammad Ali Sedaghat, Ralf R. M\\\"uller","submitted_at":"2018-01-08T14:33:23Z","abstract_excerpt":"This paper proposes a low complexity precoding algorithm based on the recently proposed Generalized Least Square Error (GLSE) scheme with generic penalty and support. The algorithm iteratively constructs the transmit vector via Approximate Message Passing (AMP). Using the asymptotic decoupling property of GLSE precoders, we derive closed form fixed point equations to tune the parameters in the proposed algorithm for a general set of instantaneous signal constraints. The tuning strategy is then utilized to construct transmit vectors with restricted peak-to-average power ratios and to efficientl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02442","kind":"arxiv","version":1},"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:26:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MjeuYtpCsB3kzGH+Zcarg/HtqeX9KgzM+xawnl4RNbqj1woEDQ2HH+C+2PbxLBJjH/1Qqcu8LI0z8GO0xFlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:42:00.376644Z"},"content_sha256":"dd1be9c288a73e12a3caa35f383f3ad64130731bfa8aa2bd23f1119cec9c6cfb","schema_version":"1.0","event_id":"sha256:dd1be9c288a73e12a3caa35f383f3ad64130731bfa8aa2bd23f1119cec9c6cfb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/bundle.json","state_url":"https://pith.science/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/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-08T17:42:00Z","links":{"resolver":"https://pith.science/pith/EHKSNMGPN5V3L3APQY7PZOHZC4","bundle":"https://pith.science/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/bundle.json","state":"https://pith.science/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHKSNMGPN5V3L3APQY7PZOHZC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EHKSNMGPN5V3L3APQY7PZOHZC4","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":"0ce06f143d6c8293e7e56edb37fe55bb076017876b9716241f1aa5f058333d44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T14:33:23Z","title_canon_sha256":"7e0dde5491689ad3a4e24bdd1cd5cde5b5d39b2889df08694974b17d24477784"},"schema_version":"1.0","source":{"id":"1801.02442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02442","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02442v1","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02442","created_at":"2026-05-18T00:26:31Z"},{"alias_kind":"pith_short_12","alias_value":"EHKSNMGPN5V3","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EHKSNMGPN5V3L3AP","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EHKSNMGP","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:dd1be9c288a73e12a3caa35f383f3ad64130731bfa8aa2bd23f1119cec9c6cfb","target":"graph","created_at":"2026-05-18T00:26:31Z","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":"This paper proposes a low complexity precoding algorithm based on the recently proposed Generalized Least Square Error (GLSE) scheme with generic penalty and support. The algorithm iteratively constructs the transmit vector via Approximate Message Passing (AMP). Using the asymptotic decoupling property of GLSE precoders, we derive closed form fixed point equations to tune the parameters in the proposed algorithm for a general set of instantaneous signal constraints. The tuning strategy is then utilized to construct transmit vectors with restricted peak-to-average power ratios and to efficientl","authors_text":"Ali Bereyhi, Mohammad Ali Sedaghat, Ralf R. M\\\"uller","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T14:33:23Z","title":"Precoding via Approximate Message Passing with Instantaneous Signal Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02442","kind":"arxiv","version":1},"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:811771c28dd279d2bcdcdd59e3d0ce888679f683bf95c8a6dcec79eccb6f7a21","target":"record","created_at":"2026-05-18T00:26:31Z","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":"0ce06f143d6c8293e7e56edb37fe55bb076017876b9716241f1aa5f058333d44","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-01-08T14:33:23Z","title_canon_sha256":"7e0dde5491689ad3a4e24bdd1cd5cde5b5d39b2889df08694974b17d24477784"},"schema_version":"1.0","source":{"id":"1801.02442","kind":"arxiv","version":1}},"canonical_sha256":"21d526b0cf6f6bb5ec0f863efcb8f91701448d44ce62421a3d3f6fef5f437834","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21d526b0cf6f6bb5ec0f863efcb8f91701448d44ce62421a3d3f6fef5f437834","first_computed_at":"2026-05-18T00:26:31.605574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:31.605574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OXPO8wiuwt6gIx0r9RfZMnFXmfbqa3K8e4bvrMoY0oho3R41ALIJ/wrreHmwlSOI1iot58B63yipn3fRW693CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:31.606228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:811771c28dd279d2bcdcdd59e3d0ce888679f683bf95c8a6dcec79eccb6f7a21","sha256:dd1be9c288a73e12a3caa35f383f3ad64130731bfa8aa2bd23f1119cec9c6cfb"],"state_sha256":"25d2b20d4a95876f99be4ad9fbfff5ba307b75763cbcb52f14b8b64259855d68"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tx/UZeHtb25w2tb97ySkAGCLO+Ap3x6wgW4ZrRH5eROG2sWOIA4fty0Hx1HESeceBJrF5EeXioBJUuDbtjaYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:42:00.381850Z","bundle_sha256":"a5099a6a747e459b723ae0982aa1e98b99f88392dd139a50454fa443ba0bbbde"}}