{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Q7NNDQC5L5NTF5FD2EZL4FI6FZ","short_pith_number":"pith:Q7NNDQC5","canonical_record":{"source":{"id":"1002.3239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T18:53:23Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"d353a565cc9d4216d681cf5d7284f6023092ba5c0baed80c24a7739fa9495653","abstract_canon_sha256":"9908341ba301b6cc9b222186984125a1ad7193a5fed97a91a07b2459d78e2212"},"schema_version":"1.0"},"canonical_sha256":"87dad1c05d5f5b32f4a3d132be151e2e7628d3c49094085849373d5b537e2094","source":{"kind":"arxiv","id":"1002.3239","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3239","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3239v3","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3239","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q7NNDQC5L5NT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q7NNDQC5L5NTF5FD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q7NNDQC5","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Q7NNDQC5L5NTF5FD2EZL4FI6FZ","target":"record","payload":{"canonical_record":{"source":{"id":"1002.3239","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T18:53:23Z","cross_cats_sorted":["cs.AI","math.IT"],"title_canon_sha256":"d353a565cc9d4216d681cf5d7284f6023092ba5c0baed80c24a7739fa9495653","abstract_canon_sha256":"9908341ba301b6cc9b222186984125a1ad7193a5fed97a91a07b2459d78e2212"},"schema_version":"1.0"},"canonical_sha256":"87dad1c05d5f5b32f4a3d132be151e2e7628d3c49094085849373d5b537e2094","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.633914Z","signature_b64":"e2LLx6IxxSc8hTXghCFan28KHZnG0H3qtFa1s0SQ3fYKaYKwnqUy9VEn7hyvOOXnj74Ds28i2PFU+7bzFxrPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87dad1c05d5f5b32f4a3d132be151e2e7628d3c49094085849373d5b537e2094","last_reissued_at":"2026-05-18T03:03:21.633413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.633413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.3239","source_version":3,"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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9O87j2pmA19zAvTUgfjo/V1O+vTELcqy4eq671CHxAMWCBq6KEBjyli82nOlhWkrQ1gZO1gdAZV09pUyjhxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:05:46.836797Z"},"content_sha256":"84f60b3d63ab7978a7483bcc6d2c283d75dfd46bb56c1b3a734787e4049f0923","schema_version":"1.0","event_id":"sha256:84f60b3d63ab7978a7483bcc6d2c283d75dfd46bb56c1b3a734787e4049f0923"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Q7NNDQC5L5NTF5FD2EZL4FI6FZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Message-Passing Algorithms: Reparameterizations and Splittings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.IT"],"primary_cat":"cs.IT","authors_text":"Nicholas Ruozzi, Sekhar Tatikonda","submitted_at":"2010-02-17T18:53:23Z","abstract_excerpt":"The max-product algorithm, a local message-passing scheme that attempts to compute the most probable assignment (MAP) of a given probability distribution, has been successfully employed as a method of approximate inference for applications arising in coding theory, computer vision, and machine learning. However, the max-product algorithm is not guaranteed to converge to the MAP assignment, and if it does, is not guaranteed to recover the MAP assignment.\n  Alternative convergent message-passing schemes have been proposed to overcome these difficulties. This work provides a systematic study of s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3239","kind":"arxiv","version":3},"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-18T03:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8PNbutKtE2JfuGoHiYho+EtuwKHcuYgt6lolr4OzBjgDdz7lj0/99OK+GSKNexXp8WvdWxyj/ayfv9eEP0WEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:05:46.837155Z"},"content_sha256":"ece74dde3102509dda50e3d4a73657132e35cb3a764eacb883e9f692ced650b6","schema_version":"1.0","event_id":"sha256:ece74dde3102509dda50e3d4a73657132e35cb3a764eacb883e9f692ced650b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/bundle.json","state_url":"https://pith.science/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/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-03T07:05:46Z","links":{"resolver":"https://pith.science/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ","bundle":"https://pith.science/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/bundle.json","state":"https://pith.science/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7NNDQC5L5NTF5FD2EZL4FI6FZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Q7NNDQC5L5NTF5FD2EZL4FI6FZ","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":"9908341ba301b6cc9b222186984125a1ad7193a5fed97a91a07b2459d78e2212","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T18:53:23Z","title_canon_sha256":"d353a565cc9d4216d681cf5d7284f6023092ba5c0baed80c24a7739fa9495653"},"schema_version":"1.0","source":{"id":"1002.3239","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.3239","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1002.3239v3","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.3239","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"Q7NNDQC5L5NT","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q7NNDQC5L5NTF5FD","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q7NNDQC5","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:ece74dde3102509dda50e3d4a73657132e35cb3a764eacb883e9f692ced650b6","target":"graph","created_at":"2026-05-18T03:03:21Z","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":"The max-product algorithm, a local message-passing scheme that attempts to compute the most probable assignment (MAP) of a given probability distribution, has been successfully employed as a method of approximate inference for applications arising in coding theory, computer vision, and machine learning. However, the max-product algorithm is not guaranteed to converge to the MAP assignment, and if it does, is not guaranteed to recover the MAP assignment.\n  Alternative convergent message-passing schemes have been proposed to overcome these difficulties. This work provides a systematic study of s","authors_text":"Nicholas Ruozzi, Sekhar Tatikonda","cross_cats":["cs.AI","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T18:53:23Z","title":"Message-Passing Algorithms: Reparameterizations and Splittings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.3239","kind":"arxiv","version":3},"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:84f60b3d63ab7978a7483bcc6d2c283d75dfd46bb56c1b3a734787e4049f0923","target":"record","created_at":"2026-05-18T03:03:21Z","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":"9908341ba301b6cc9b222186984125a1ad7193a5fed97a91a07b2459d78e2212","cross_cats_sorted":["cs.AI","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-02-17T18:53:23Z","title_canon_sha256":"d353a565cc9d4216d681cf5d7284f6023092ba5c0baed80c24a7739fa9495653"},"schema_version":"1.0","source":{"id":"1002.3239","kind":"arxiv","version":3}},"canonical_sha256":"87dad1c05d5f5b32f4a3d132be151e2e7628d3c49094085849373d5b537e2094","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87dad1c05d5f5b32f4a3d132be151e2e7628d3c49094085849373d5b537e2094","first_computed_at":"2026-05-18T03:03:21.633413Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.633413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e2LLx6IxxSc8hTXghCFan28KHZnG0H3qtFa1s0SQ3fYKaYKwnqUy9VEn7hyvOOXnj74Ds28i2PFU+7bzFxrPCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.633914Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.3239","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84f60b3d63ab7978a7483bcc6d2c283d75dfd46bb56c1b3a734787e4049f0923","sha256:ece74dde3102509dda50e3d4a73657132e35cb3a764eacb883e9f692ced650b6"],"state_sha256":"4d88468eac844d2c3ed84e99e8512fe93767378515680355d44f33ec0993854c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"crHvTmFGtpJTu9+naec5/YXY/L7W/jGFW/9IhyoTFL9wJpTky4YXhhTRFq54nPGzJWZKX9tqMd/6OkEo3UuNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:05:46.839169Z","bundle_sha256":"e3448b3470235795716703e6214fa9de00021923919991310081381fd8ae9bb0"}}