{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TBH326X4TNJV434YZLIC63QRVC","short_pith_number":"pith:TBH326X4","schema_version":"1.0","canonical_sha256":"984fbd7afc9b535e6f98cad02f6e11a89d34321e41ee1b6b153083eedd9a6d7b","source":{"kind":"arxiv","id":"1102.0316","version":1},"attestation_state":"computed","paper":{"title":"Partition Functions of Normal Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"G. David Forney, Jr., Pascal O. Vontobel","submitted_at":"2011-02-01T22:47:32Z","abstract_excerpt":"One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After \"normalization,\" a sum of products has a natural graphical representation, called a normal factor graph (NFG), in which vertices represent factors, edges represent internal variables, and half-edges represent the external variables of the partition function. In physics, so-called trace diagrams share similar features. We believe that the conceptual framework of representing sums of products as partition functions of NFGs is an important and intui"},"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":"1102.0316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-02-01T22:47:32Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bb179a8a2341f097dbdbd68d9efec693de2492eaeed36a0287ddac409c63b798","abstract_canon_sha256":"2101d6074fb530c9570bd7053f0b00aa93f76a4f45a3dbae51d76b395fa1f8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:00.874046Z","signature_b64":"t4dgBvkVucHCm0He9QBSQdxu1TsTfKsgvwE34E5j3kWXipTR/JnIgy9HD3TnsjcLEpcBMtVL2WFDEc5GOUAkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"984fbd7afc9b535e6f98cad02f6e11a89d34321e41ee1b6b153083eedd9a6d7b","last_reissued_at":"2026-05-18T03:48:00.873633Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:00.873633Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partition Functions of Normal Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"G. David Forney, Jr., Pascal O. Vontobel","submitted_at":"2011-02-01T22:47:32Z","abstract_excerpt":"One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After \"normalization,\" a sum of products has a natural graphical representation, called a normal factor graph (NFG), in which vertices represent factors, edges represent internal variables, and half-edges represent the external variables of the partition function. In physics, so-called trace diagrams share similar features. We believe that the conceptual framework of representing sums of products as partition functions of NFGs is an important and intui"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0316","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":""},"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":"1102.0316","created_at":"2026-05-18T03:48:00.873696+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.0316v1","created_at":"2026-05-18T03:48:00.873696+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0316","created_at":"2026-05-18T03:48:00.873696+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBH326X4TNJV","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBH326X4TNJV434Y","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBH326X4","created_at":"2026-05-18T12:26:42.757692+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.22888","citing_title":"Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC","json":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC.json","graph_json":"https://pith.science/api/pith-number/TBH326X4TNJV434YZLIC63QRVC/graph.json","events_json":"https://pith.science/api/pith-number/TBH326X4TNJV434YZLIC63QRVC/events.json","paper":"https://pith.science/paper/TBH326X4"},"agent_actions":{"view_html":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC","download_json":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC.json","view_paper":"https://pith.science/paper/TBH326X4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.0316&json=true","fetch_graph":"https://pith.science/api/pith-number/TBH326X4TNJV434YZLIC63QRVC/graph.json","fetch_events":"https://pith.science/api/pith-number/TBH326X4TNJV434YZLIC63QRVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC/action/storage_attestation","attest_author":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC/action/author_attestation","sign_citation":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC/action/citation_signature","submit_replication":"https://pith.science/pith/TBH326X4TNJV434YZLIC63QRVC/action/replication_record"}},"created_at":"2026-05-18T03:48:00.873696+00:00","updated_at":"2026-05-18T03:48:00.873696+00:00"}