{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NL5OUSI53VQTP47P4NKJDM5NH7","short_pith_number":"pith:NL5OUSI5","canonical_record":{"source":{"id":"1709.01112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T18:46:19Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"882e3dbd25108453dc60f9b0436ddb6ca09abfb220cfd1e8b485de9c3ac0b2bb","abstract_canon_sha256":"af77b051cfa5bd8a0cae1a4b7479d4c11977b2ec11a4ac95427a0f7a871b7488"},"schema_version":"1.0"},"canonical_sha256":"6afaea491ddd6137f3efe35491b3ad3fcdd91ddcf901c608d9086ae9dee2617d","source":{"kind":"arxiv","id":"1709.01112","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01112","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01112v2","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01112","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"NL5OUSI53VQT","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NL5OUSI53VQTP47P","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NL5OUSI5","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NL5OUSI53VQTP47P4NKJDM5NH7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.01112","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T18:46:19Z","cross_cats_sorted":["math.IT","stat.ML"],"title_canon_sha256":"882e3dbd25108453dc60f9b0436ddb6ca09abfb220cfd1e8b485de9c3ac0b2bb","abstract_canon_sha256":"af77b051cfa5bd8a0cae1a4b7479d4c11977b2ec11a4ac95427a0f7a871b7488"},"schema_version":"1.0"},"canonical_sha256":"6afaea491ddd6137f3efe35491b3ad3fcdd91ddcf901c608d9086ae9dee2617d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:12.723024Z","signature_b64":"p2hLpEkjo2gmFuEXp8dWV235bsQ9AUt/MqRCpvRsyh5Bbxz+8IIlfVGyi+HBaMCe5e79AGYDhtRH33kNkCwjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6afaea491ddd6137f3efe35491b3ad3fcdd91ddcf901c608d9086ae9dee2617d","last_reissued_at":"2026-05-18T00:34:12.722496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:12.722496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.01112","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:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65nNAGbR0S57y/pN2PJ+k+9vRl/tDXhlCjIS0dSMnbjcJFEB2v98iAjjVLtS/5u3CwUB4U52FwwtMf/8tXCaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:30:05.995171Z"},"content_sha256":"24ca6f157be387813261fabb83238d9422ef1f552c1167ffda04e6e471447da0","schema_version":"1.0","event_id":"sha256:24ca6f157be387813261fabb83238d9422ef1f552c1167ffda04e6e471447da0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NL5OUSI53VQTP47P4NKJDM5NH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal deep neural networks for sparse recovery via Laplace techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","stat.ML"],"primary_cat":"cs.IT","authors_text":"Slawomir Stanczak, Steffen Limmer","submitted_at":"2017-09-04T18:46:19Z","abstract_excerpt":"This paper introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we recast the problem of MMSE estimation (w.r.t. a pre-defined uniform input distribution) as the problem of computing the centroid of some polytope that results from the intersection of the simplex and an affine subspace determined by the measurements. Owing to the specific structure, it is shown that the centroid can be computed analytically by extending a recent result that facilitates the volume computation of poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01112","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:34:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rhAvKAiLd0jA5NiRNQgu8SAjGCunuuOePPcrobUquYfxTmh4bqgjMyAmVLd5BC/rwV5xTAzNgdmYHsiVntinBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:30:05.995668Z"},"content_sha256":"1329b2688d94d2552171fede87813e3e124af5032313beacc30e39e9a7108ca7","schema_version":"1.0","event_id":"sha256:1329b2688d94d2552171fede87813e3e124af5032313beacc30e39e9a7108ca7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NL5OUSI53VQTP47P4NKJDM5NH7/bundle.json","state_url":"https://pith.science/pith/NL5OUSI53VQTP47P4NKJDM5NH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NL5OUSI53VQTP47P4NKJDM5NH7/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-23T01:30:05Z","links":{"resolver":"https://pith.science/pith/NL5OUSI53VQTP47P4NKJDM5NH7","bundle":"https://pith.science/pith/NL5OUSI53VQTP47P4NKJDM5NH7/bundle.json","state":"https://pith.science/pith/NL5OUSI53VQTP47P4NKJDM5NH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NL5OUSI53VQTP47P4NKJDM5NH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NL5OUSI53VQTP47P4NKJDM5NH7","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":"af77b051cfa5bd8a0cae1a4b7479d4c11977b2ec11a4ac95427a0f7a871b7488","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T18:46:19Z","title_canon_sha256":"882e3dbd25108453dc60f9b0436ddb6ca09abfb220cfd1e8b485de9c3ac0b2bb"},"schema_version":"1.0","source":{"id":"1709.01112","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01112","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01112v2","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01112","created_at":"2026-05-18T00:34:12Z"},{"alias_kind":"pith_short_12","alias_value":"NL5OUSI53VQT","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NL5OUSI53VQTP47P","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NL5OUSI5","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:1329b2688d94d2552171fede87813e3e124af5032313beacc30e39e9a7108ca7","target":"graph","created_at":"2026-05-18T00:34:12Z","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 introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we recast the problem of MMSE estimation (w.r.t. a pre-defined uniform input distribution) as the problem of computing the centroid of some polytope that results from the intersection of the simplex and an affine subspace determined by the measurements. Owing to the specific structure, it is shown that the centroid can be computed analytically by extending a recent result that facilitates the volume computation of poly","authors_text":"Slawomir Stanczak, Steffen Limmer","cross_cats":["math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T18:46:19Z","title":"Optimal deep neural networks for sparse recovery via Laplace techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01112","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:24ca6f157be387813261fabb83238d9422ef1f552c1167ffda04e6e471447da0","target":"record","created_at":"2026-05-18T00:34:12Z","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":"af77b051cfa5bd8a0cae1a4b7479d4c11977b2ec11a4ac95427a0f7a871b7488","cross_cats_sorted":["math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-09-04T18:46:19Z","title_canon_sha256":"882e3dbd25108453dc60f9b0436ddb6ca09abfb220cfd1e8b485de9c3ac0b2bb"},"schema_version":"1.0","source":{"id":"1709.01112","kind":"arxiv","version":2}},"canonical_sha256":"6afaea491ddd6137f3efe35491b3ad3fcdd91ddcf901c608d9086ae9dee2617d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6afaea491ddd6137f3efe35491b3ad3fcdd91ddcf901c608d9086ae9dee2617d","first_computed_at":"2026-05-18T00:34:12.722496Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:12.722496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p2hLpEkjo2gmFuEXp8dWV235bsQ9AUt/MqRCpvRsyh5Bbxz+8IIlfVGyi+HBaMCe5e79AGYDhtRH33kNkCwjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:12.723024Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01112","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24ca6f157be387813261fabb83238d9422ef1f552c1167ffda04e6e471447da0","sha256:1329b2688d94d2552171fede87813e3e124af5032313beacc30e39e9a7108ca7"],"state_sha256":"45994aac21648e3bc932f1ea4101fc52f2ae795f0ff3e40ac7b08733df4855e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yUZfW3dS00rrQUUJXrpp9YmJYF9/pKg7TruryyZnDVOoVOJz5e6jPqCbFH+our2uR7a628+uQf55ithnbXqqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:30:05.998335Z","bundle_sha256":"4dca34201115f845593535278163d889d00bc334146d52ca5900c29a5a41e6c5"}}