{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:32ROPYOT5IYIGM4WZSCQWGAL2P","short_pith_number":"pith:32ROPYOT","canonical_record":{"source":{"id":"1502.04956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-17T16:49:23Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"4cedd790b29e6e85acf6d612f6d708c9c3351e5630b5987d0391f55c10ca2dc6","abstract_canon_sha256":"476a6ccd7dbf6e0224c22f1d21882b0237ee877e098c2d345bc4f1bd80d4cb0e"},"schema_version":"1.0"},"canonical_sha256":"dea2e7e1d3ea30833396cc850b180bd3daac3dcd2d957ed391b140bdd4a2d26e","source":{"kind":"arxiv","id":"1502.04956","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04956","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04956v2","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04956","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"32ROPYOT5IYI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"32ROPYOT5IYIGM4W","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"32ROPYOT","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:32ROPYOT5IYIGM4WZSCQWGAL2P","target":"record","payload":{"canonical_record":{"source":{"id":"1502.04956","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-17T16:49:23Z","cross_cats_sorted":["cs.LG","cs.SI"],"title_canon_sha256":"4cedd790b29e6e85acf6d612f6d708c9c3351e5630b5987d0391f55c10ca2dc6","abstract_canon_sha256":"476a6ccd7dbf6e0224c22f1d21882b0237ee877e098c2d345bc4f1bd80d4cb0e"},"schema_version":"1.0"},"canonical_sha256":"dea2e7e1d3ea30833396cc850b180bd3daac3dcd2d957ed391b140bdd4a2d26e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:03.902048Z","signature_b64":"aDjKK9fWYQE+M5K/PtFtNPh4vhGGf8h3zm12PMYlgZe9rQQwQNON4BY/2o2iW528LoTgtHQt/NifyLKByQ4mAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dea2e7e1d3ea30833396cc850b180bd3daac3dcd2d957ed391b140bdd4a2d26e","last_reissued_at":"2026-05-18T00:54:03.901650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:03.901650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.04956","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lRrNeV5Q+lLMNojZwFH+6+szy8AIljzFzbPgIJAunF9GMAlztkIhKHGYLFSrkgKzRRKXloFES/hHAVoBWdW9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:38:05.266480Z"},"content_sha256":"fec454aedffb0d151d50fe8fab12118e7df341ff7ac299d3463347d3144258d6","schema_version":"1.0","event_id":"sha256:fec454aedffb0d151d50fe8fab12118e7df341ff7ac299d3463347d3144258d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:32ROPYOT5IYIGM4WZSCQWGAL2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Linearization of Belief Propagation on Pairwise Markov Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SI"],"primary_cat":"cs.AI","authors_text":"Wolfgang Gatterbauer","submitted_at":"2015-02-17T16:49:23Z","abstract_excerpt":"Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general. For the case when all edges in the MRF carry the same symmetric, doubly stochastic potential, recent works have proposed to approximate BP by linearizing the update equations around default values, which was shown to work well for the problem of node classification. The present paper generalizes all prior work and derives an approach that approximates loopy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04956","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:54:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s13OlTPpr7gNsZOW1Ei9EIlvDJ4vrT+BvmbTwPtnVoK2Ltgj8PYyPyMrQI+dDx/bika8tp4z0FTg3nsRAx9RAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T00:38:05.267153Z"},"content_sha256":"9189539f5137b04cca4da42f67bcba283b746e86b014ffbe513718008f1f63a0","schema_version":"1.0","event_id":"sha256:9189539f5137b04cca4da42f67bcba283b746e86b014ffbe513718008f1f63a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/bundle.json","state_url":"https://pith.science/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-06T00:38:05Z","links":{"resolver":"https://pith.science/pith/32ROPYOT5IYIGM4WZSCQWGAL2P","bundle":"https://pith.science/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/bundle.json","state":"https://pith.science/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/32ROPYOT5IYIGM4WZSCQWGAL2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:32ROPYOT5IYIGM4WZSCQWGAL2P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"476a6ccd7dbf6e0224c22f1d21882b0237ee877e098c2d345bc4f1bd80d4cb0e","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-17T16:49:23Z","title_canon_sha256":"4cedd790b29e6e85acf6d612f6d708c9c3351e5630b5987d0391f55c10ca2dc6"},"schema_version":"1.0","source":{"id":"1502.04956","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.04956","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.04956v2","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.04956","created_at":"2026-05-18T00:54:03Z"},{"alias_kind":"pith_short_12","alias_value":"32ROPYOT5IYI","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"32ROPYOT5IYIGM4W","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"32ROPYOT","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:9189539f5137b04cca4da42f67bcba283b746e86b014ffbe513718008f1f63a0","target":"graph","created_at":"2026-05-18T00:54:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Belief Propagation (BP) is a widely used approximation for exact probabilistic inference in graphical models, such as Markov Random Fields (MRFs). In graphs with cycles, however, no exact convergence guarantees for BP are known, in general. For the case when all edges in the MRF carry the same symmetric, doubly stochastic potential, recent works have proposed to approximate BP by linearizing the update equations around default values, which was shown to work well for the problem of node classification. The present paper generalizes all prior work and derives an approach that approximates loopy","authors_text":"Wolfgang Gatterbauer","cross_cats":["cs.LG","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-17T16:49:23Z","title":"The Linearization of Belief Propagation on Pairwise Markov Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.04956","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fec454aedffb0d151d50fe8fab12118e7df341ff7ac299d3463347d3144258d6","target":"record","created_at":"2026-05-18T00:54:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"476a6ccd7dbf6e0224c22f1d21882b0237ee877e098c2d345bc4f1bd80d4cb0e","cross_cats_sorted":["cs.LG","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-17T16:49:23Z","title_canon_sha256":"4cedd790b29e6e85acf6d612f6d708c9c3351e5630b5987d0391f55c10ca2dc6"},"schema_version":"1.0","source":{"id":"1502.04956","kind":"arxiv","version":2}},"canonical_sha256":"dea2e7e1d3ea30833396cc850b180bd3daac3dcd2d957ed391b140bdd4a2d26e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dea2e7e1d3ea30833396cc850b180bd3daac3dcd2d957ed391b140bdd4a2d26e","first_computed_at":"2026-05-18T00:54:03.901650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:03.901650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aDjKK9fWYQE+M5K/PtFtNPh4vhGGf8h3zm12PMYlgZe9rQQwQNON4BY/2o2iW528LoTgtHQt/NifyLKByQ4mAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:03.902048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.04956","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fec454aedffb0d151d50fe8fab12118e7df341ff7ac299d3463347d3144258d6","sha256:9189539f5137b04cca4da42f67bcba283b746e86b014ffbe513718008f1f63a0"],"state_sha256":"caf0195ec84df23cb4f21be4f4185afeb644fb7144ab85dc699048f18c15065d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vO6uyJiU5Jf6cHAmKxQPmmYTEBfo1ff4IVBzNTIJHM2hKoz5VlaPm2MLkftYMA0TLn0Mps6t6risgAWn30lkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T00:38:05.270433Z","bundle_sha256":"220ba79c419a5f7db8fc9d4135dded604cdefa43e6bd45eb1fa3d4907584b466"}}