{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GS65QAHUZ3OKWEMGBMUQLFT5NL","short_pith_number":"pith:GS65QAHU","canonical_record":{"source":{"id":"1506.08544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-29T08:45:11Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"287efb6ee06d21c8f36b5cd175d440693332bfa583fbef19f7ae530e44e41a54","abstract_canon_sha256":"030115945f8ea86b696456a16e1ce6ba5fa169c1a005f4ca715b1b969cf79be7"},"schema_version":"1.0"},"canonical_sha256":"34bdd800f4cedcab11860b2905967d6ae95da5f2e0374c8d5c46d4f39c822057","source":{"kind":"arxiv","id":"1506.08544","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08544","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08544v2","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08544","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"GS65QAHUZ3OK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GS65QAHUZ3OKWEMG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GS65QAHU","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GS65QAHUZ3OKWEMGBMUQLFT5NL","target":"record","payload":{"canonical_record":{"source":{"id":"1506.08544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-29T08:45:11Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"287efb6ee06d21c8f36b5cd175d440693332bfa583fbef19f7ae530e44e41a54","abstract_canon_sha256":"030115945f8ea86b696456a16e1ce6ba5fa169c1a005f4ca715b1b969cf79be7"},"schema_version":"1.0"},"canonical_sha256":"34bdd800f4cedcab11860b2905967d6ae95da5f2e0374c8d5c46d4f39c822057","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:38.047767Z","signature_b64":"HTy9k7N5yksNRGTpTVuCkeElfK215jmYGqhpnBjehwC4mZ1/zpXF0YPbjvYoNM+3WluiZlNnHsA2pr98K3ezCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34bdd800f4cedcab11860b2905967d6ae95da5f2e0374c8d5c46d4f39c822057","last_reissued_at":"2026-05-18T00:21:38.047028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:38.047028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.08544","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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hM2vHHEZBAi5b6bZZ57dDW37dG7mifQ9IoARcpyn/I1IpXR1G+ZfoyYd6cgJtAMu1u4qdcoFn9mse8r869ULAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:06:54.593781Z"},"content_sha256":"5c1a211a7be3b699305ba0ca90a24700391a2ba8a4bbabff68b87f6b9d6ed7f7","schema_version":"1.0","event_id":"sha256:5c1a211a7be3b699305ba0ca90a24700391a2ba8a4bbabff68b87f6b9d6ed7f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GS65QAHUZ3OKWEMGBMUQLFT5NL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact and approximate inference in graphical models: variable elimination and beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"stat.ML","authors_text":"Alain Franc, Marie-Jos\\'ee Cros, Matthieu Vignes, Nathalie Peyrard, R\\'egis Sabbadin, Simon de Givry, St\\'ephane Robin, Thomas Schiex","submitted_at":"2015-06-29T08:45:11Z","abstract_excerpt":"Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, borrowed from optimisation and computer science. They are built on the principle of variable elimination whose complexity is dictated in an intricate way by the order in which variables are eliminated. The so-called treewidth of the graph characterises this algorithmic complexity:"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08544","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:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3UAX6icUJqvX7NhJXozshP/C/V814M4L2aw/4LApGM7fyn1+6I4ULC+S81TYObwBRk7PQ0bd6c8juU0d3oP2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:06:54.594139Z"},"content_sha256":"8a4e2cebfcec2f37d75b2a2c6d60f2f34982ccc1750f4fce7391d2784842aa1d","schema_version":"1.0","event_id":"sha256:8a4e2cebfcec2f37d75b2a2c6d60f2f34982ccc1750f4fce7391d2784842aa1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/bundle.json","state_url":"https://pith.science/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/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-04T05:06:54Z","links":{"resolver":"https://pith.science/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL","bundle":"https://pith.science/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/bundle.json","state":"https://pith.science/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GS65QAHUZ3OKWEMGBMUQLFT5NL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GS65QAHUZ3OKWEMGBMUQLFT5NL","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":"030115945f8ea86b696456a16e1ce6ba5fa169c1a005f4ca715b1b969cf79be7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-29T08:45:11Z","title_canon_sha256":"287efb6ee06d21c8f36b5cd175d440693332bfa583fbef19f7ae530e44e41a54"},"schema_version":"1.0","source":{"id":"1506.08544","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.08544","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1506.08544v2","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.08544","created_at":"2026-05-18T00:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"GS65QAHUZ3OK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GS65QAHUZ3OKWEMG","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GS65QAHU","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:8a4e2cebfcec2f37d75b2a2c6d60f2f34982ccc1750f4fce7391d2784842aa1d","target":"graph","created_at":"2026-05-18T00:21:38Z","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":"Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, borrowed from optimisation and computer science. They are built on the principle of variable elimination whose complexity is dictated in an intricate way by the order in which variables are eliminated. The so-called treewidth of the graph characterises this algorithmic complexity:","authors_text":"Alain Franc, Marie-Jos\\'ee Cros, Matthieu Vignes, Nathalie Peyrard, R\\'egis Sabbadin, Simon de Givry, St\\'ephane Robin, Thomas Schiex","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-29T08:45:11Z","title":"Exact and approximate inference in graphical models: variable elimination and beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.08544","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:5c1a211a7be3b699305ba0ca90a24700391a2ba8a4bbabff68b87f6b9d6ed7f7","target":"record","created_at":"2026-05-18T00:21:38Z","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":"030115945f8ea86b696456a16e1ce6ba5fa169c1a005f4ca715b1b969cf79be7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-06-29T08:45:11Z","title_canon_sha256":"287efb6ee06d21c8f36b5cd175d440693332bfa583fbef19f7ae530e44e41a54"},"schema_version":"1.0","source":{"id":"1506.08544","kind":"arxiv","version":2}},"canonical_sha256":"34bdd800f4cedcab11860b2905967d6ae95da5f2e0374c8d5c46d4f39c822057","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34bdd800f4cedcab11860b2905967d6ae95da5f2e0374c8d5c46d4f39c822057","first_computed_at":"2026-05-18T00:21:38.047028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:38.047028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HTy9k7N5yksNRGTpTVuCkeElfK215jmYGqhpnBjehwC4mZ1/zpXF0YPbjvYoNM+3WluiZlNnHsA2pr98K3ezCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:38.047767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.08544","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c1a211a7be3b699305ba0ca90a24700391a2ba8a4bbabff68b87f6b9d6ed7f7","sha256:8a4e2cebfcec2f37d75b2a2c6d60f2f34982ccc1750f4fce7391d2784842aa1d"],"state_sha256":"b959efdedbe279b1672b3ba0b104b918d537b72f648d57ee5e9f2620daa4b9de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KP5rye28Z2aTum5UCqM/jD5Amof1uQ7iQOZ5bpNFFJ0VVaDCSMJAMa2i0OjjhelMVvdzBo36f9x3H/FK7802DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:06:54.596227Z","bundle_sha256":"25ec36c399474656fc015f5f0dbb1a9c10f03acfef7cb822d3791b778c0ce280"}}