{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:54CPZR5P6WGXKX3AJR5AVMWI7U","short_pith_number":"pith:54CPZR5P","schema_version":"1.0","canonical_sha256":"ef04fcc7aff58d755f604c7a0ab2c8fd3ed9b9a5a694cb9c3345eeb0551901d0","source":{"kind":"arxiv","id":"1807.01296","version":1},"attestation_state":"computed","paper":{"title":"Approximate Survey Propagation for Statistical Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cond-mat.dis-nn","authors_text":"Fabrizio Antenucci, Florent Krzakala, Lenka Zdeborov\\'a, Pierfrancesco Urbani","submitted_at":"2018-07-03T17:28:01Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.01296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2018-07-03T17:28:01Z","cross_cats_sorted":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"cb026b0a7b770e5f5d6f6c8b3c9db59156d70f0c9454b09e160e481d6d1d61d9","abstract_canon_sha256":"140ce485753f9cc8b0ac2b13f0500f8b2a13ea756bc0162b5ac036471a5adc3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:39.470482Z","signature_b64":"f2pU6vRvwMK7mkUJf8MCrkX09Y9q5jkPkDqrDguqWEnbawxoA22Cd3wWxklTObivtJcDj4ZnkHJGaUuCyMobAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef04fcc7aff58d755f604c7a0ab2c8fd3ed9b9a5a694cb9c3345eeb0551901d0","last_reissued_at":"2026-05-17T23:54:39.469993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:39.469993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Survey Propagation for Statistical Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cond-mat.dis-nn","authors_text":"Fabrizio Antenucci, Florent Krzakala, Lenka Zdeborov\\'a, Pierfrancesco Urbani","submitted_at":"2018-07-03T17:28:01Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.01296","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.01296","created_at":"2026-05-17T23:54:39.470067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.01296v1","created_at":"2026-05-17T23:54:39.470067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.01296","created_at":"2026-05-17T23:54:39.470067+00:00"},{"alias_kind":"pith_short_12","alias_value":"54CPZR5P6WGX","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"54CPZR5P6WGXKX3A","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"54CPZR5P","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U","json":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U.json","graph_json":"https://pith.science/api/pith-number/54CPZR5P6WGXKX3AJR5AVMWI7U/graph.json","events_json":"https://pith.science/api/pith-number/54CPZR5P6WGXKX3AJR5AVMWI7U/events.json","paper":"https://pith.science/paper/54CPZR5P"},"agent_actions":{"view_html":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U","download_json":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U.json","view_paper":"https://pith.science/paper/54CPZR5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.01296&json=true","fetch_graph":"https://pith.science/api/pith-number/54CPZR5P6WGXKX3AJR5AVMWI7U/graph.json","fetch_events":"https://pith.science/api/pith-number/54CPZR5P6WGXKX3AJR5AVMWI7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U/action/storage_attestation","attest_author":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U/action/author_attestation","sign_citation":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U/action/citation_signature","submit_replication":"https://pith.science/pith/54CPZR5P6WGXKX3AJR5AVMWI7U/action/replication_record"}},"created_at":"2026-05-17T23:54:39.470067+00:00","updated_at":"2026-05-17T23:54:39.470067+00:00"}