{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LSNLYUHTPT3UFX5JWIWFPMHEF4","short_pith_number":"pith:LSNLYUHT","canonical_record":{"source":{"id":"1612.01183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-04T21:20:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"132fd6763db7fae0f4677b9d5e8bead3d881e1576b422663f07957665e36a66d","abstract_canon_sha256":"c8aeddd7a1d982a3ca03713f7eeba2f7351a22c83ab2359566150af479205663"},"schema_version":"1.0"},"canonical_sha256":"5c9abc50f37cf742dfa9b22c57b0e42f282179c0ebfc49dcac17c7f270402d4d","source":{"kind":"arxiv","id":"1612.01183","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01183","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01183v2","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01183","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"LSNLYUHTPT3U","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSNLYUHTPT3UFX5J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSNLYUHT","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LSNLYUHTPT3UFX5JWIWFPMHEF4","target":"record","payload":{"canonical_record":{"source":{"id":"1612.01183","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-04T21:20:06Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"132fd6763db7fae0f4677b9d5e8bead3d881e1576b422663f07957665e36a66d","abstract_canon_sha256":"c8aeddd7a1d982a3ca03713f7eeba2f7351a22c83ab2359566150af479205663"},"schema_version":"1.0"},"canonical_sha256":"5c9abc50f37cf742dfa9b22c57b0e42f282179c0ebfc49dcac17c7f270402d4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:00.927655Z","signature_b64":"saVMP2KYywd2tJE+CO17uKIarm50YrPTvtBrENdZ/RjVihK/IHvjtGwMRfIemhgoPRP5f8rHkER3qsikmuZPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c9abc50f37cf742dfa9b22c57b0e42f282179c0ebfc49dcac17c7f270402d4d","last_reissued_at":"2026-05-18T00:39:00.927198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:00.927198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.01183","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-05-18T00:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw0mp0VOhvR/FkyxLJ0uowa4+UObV3oy7934qIGH1yAasqpw9kPNeAcOtfCNb/soVOKfbwlb3Qe0lujYGVoWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:32.035589Z"},"content_sha256":"be3081e0a0b6c72dd3d00d2b8d5f8dbd0b4432bf0bd20d773a7e70c781cbbebe","schema_version":"1.0","event_id":"sha256:be3081e0a0b6c72dd3d00d2b8d5f8dbd0b4432bf0bd20d773a7e70c781cbbebe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LSNLYUHTPT3UFX5JWIWFPMHEF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AMP-Inspired Deep Networks for Sparse Linear Inverse Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mark Borgerding, Philip Schniter, Sundeep Rangan","submitted_at":"2016-12-04T21:20:06Z","abstract_excerpt":"Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem, where one seeks to recover a sparse signal from a few noisy linear measurements. In this paper, we propose two novel neural-network architectures that decouple prediction errors across layers in the same way that the approximate message passing (AMP) algorithms decouple them across iterations: through Onsager correction. First, we propose a \"learned AMP\" network that significantly improves upon Gregor and LeCun's "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01183","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":""},"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:39:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FhD+eEWgdZf7JARrURAcLp9vtQW111Eir8g3MtL3o9w6agtDGe3QRc0FrNLilLucpV4/GR3lW9Hg0Vdhoae9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T02:41:32.035971Z"},"content_sha256":"7ccf1b79b6999f50d829bc24dd56fcefa04513f9027c83cd549a27dd3042dcf1","schema_version":"1.0","event_id":"sha256:7ccf1b79b6999f50d829bc24dd56fcefa04513f9027c83cd549a27dd3042dcf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/bundle.json","state_url":"https://pith.science/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/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-20T02:41:32Z","links":{"resolver":"https://pith.science/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4","bundle":"https://pith.science/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/bundle.json","state":"https://pith.science/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LSNLYUHTPT3UFX5JWIWFPMHEF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LSNLYUHTPT3UFX5JWIWFPMHEF4","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":"c8aeddd7a1d982a3ca03713f7eeba2f7351a22c83ab2359566150af479205663","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-04T21:20:06Z","title_canon_sha256":"132fd6763db7fae0f4677b9d5e8bead3d881e1576b422663f07957665e36a66d"},"schema_version":"1.0","source":{"id":"1612.01183","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.01183","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"arxiv_version","alias_value":"1612.01183v2","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01183","created_at":"2026-05-18T00:39:00Z"},{"alias_kind":"pith_short_12","alias_value":"LSNLYUHTPT3U","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LSNLYUHTPT3UFX5J","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LSNLYUHT","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:7ccf1b79b6999f50d829bc24dd56fcefa04513f9027c83cd549a27dd3042dcf1","target":"graph","created_at":"2026-05-18T00:39:00Z","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":"Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem, where one seeks to recover a sparse signal from a few noisy linear measurements. In this paper, we propose two novel neural-network architectures that decouple prediction errors across layers in the same way that the approximate message passing (AMP) algorithms decouple them across iterations: through Onsager correction. First, we propose a \"learned AMP\" network that significantly improves upon Gregor and LeCun's ","authors_text":"Mark Borgerding, Philip Schniter, Sundeep Rangan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-04T21:20:06Z","title":"AMP-Inspired Deep Networks for Sparse Linear Inverse Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01183","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:be3081e0a0b6c72dd3d00d2b8d5f8dbd0b4432bf0bd20d773a7e70c781cbbebe","target":"record","created_at":"2026-05-18T00:39:00Z","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":"c8aeddd7a1d982a3ca03713f7eeba2f7351a22c83ab2359566150af479205663","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-12-04T21:20:06Z","title_canon_sha256":"132fd6763db7fae0f4677b9d5e8bead3d881e1576b422663f07957665e36a66d"},"schema_version":"1.0","source":{"id":"1612.01183","kind":"arxiv","version":2}},"canonical_sha256":"5c9abc50f37cf742dfa9b22c57b0e42f282179c0ebfc49dcac17c7f270402d4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c9abc50f37cf742dfa9b22c57b0e42f282179c0ebfc49dcac17c7f270402d4d","first_computed_at":"2026-05-18T00:39:00.927198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:00.927198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"saVMP2KYywd2tJE+CO17uKIarm50YrPTvtBrENdZ/RjVihK/IHvjtGwMRfIemhgoPRP5f8rHkER3qsikmuZPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:00.927655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.01183","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be3081e0a0b6c72dd3d00d2b8d5f8dbd0b4432bf0bd20d773a7e70c781cbbebe","sha256:7ccf1b79b6999f50d829bc24dd56fcefa04513f9027c83cd549a27dd3042dcf1"],"state_sha256":"99f49beb1fa6ddcd965effe3b5495e7630d65fe14c8fb8c36813a2362c2ccf7d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdSJrnIK3Mz7zUyQ4xJz5umn/iEl2Es6MT4HkwjPRbuAaCxIhVx8lGKUUcxWVdSn5BPRElHXDLodksYl/yR9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T02:41:32.038056Z","bundle_sha256":"065c6139dc6d5a69671bb50108564bbd8dfdf59bcc2e76b73242d3bac23e860d"}}