{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DO45PSNW46WBMZ5PK6LIL4DFLM","short_pith_number":"pith:DO45PSNW","schema_version":"1.0","canonical_sha256":"1bb9d7c9b6e7ac1667af579685f0655b32b1f603646e99741fb0aef4d80f4897","source":{"kind":"arxiv","id":"2009.06854","version":1},"attestation_state":"computed","paper":{"title":"Bilinear Generalized Vector Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amine Mezghani, Anis Housseini, Faouzi Bellili, Mohamed Akrout","submitted_at":"2020-09-15T03:46:46Z","abstract_excerpt":"We introduce the bilinear generalized vector approximate message passing (BiG-VAMP) algorithm which jointly recovers two matrices U and V from their noisy product through a probabilistic observation model. BiG-VAMP provides computationally efficient approximate implementations of both max-sum and sumproduct loopy belief propagation (BP). We show how the proposed BiG-VAMP algorithm recovers different types of structured matrices and overcomes the fundamental limitations of other state-of-the-art approaches to the bilinear recovery problem, such as BiG-AMP, BAd-VAMP and LowRAMP. In essence, BiG-"},"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":"2009.06854","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2020-09-15T03:46:46Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"c2f127137eacb06082a2f42636c69f220a75373308ca71c5662014d022978059","abstract_canon_sha256":"e4703b9a85a7e439e0ebdb1a1a4b58731519813ebedfc38b71a5f9b230d6e1be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:35:38.612247Z","signature_b64":"9jWPGbAoY0r1Tju7159Gp2S3OUi04HARm7xb9DlSo0mdlwEsLoGOGYNkobTLEax/IBEYGoVE4PAgSxSphkRlAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bb9d7c9b6e7ac1667af579685f0655b32b1f603646e99741fb0aef4d80f4897","last_reissued_at":"2026-07-05T01:35:38.611855Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:35:38.611855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bilinear Generalized Vector Approximate Message Passing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Amine Mezghani, Anis Housseini, Faouzi Bellili, Mohamed Akrout","submitted_at":"2020-09-15T03:46:46Z","abstract_excerpt":"We introduce the bilinear generalized vector approximate message passing (BiG-VAMP) algorithm which jointly recovers two matrices U and V from their noisy product through a probabilistic observation model. BiG-VAMP provides computationally efficient approximate implementations of both max-sum and sumproduct loopy belief propagation (BP). We show how the proposed BiG-VAMP algorithm recovers different types of structured matrices and overcomes the fundamental limitations of other state-of-the-art approaches to the bilinear recovery problem, such as BiG-AMP, BAd-VAMP and LowRAMP. In essence, BiG-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06854","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.06854/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":"2009.06854","created_at":"2026-07-05T01:35:38.611917+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.06854v1","created_at":"2026-07-05T01:35:38.611917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06854","created_at":"2026-07-05T01:35:38.611917+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO45PSNW46WB","created_at":"2026-07-05T01:35:38.611917+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO45PSNW46WBMZ5P","created_at":"2026-07-05T01:35:38.611917+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO45PSNW","created_at":"2026-07-05T01:35:38.611917+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/DO45PSNW46WBMZ5PK6LIL4DFLM","json":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM.json","graph_json":"https://pith.science/api/pith-number/DO45PSNW46WBMZ5PK6LIL4DFLM/graph.json","events_json":"https://pith.science/api/pith-number/DO45PSNW46WBMZ5PK6LIL4DFLM/events.json","paper":"https://pith.science/paper/DO45PSNW"},"agent_actions":{"view_html":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM","download_json":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM.json","view_paper":"https://pith.science/paper/DO45PSNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.06854&json=true","fetch_graph":"https://pith.science/api/pith-number/DO45PSNW46WBMZ5PK6LIL4DFLM/graph.json","fetch_events":"https://pith.science/api/pith-number/DO45PSNW46WBMZ5PK6LIL4DFLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM/action/storage_attestation","attest_author":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM/action/author_attestation","sign_citation":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM/action/citation_signature","submit_replication":"https://pith.science/pith/DO45PSNW46WBMZ5PK6LIL4DFLM/action/replication_record"}},"created_at":"2026-07-05T01:35:38.611917+00:00","updated_at":"2026-07-05T01:35:38.611917+00:00"}