{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MRIU5ZAFD36MMPQAQRAISAZEH2","short_pith_number":"pith:MRIU5ZAF","canonical_record":{"source":{"id":"1605.01636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-05T15:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"2a01464255ddce344de6eff6cd5c87bde8dc98e19625c7cf681f2a5e819157ca","abstract_canon_sha256":"16740ad6b740d24d966eaf90f239a01e1993faed688f782b116e5a95c46bd072"},"schema_version":"1.0"},"canonical_sha256":"64514ee4051efcc63e0084408903243eaa8de61c72769fe15a69b4ce43dda8a5","source":{"kind":"arxiv","id":"1605.01636","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01636","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01636v2","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01636","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"MRIU5ZAFD36M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRIU5ZAFD36MMPQA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRIU5ZAF","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MRIU5ZAFD36MMPQAQRAISAZEH2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01636","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-05T15:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"2a01464255ddce344de6eff6cd5c87bde8dc98e19625c7cf681f2a5e819157ca","abstract_canon_sha256":"16740ad6b740d24d966eaf90f239a01e1993faed688f782b116e5a95c46bd072"},"schema_version":"1.0"},"canonical_sha256":"64514ee4051efcc63e0084408903243eaa8de61c72769fe15a69b4ce43dda8a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:13.324683Z","signature_b64":"1+GRcG8CDdY/smw+FMLxd0aJTEk4JE8ngvlASykc2II/WS62fUxVlbMQY9pApE5Pht7Ff/yI525mUHF3koEtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64514ee4051efcc63e0084408903243eaa8de61c72769fe15a69b4ce43dda8a5","last_reissued_at":"2026-05-18T01:15:13.324165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:13.324165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01636","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-18T01:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqwVy7TkTM2Ppjtqt3Dnz+4LYwYt8Kcy0v/m5M/POc56aymO8uYeKTv8cXV3rmB0ikL68S8EI64X3PsOGzJ7Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:58:08.928396Z"},"content_sha256":"9477896ca27105233c4434a7de4e007176c1d43ba73246b1344664e025960881","schema_version":"1.0","event_id":"sha256:9477896ca27105233c4434a7de4e007176c1d43ba73246b1344664e025960881"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MRIU5ZAFD36MMPQAQRAISAZEH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximal Sparsity with Deep Networks?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bo Xin, David Wipf, Wen Gao, Yizhou Wang","submitted_at":"2016-05-05T15:58:55Z","abstract_excerpt":"The iterations of many sparse estimation algorithms are comprised of a fixed linear filter cascaded with a thresholding nonlinearity, which collectively resemble a typical neural network layer. Consequently, a lengthy sequence of algorithm iterations can be viewed as a deep network with shared, hand-crafted layer weights. It is therefore quite natural to examine the degree to which a learned network model might act as a viable surrogate for traditional sparse estimation in domains where ample training data is available. While the possibility of a reduced computational budget is readily apparen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01636","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-18T01:15:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k7aNFbFWh8H1c8rptohQYLauiyeB2WgP8h47ycRQR6llwQrGfowEzwNGgLQdrojrkzcPeegNpvU/7XDjyBJjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:58:08.929052Z"},"content_sha256":"839d23bb507d9d975df5db4dac385a6a0d0e61e9c5b6c7be399e91d5a9e4e174","schema_version":"1.0","event_id":"sha256:839d23bb507d9d975df5db4dac385a6a0d0e61e9c5b6c7be399e91d5a9e4e174"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/bundle.json","state_url":"https://pith.science/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/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-05-26T14:58:08Z","links":{"resolver":"https://pith.science/pith/MRIU5ZAFD36MMPQAQRAISAZEH2","bundle":"https://pith.science/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/bundle.json","state":"https://pith.science/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRIU5ZAFD36MMPQAQRAISAZEH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MRIU5ZAFD36MMPQAQRAISAZEH2","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":"16740ad6b740d24d966eaf90f239a01e1993faed688f782b116e5a95c46bd072","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-05T15:58:55Z","title_canon_sha256":"2a01464255ddce344de6eff6cd5c87bde8dc98e19625c7cf681f2a5e819157ca"},"schema_version":"1.0","source":{"id":"1605.01636","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01636","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01636v2","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01636","created_at":"2026-05-18T01:15:13Z"},{"alias_kind":"pith_short_12","alias_value":"MRIU5ZAFD36M","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRIU5ZAFD36MMPQA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRIU5ZAF","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:839d23bb507d9d975df5db4dac385a6a0d0e61e9c5b6c7be399e91d5a9e4e174","target":"graph","created_at":"2026-05-18T01:15:13Z","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":"The iterations of many sparse estimation algorithms are comprised of a fixed linear filter cascaded with a thresholding nonlinearity, which collectively resemble a typical neural network layer. Consequently, a lengthy sequence of algorithm iterations can be viewed as a deep network with shared, hand-crafted layer weights. It is therefore quite natural to examine the degree to which a learned network model might act as a viable surrogate for traditional sparse estimation in domains where ample training data is available. While the possibility of a reduced computational budget is readily apparen","authors_text":"Bo Xin, David Wipf, Wen Gao, Yizhou Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-05T15:58:55Z","title":"Maximal Sparsity with Deep Networks?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01636","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:9477896ca27105233c4434a7de4e007176c1d43ba73246b1344664e025960881","target":"record","created_at":"2026-05-18T01:15:13Z","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":"16740ad6b740d24d966eaf90f239a01e1993faed688f782b116e5a95c46bd072","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-05T15:58:55Z","title_canon_sha256":"2a01464255ddce344de6eff6cd5c87bde8dc98e19625c7cf681f2a5e819157ca"},"schema_version":"1.0","source":{"id":"1605.01636","kind":"arxiv","version":2}},"canonical_sha256":"64514ee4051efcc63e0084408903243eaa8de61c72769fe15a69b4ce43dda8a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64514ee4051efcc63e0084408903243eaa8de61c72769fe15a69b4ce43dda8a5","first_computed_at":"2026-05-18T01:15:13.324165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:13.324165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1+GRcG8CDdY/smw+FMLxd0aJTEk4JE8ngvlASykc2II/WS62fUxVlbMQY9pApE5Pht7Ff/yI525mUHF3koEtCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:13.324683Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01636","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9477896ca27105233c4434a7de4e007176c1d43ba73246b1344664e025960881","sha256:839d23bb507d9d975df5db4dac385a6a0d0e61e9c5b6c7be399e91d5a9e4e174"],"state_sha256":"51a169f8a63fd9f395b0aee9a2b601dade35291440beb18b8075aa74d9ec4997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HioHySVhE3aZyOTHiOuVc22rXZACqUYTw4pRrqbkAC4LTU2BDpTcEikIIl8/33ph/4bh/O5c5peHfqaIDwR5Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:58:08.933027Z","bundle_sha256":"8fc2599e47a2deaabca1c9ef64e2ec15db60e63ac290e832a0d550f45074d7c7"}}