{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:EVVAP57UCIUCM76UI72JMSKPCY","short_pith_number":"pith:EVVAP57U","schema_version":"1.0","canonical_sha256":"256a07f7f41228267fd447f496494f163489afdcad29b5aa6a1dd89bf7f4a504","source":{"kind":"arxiv","id":"2004.01571","version":3},"attestation_state":"computed","paper":{"title":"Tree-AMP: Compositional Inference with Tree Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","eess.SP","math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ML","authors_text":"Antoine Baker, Benjamin Aubin, Florent Krzakala, Lenka Zdeborov\\'a","submitted_at":"2020-04-03T13:51:10Z","abstract_excerpt":"We introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several approximate message passing algorithms previously derived for a variety of machine learning tasks such as generalized linear models, inference in multi-layer networks, matrix factorization, and reconstruction using non-separable penalties. For some models, the asymptotic performance of the algorithm can be theoretically predicted by the state evolution, and the measurements entro"},"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":"2004.01571","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2020-04-03T13:51:10Z","cross_cats_sorted":["cond-mat.dis-nn","cs.LG","eess.SP","math.ST","stat.CO","stat.TH"],"title_canon_sha256":"29fe5539c584b99ab70ed689e949f647bdac60e1bdbf7354a87b46347f82b397","abstract_canon_sha256":"0bad8e7741bd6b1dbd0281a03b5477755a8e41478509b0f6b90d19884de4a546"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:54.449559Z","signature_b64":"PRK23FE9BDoxgdnYIYnr21+4YuO1khAblhPGbACGwMuhYqPOgaeeJ79tEk2xnrRuFr1a2aj0Lc9pWLtbmWqIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"256a07f7f41228267fd447f496494f163489afdcad29b5aa6a1dd89bf7f4a504","last_reissued_at":"2026-07-05T06:01:54.449126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:54.449126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-AMP: Compositional Inference with Tree Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","cs.LG","eess.SP","math.ST","stat.CO","stat.TH"],"primary_cat":"stat.ML","authors_text":"Antoine Baker, Benjamin Aubin, Florent Krzakala, Lenka Zdeborov\\'a","submitted_at":"2020-04-03T13:51:10Z","abstract_excerpt":"We introduce Tree-AMP, standing for Tree Approximate Message Passing, a python package for compositional inference in high-dimensional tree-structured models. The package provides a unifying framework to study several approximate message passing algorithms previously derived for a variety of machine learning tasks such as generalized linear models, inference in multi-layer networks, matrix factorization, and reconstruction using non-separable penalties. For some models, the asymptotic performance of the algorithm can be theoretically predicted by the state evolution, and the measurements entro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.01571","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2004.01571/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2004.01571","created_at":"2026-07-05T06:01:54.449181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.01571v3","created_at":"2026-07-05T06:01:54.449181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.01571","created_at":"2026-07-05T06:01:54.449181+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVVAP57UCIUC","created_at":"2026-07-05T06:01:54.449181+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVVAP57UCIUCM76U","created_at":"2026-07-05T06:01:54.449181+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVVAP57U","created_at":"2026-07-05T06:01:54.449181+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15688","citing_title":"$\\alpha$-TCAV: A Unified Framework for Testing with Concept Activation Vectors","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY","json":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY.json","graph_json":"https://pith.science/api/pith-number/EVVAP57UCIUCM76UI72JMSKPCY/graph.json","events_json":"https://pith.science/api/pith-number/EVVAP57UCIUCM76UI72JMSKPCY/events.json","paper":"https://pith.science/paper/EVVAP57U"},"agent_actions":{"view_html":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY","download_json":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY.json","view_paper":"https://pith.science/paper/EVVAP57U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.01571&json=true","fetch_graph":"https://pith.science/api/pith-number/EVVAP57UCIUCM76UI72JMSKPCY/graph.json","fetch_events":"https://pith.science/api/pith-number/EVVAP57UCIUCM76UI72JMSKPCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY/action/storage_attestation","attest_author":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY/action/author_attestation","sign_citation":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY/action/citation_signature","submit_replication":"https://pith.science/pith/EVVAP57UCIUCM76UI72JMSKPCY/action/replication_record"}},"created_at":"2026-07-05T06:01:54.449181+00:00","updated_at":"2026-07-05T06:01:54.449181+00:00"}