{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CM4BFVXAGHTOQMS4WQA7QNRKZJ","short_pith_number":"pith:CM4BFVXA","schema_version":"1.0","canonical_sha256":"133812d6e031e6e8325cb401f8362aca5926e792beb63d569f7142cb2ad1d634","source":{"kind":"arxiv","id":"1401.6500","version":2},"attestation_state":"computed","paper":{"title":"Holographic Transformation for Quantum Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Ryuhei Mori","submitted_at":"2014-01-25T05:56:43Z","abstract_excerpt":"Recently, a general tool called a holographic transformation, which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In this work, the holographic transformation is generalized to quantum factor graphs."},"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":"1401.6500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-25T05:56:43Z","cross_cats_sorted":["cond-mat.stat-mech","math.IT","quant-ph"],"title_canon_sha256":"009d3323c71854a8259944d412e6310ab77933df9627e84e7a7af298145d4fdc","abstract_canon_sha256":"e07ec34d51f5b6bd2c36d612d2685374332b57a1e0bfc5c308935f99b16a92e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:00.171083Z","signature_b64":"RYdqEhU1CSgAuSbfV2RYZIYm62ZkS8eIlRrDwVIWZYlYoJR40vamvZSUOTO0grZZGYr4pEiaQUbSHX8wDQugCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"133812d6e031e6e8325cb401f8362aca5926e792beb63d569f7142cb2ad1d634","last_reissued_at":"2026-05-18T03:00:00.170344Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:00.170344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Holographic Transformation for Quantum Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Ryuhei Mori","submitted_at":"2014-01-25T05:56:43Z","abstract_excerpt":"Recently, a general tool called a holographic transformation, which transforms an expression of the partition function to another form, has been used for polynomial-time algorithms and for improvement and understanding of the belief propagation. In this work, the holographic transformation is generalized to quantum factor graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6500","kind":"arxiv","version":2},"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":"1401.6500","created_at":"2026-05-18T03:00:00.170465+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6500v2","created_at":"2026-05-18T03:00:00.170465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6500","created_at":"2026-05-18T03:00:00.170465+00:00"},{"alias_kind":"pith_short_12","alias_value":"CM4BFVXAGHTO","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CM4BFVXAGHTOQMS4","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CM4BFVXA","created_at":"2026-05-18T12:28:22.404517+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/CM4BFVXAGHTOQMS4WQA7QNRKZJ","json":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ.json","graph_json":"https://pith.science/api/pith-number/CM4BFVXAGHTOQMS4WQA7QNRKZJ/graph.json","events_json":"https://pith.science/api/pith-number/CM4BFVXAGHTOQMS4WQA7QNRKZJ/events.json","paper":"https://pith.science/paper/CM4BFVXA"},"agent_actions":{"view_html":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ","download_json":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ.json","view_paper":"https://pith.science/paper/CM4BFVXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6500&json=true","fetch_graph":"https://pith.science/api/pith-number/CM4BFVXAGHTOQMS4WQA7QNRKZJ/graph.json","fetch_events":"https://pith.science/api/pith-number/CM4BFVXAGHTOQMS4WQA7QNRKZJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ/action/storage_attestation","attest_author":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ/action/author_attestation","sign_citation":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ/action/citation_signature","submit_replication":"https://pith.science/pith/CM4BFVXAGHTOQMS4WQA7QNRKZJ/action/replication_record"}},"created_at":"2026-05-18T03:00:00.170465+00:00","updated_at":"2026-05-18T03:00:00.170465+00:00"}