{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:L3FALHWGR52LY6HAMRS5WSJRUR","short_pith_number":"pith:L3FALHWG","canonical_record":{"source":{"id":"1301.7409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"22d702db955702bcf5d328e979660022acd645647dfc37a4481137f9be9f69b0","abstract_canon_sha256":"3c9770ab76db21554a4220a5141bcc1168e914e077652c941ad4e291c73b1caa"},"schema_version":"1.0"},"canonical_sha256":"5eca059ec68f74bc78e06465db4931a460d2ecebf50f6c0d3d5a60a87c045de6","source":{"kind":"arxiv","id":"1301.7409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7409","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7409v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7409","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"L3FALHWGR52L","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L3FALHWGR52LY6HA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L3FALHWG","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:L3FALHWGR52LY6HAMRS5WSJRUR","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:34Z","cross_cats_sorted":[],"title_canon_sha256":"22d702db955702bcf5d328e979660022acd645647dfc37a4481137f9be9f69b0","abstract_canon_sha256":"3c9770ab76db21554a4220a5141bcc1168e914e077652c941ad4e291c73b1caa"},"schema_version":"1.0"},"canonical_sha256":"5eca059ec68f74bc78e06465db4931a460d2ecebf50f6c0d3d5a60a87c045de6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:49.626539Z","signature_b64":"ksXsyMB/ZQJLQq/rHWCcmD+MZ8CIqUxZkzJ7TS9qA+AfxdJDoSGay0S+yS8L74xpctLgn42S3m+FeFYsAb8nAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5eca059ec68f74bc78e06465db4931a460d2ecebf50f6c0d3d5a60a87c045de6","last_reissued_at":"2026-05-18T03:34:49.625738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:49.625738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7409","source_version":1,"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:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d+KZzBK9DkdGk8d2k2eP3HGBB8zsGQn96r9ajqly5oHOu46WcplSwXqh0CSKYIZ3nLv96oxq3HKri83ykfv+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:58:24.702221Z"},"content_sha256":"379791ec6e233c83b7857c82e61f349b7b59b84ff7f8cb0622757840f29e5ca0","schema_version":"1.0","event_id":"sha256:379791ec6e233c83b7857c82e61f349b7b59b84ff7f8cb0622757840f29e5ca0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:L3FALHWGR52LY6HAMRS5WSJRUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Irina Rish, Kalev Kask, Rina Dechter","submitted_at":"2013-01-30T15:06:34Z","abstract_excerpt":"It was recently  shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece]. Moreover, it was observed that iterative application of the (linear time) Pearl's belief propagation algorithm  designed for polytrees outperformed state of the art decoding algorithms, even though the corresponding networks may have many cycles. This paper demonstrates empirically that an approximation algorithm approx-mpe for solving the most probable explanation (MPE) problem, developed within the recently propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7409","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"},"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:34:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CK3s7cI/FfZkLbMXd5T3/B66hPcqeQzGXuHLZe2NQ8BlLbZT+Xt8B8me8tFZb36nG4sc02uId5E300ZbGp8hAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:58:24.702676Z"},"content_sha256":"f0ba6b4ea642903999bdae0b03fd921350fb8a6f6611bcc588669d1c98e0d238","schema_version":"1.0","event_id":"sha256:f0ba6b4ea642903999bdae0b03fd921350fb8a6f6611bcc588669d1c98e0d238"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L3FALHWGR52LY6HAMRS5WSJRUR/bundle.json","state_url":"https://pith.science/pith/L3FALHWGR52LY6HAMRS5WSJRUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L3FALHWGR52LY6HAMRS5WSJRUR/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-05-31T10:58:24Z","links":{"resolver":"https://pith.science/pith/L3FALHWGR52LY6HAMRS5WSJRUR","bundle":"https://pith.science/pith/L3FALHWGR52LY6HAMRS5WSJRUR/bundle.json","state":"https://pith.science/pith/L3FALHWGR52LY6HAMRS5WSJRUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L3FALHWGR52LY6HAMRS5WSJRUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:L3FALHWGR52LY6HAMRS5WSJRUR","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":"3c9770ab76db21554a4220a5141bcc1168e914e077652c941ad4e291c73b1caa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:34Z","title_canon_sha256":"22d702db955702bcf5d328e979660022acd645647dfc37a4481137f9be9f69b0"},"schema_version":"1.0","source":{"id":"1301.7409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7409","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7409v1","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7409","created_at":"2026-05-18T03:34:49Z"},{"alias_kind":"pith_short_12","alias_value":"L3FALHWGR52L","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"L3FALHWGR52LY6HA","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"L3FALHWG","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:f0ba6b4ea642903999bdae0b03fd921350fb8a6f6611bcc588669d1c98e0d238","target":"graph","created_at":"2026-05-18T03:34:49Z","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":"It was recently  shown that the problem of decoding messages transmitted through a noisy channel can be formulated as a belief updating task over a probabilistic network [McEliece]. Moreover, it was observed that iterative application of the (linear time) Pearl's belief propagation algorithm  designed for polytrees outperformed state of the art decoding algorithms, even though the corresponding networks may have many cycles. This paper demonstrates empirically that an approximation algorithm approx-mpe for solving the most probable explanation (MPE) problem, developed within the recently propo","authors_text":"Irina Rish, Kalev Kask, Rina Dechter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:34Z","title":"Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7409","kind":"arxiv","version":1},"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:379791ec6e233c83b7857c82e61f349b7b59b84ff7f8cb0622757840f29e5ca0","target":"record","created_at":"2026-05-18T03:34:49Z","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":"3c9770ab76db21554a4220a5141bcc1168e914e077652c941ad4e291c73b1caa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-30T15:06:34Z","title_canon_sha256":"22d702db955702bcf5d328e979660022acd645647dfc37a4481137f9be9f69b0"},"schema_version":"1.0","source":{"id":"1301.7409","kind":"arxiv","version":1}},"canonical_sha256":"5eca059ec68f74bc78e06465db4931a460d2ecebf50f6c0d3d5a60a87c045de6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5eca059ec68f74bc78e06465db4931a460d2ecebf50f6c0d3d5a60a87c045de6","first_computed_at":"2026-05-18T03:34:49.625738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:49.625738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ksXsyMB/ZQJLQq/rHWCcmD+MZ8CIqUxZkzJ7TS9qA+AfxdJDoSGay0S+yS8L74xpctLgn42S3m+FeFYsAb8nAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:49.626539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:379791ec6e233c83b7857c82e61f349b7b59b84ff7f8cb0622757840f29e5ca0","sha256:f0ba6b4ea642903999bdae0b03fd921350fb8a6f6611bcc588669d1c98e0d238"],"state_sha256":"4d3122081958efbd2774699b3fdf2a5600d2e2ec49253bd52b0c76b8dab4e2b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CNGvkEIgUDLNKdQtAPSAGMQbIP32EJRZOLi3Ni52O4Q/pRx3zeNPfosLaMIboSHHQNjqaTkTDe63g9VuXkIPCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:58:24.705271Z","bundle_sha256":"3d7ad9edd25a30207a7c8a449164b2c225476cd9cfce2a0c95a5d56adcb3f7ad"}}