{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EUOF7GJJANHE6PDEYZCJFTHBHS","short_pith_number":"pith:EUOF7GJJ","schema_version":"1.0","canonical_sha256":"251c5f9929034e4f3c64c64492cce13cb0d0cc4fa435816b72e9e1a904d579fc","source":{"kind":"arxiv","id":"2401.03626","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Vector Message Passing for Generalized Bilinear Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Hao Jiang, Qinghua Guo, Xiaojun Yuan","submitted_at":"2024-01-08T02:08:54Z","abstract_excerpt":"In this paper, we propose a new message passing algorithm that utilizes hybrid vector message passing (HVMP) to solve the generalized bilinear factorization (GBF) problem. The proposed GBF-HVMP algorithm integrates expectation propagation (EP) and variational message passing (VMP) via variational free energy minimization, yielding tractable Gaussian messages. Furthermore, GBF-HVMP enables vector/matrix variables rather than scalar ones in message passing, resulting in a loop-free Bayesian network that improves convergence. Numerical results show that GBF-HVMP significantly outperforms state-of"},"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":"2401.03626","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2024-01-08T02:08:54Z","cross_cats_sorted":[],"title_canon_sha256":"3a8df42dfbeeb60ca8fb5552501fcf35a61c76bfed4d7ede91ba8271d41d63cd","abstract_canon_sha256":"091dea33bc3c80eb31d5c5e78e0ef3dcc5904fdd555fd5e320e266ea6280e978"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:31:11.737530Z","signature_b64":"2XO+fvBzSWSHzenm++m98WhffrOfUCnwR6F25HNhhABgF1qqkwLAcBofspx8M/eJI86p0o6WcG+7nzVT5vdOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"251c5f9929034e4f3c64c64492cce13cb0d0cc4fa435816b72e9e1a904d579fc","last_reissued_at":"2026-07-05T07:31:11.736831Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:31:11.736831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Vector Message Passing for Generalized Bilinear Factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Hao Jiang, Qinghua Guo, Xiaojun Yuan","submitted_at":"2024-01-08T02:08:54Z","abstract_excerpt":"In this paper, we propose a new message passing algorithm that utilizes hybrid vector message passing (HVMP) to solve the generalized bilinear factorization (GBF) problem. The proposed GBF-HVMP algorithm integrates expectation propagation (EP) and variational message passing (VMP) via variational free energy minimization, yielding tractable Gaussian messages. Furthermore, GBF-HVMP enables vector/matrix variables rather than scalar ones in message passing, resulting in a loop-free Bayesian network that improves convergence. Numerical results show that GBF-HVMP significantly outperforms state-of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.03626","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/2401.03626/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":"2401.03626","created_at":"2026-07-05T07:31:11.736921+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.03626v1","created_at":"2026-07-05T07:31:11.736921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.03626","created_at":"2026-07-05T07:31:11.736921+00:00"},{"alias_kind":"pith_short_12","alias_value":"EUOF7GJJANHE","created_at":"2026-07-05T07:31:11.736921+00:00"},{"alias_kind":"pith_short_16","alias_value":"EUOF7GJJANHE6PDE","created_at":"2026-07-05T07:31:11.736921+00:00"},{"alias_kind":"pith_short_8","alias_value":"EUOF7GJJ","created_at":"2026-07-05T07:31:11.736921+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00884","citing_title":"Near-Field Multiuser Localization Based on Extremely Large Antenna Array with Limited RF Chains","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS","json":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS.json","graph_json":"https://pith.science/api/pith-number/EUOF7GJJANHE6PDEYZCJFTHBHS/graph.json","events_json":"https://pith.science/api/pith-number/EUOF7GJJANHE6PDEYZCJFTHBHS/events.json","paper":"https://pith.science/paper/EUOF7GJJ"},"agent_actions":{"view_html":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS","download_json":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS.json","view_paper":"https://pith.science/paper/EUOF7GJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.03626&json=true","fetch_graph":"https://pith.science/api/pith-number/EUOF7GJJANHE6PDEYZCJFTHBHS/graph.json","fetch_events":"https://pith.science/api/pith-number/EUOF7GJJANHE6PDEYZCJFTHBHS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS/action/storage_attestation","attest_author":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS/action/author_attestation","sign_citation":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS/action/citation_signature","submit_replication":"https://pith.science/pith/EUOF7GJJANHE6PDEYZCJFTHBHS/action/replication_record"}},"created_at":"2026-07-05T07:31:11.736921+00:00","updated_at":"2026-07-05T07:31:11.736921+00:00"}