{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:54CPZR5P6WGXKX3AJR5AVMWI7U","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":"140ce485753f9cc8b0ac2b13f0500f8b2a13ea756bc0162b5ac036471a5adc3b","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-07-03T17:28:01Z","title_canon_sha256":"cb026b0a7b770e5f5d6f6c8b3c9db59156d70f0c9454b09e160e481d6d1d61d9"},"schema_version":"1.0","source":{"id":"1807.01296","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.01296","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"arxiv_version","alias_value":"1807.01296v1","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01296","created_at":"2026-05-17T23:54:39Z"},{"alias_kind":"pith_short_12","alias_value":"54CPZR5P6WGX","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"54CPZR5P6WGXKX3A","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"54CPZR5P","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:cd2ded6e5f9227beb2d9e3f50961a7d2682ef965f3e323958fd6958069fa6376","target":"graph","created_at":"2026-05-17T23:54:39Z","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":"Approximate message passing algorithm enjoyed considerable attention in the last decade. In this paper we introduce a variant of the AMP algorithm that takes into account glassy nature of the system under consideration. We coin this algorithm as the approximate survey propagation (ASP) and derive it for a class of low-rank matrix estimation problems. We derive the state evolution for the ASP algorithm and prove that it reproduces the one-step replica symmetry breaking (1RSB) fixed-point equations, well-known in physics of disordered systems. Our derivation thus gives a concrete algorithmic mea","authors_text":"Fabrizio Antenucci, Florent Krzakala, Lenka Zdeborov\\'a, Pierfrancesco Urbani","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-07-03T17:28:01Z","title":"Approximate Survey Propagation for Statistical Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01296","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:315f54f24c2a05b43a431088e92770541ab8db9ecf3d1464351a24130ce9c4c7","target":"record","created_at":"2026-05-17T23:54:39Z","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":"140ce485753f9cc8b0ac2b13f0500f8b2a13ea756bc0162b5ac036471a5adc3b","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-07-03T17:28:01Z","title_canon_sha256":"cb026b0a7b770e5f5d6f6c8b3c9db59156d70f0c9454b09e160e481d6d1d61d9"},"schema_version":"1.0","source":{"id":"1807.01296","kind":"arxiv","version":1}},"canonical_sha256":"ef04fcc7aff58d755f604c7a0ab2c8fd3ed9b9a5a694cb9c3345eeb0551901d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef04fcc7aff58d755f604c7a0ab2c8fd3ed9b9a5a694cb9c3345eeb0551901d0","first_computed_at":"2026-05-17T23:54:39.469993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:39.469993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f2pU6vRvwMK7mkUJf8MCrkX09Y9q5jkPkDqrDguqWEnbawxoA22Cd3wWxklTObivtJcDj4ZnkHJGaUuCyMobAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:39.470482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.01296","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:315f54f24c2a05b43a431088e92770541ab8db9ecf3d1464351a24130ce9c4c7","sha256:cd2ded6e5f9227beb2d9e3f50961a7d2682ef965f3e323958fd6958069fa6376"],"state_sha256":"081c880840d6ecfd4e84117845aabeeb22ad2f7520075b662b5d92bfce4d19fa"}