{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MX5KPOECGTCLML765MQMJTQREB","short_pith_number":"pith:MX5KPOEC","schema_version":"1.0","canonical_sha256":"65faa7b88234c4b62ffeeb20c4ce11207195ed675bd326cc2be5dffbeaf0f3aa","source":{"kind":"arxiv","id":"1206.5232","version":2},"attestation_state":"computed","paper":{"title":"Extending Monte Carlo Methods to Factor Graphs with Negative and Complex Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"stat.CO","authors_text":"Hans-Andrea Loeliger, Mehdi Molkaraie","submitted_at":"2012-06-22T19:28:39Z","abstract_excerpt":"The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors."},"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":"1206.5232","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2012-06-22T19:28:39Z","cross_cats_sorted":["cs.IT","math.IT","stat.AP"],"title_canon_sha256":"6bac3890de7fc7b9931a64a72b46b71b67bc3259555bb54f4d18b24322ac9896","abstract_canon_sha256":"cdaba7c62a56fbc7483ae68ed13c0e9bc9948488aedbaebcf0359999e439244a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:52.191747Z","signature_b64":"y5w7YX2f//Fn7JA1rLtJseCkJH+EeT8YUbMoTp5ROQVtztyh2Rn691X/QY9Alvd+HhgSyBSStzlA21LYg/hfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65faa7b88234c4b62ffeeb20c4ce11207195ed675bd326cc2be5dffbeaf0f3aa","last_reissued_at":"2026-05-18T03:43:52.190934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:52.190934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending Monte Carlo Methods to Factor Graphs with Negative and Complex Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.AP"],"primary_cat":"stat.CO","authors_text":"Hans-Andrea Loeliger, Mehdi Molkaraie","submitted_at":"2012-06-22T19:28:39Z","abstract_excerpt":"The partition function of a factor graph can sometimes be accurately estimated by Monte Carlo methods. In this paper, such methods are extended to factor graphs with negative and complex factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5232","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":"1206.5232","created_at":"2026-05-18T03:43:52.191071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5232v2","created_at":"2026-05-18T03:43:52.191071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5232","created_at":"2026-05-18T03:43:52.191071+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX5KPOECGTCL","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX5KPOECGTCLML76","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX5KPOEC","created_at":"2026-05-18T12:27:14.488303+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/MX5KPOECGTCLML765MQMJTQREB","json":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB.json","graph_json":"https://pith.science/api/pith-number/MX5KPOECGTCLML765MQMJTQREB/graph.json","events_json":"https://pith.science/api/pith-number/MX5KPOECGTCLML765MQMJTQREB/events.json","paper":"https://pith.science/paper/MX5KPOEC"},"agent_actions":{"view_html":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB","download_json":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB.json","view_paper":"https://pith.science/paper/MX5KPOEC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5232&json=true","fetch_graph":"https://pith.science/api/pith-number/MX5KPOECGTCLML765MQMJTQREB/graph.json","fetch_events":"https://pith.science/api/pith-number/MX5KPOECGTCLML765MQMJTQREB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB/action/storage_attestation","attest_author":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB/action/author_attestation","sign_citation":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB/action/citation_signature","submit_replication":"https://pith.science/pith/MX5KPOECGTCLML765MQMJTQREB/action/replication_record"}},"created_at":"2026-05-18T03:43:52.191071+00:00","updated_at":"2026-05-18T03:43:52.191071+00:00"}