{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:XXZFR4THDDFDHYID4MKS5E7N7I","short_pith_number":"pith:XXZFR4TH","schema_version":"1.0","canonical_sha256":"bdf258f26718ca33e103e3152e93edfa2d6fead1c1a07bf612b70a165504f307","source":{"kind":"arxiv","id":"2306.17837","version":5},"attestation_state":"computed","paper":{"title":"Gauging tensor networks with belief propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Joseph Tindall, Matthew T. Fishman","submitted_at":"2023-06-30T17:56:15Z","abstract_excerpt":"Effectively compressing and optimizing tensor networks requires reliable methods for fixing the latent degrees of freedom of the tensors, known as the gauge. Here we introduce a new algorithm for gauging tensor networks using belief propagation, a method that was originally formulated for performing statistical inference on graphical models and has recently found applications in tensor network algorithms. We show that this method is closely related to known tensor network gauging methods. It has the practical advantage, however, that existing belief propagation implementations can be repurpose"},"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":"2306.17837","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-06-30T17:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"182647351f2dc0816a06e0f336eea3a0683cb008fb17b2da645e01b0bf0efdee","abstract_canon_sha256":"c8f393457c0f2fc911e6a4cbcfa045b6588934441faa9b20bb07bd6b2a284be4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:15.939356Z","signature_b64":"rij4SWYNKxbDUTKtztNr91F+g4jDeZ5pjWR0LsayOcqd2PZpIJPiID0gLGrScLxnO3VK6V3s1okul7LjbXvvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdf258f26718ca33e103e3152e93edfa2d6fead1c1a07bf612b70a165504f307","last_reissued_at":"2026-07-05T10:21:15.938834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:15.938834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gauging tensor networks with belief propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Joseph Tindall, Matthew T. Fishman","submitted_at":"2023-06-30T17:56:15Z","abstract_excerpt":"Effectively compressing and optimizing tensor networks requires reliable methods for fixing the latent degrees of freedom of the tensors, known as the gauge. Here we introduce a new algorithm for gauging tensor networks using belief propagation, a method that was originally formulated for performing statistical inference on graphical models and has recently found applications in tensor network algorithms. We show that this method is closely related to known tensor network gauging methods. It has the practical advantage, however, that existing belief propagation implementations can be repurpose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17837","kind":"arxiv","version":5},"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/2306.17837/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":"2306.17837","created_at":"2026-07-05T10:21:15.938890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17837v5","created_at":"2026-07-05T10:21:15.938890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17837","created_at":"2026-07-05T10:21:15.938890+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXZFR4THDDFD","created_at":"2026-07-05T10:21:15.938890+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXZFR4THDDFDHYID","created_at":"2026-07-05T10:21:15.938890+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXZFR4TH","created_at":"2026-07-05T10:21:15.938890+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27493","citing_title":"SU(4) Heisenberg model on the hyperhoneycomb lattice","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13528","citing_title":"Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I","json":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I.json","graph_json":"https://pith.science/api/pith-number/XXZFR4THDDFDHYID4MKS5E7N7I/graph.json","events_json":"https://pith.science/api/pith-number/XXZFR4THDDFDHYID4MKS5E7N7I/events.json","paper":"https://pith.science/paper/XXZFR4TH"},"agent_actions":{"view_html":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I","download_json":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I.json","view_paper":"https://pith.science/paper/XXZFR4TH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17837&json=true","fetch_graph":"https://pith.science/api/pith-number/XXZFR4THDDFDHYID4MKS5E7N7I/graph.json","fetch_events":"https://pith.science/api/pith-number/XXZFR4THDDFDHYID4MKS5E7N7I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I/action/storage_attestation","attest_author":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I/action/author_attestation","sign_citation":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I/action/citation_signature","submit_replication":"https://pith.science/pith/XXZFR4THDDFDHYID4MKS5E7N7I/action/replication_record"}},"created_at":"2026-07-05T10:21:15.938890+00:00","updated_at":"2026-07-05T10:21:15.938890+00:00"}