{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DYT5VN4KPF3ABPE5YOR6FHO2IY","short_pith_number":"pith:DYT5VN4K","canonical_record":{"source":{"id":"1302.3586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:57Z","cross_cats_sorted":[],"title_canon_sha256":"9f6a460542622ec62c39bf193f941faea9fa35e1dcdce1f1fc1deb993c273000","abstract_canon_sha256":"ba5d74926a643b89bc09f23752fc67d292881f4ca86e4c61443eda5642ce13bf"},"schema_version":"1.0"},"canonical_sha256":"1e27dab78a797600bc9dc3a3e29dda463ac7fead7ef4ee7fef9db1f78061ec56","source":{"kind":"arxiv","id":"1302.3586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3586","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3586v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3586","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"DYT5VN4KPF3A","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DYT5VN4KPF3ABPE5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DYT5VN4K","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DYT5VN4KPF3ABPE5YOR6FHO2IY","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:57Z","cross_cats_sorted":[],"title_canon_sha256":"9f6a460542622ec62c39bf193f941faea9fa35e1dcdce1f1fc1deb993c273000","abstract_canon_sha256":"ba5d74926a643b89bc09f23752fc67d292881f4ca86e4c61443eda5642ce13bf"},"schema_version":"1.0"},"canonical_sha256":"1e27dab78a797600bc9dc3a3e29dda463ac7fead7ef4ee7fef9db1f78061ec56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.635859Z","signature_b64":"C7drfcnZ2R0wvuuTiIDs6R0I1Hz0mIUfWpvEvLAwTuO3vjaATsU2eV+ztQLs7R3hLp8rEeFrZwJGJoqXBULpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e27dab78a797600bc9dc3a3e29dda463ac7fead7ef4ee7fef9db1f78061ec56","last_reissued_at":"2026-05-18T03:33:36.635248Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.635248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3586","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y4gulNFV660D1vaiUkKheCjOuJQljk+swZXBAavvHjmnSLSCFwvBQMxazOM2DmSKat+KWBFObDTvkJ2NE9edCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:32:24.423926Z"},"content_sha256":"d629659ceff429050b4013ff8931398f2f5cfe83e3e30280a8b11fa1f560d26a","schema_version":"1.0","event_id":"sha256:d629659ceff429050b4013ff8931398f2f5cfe83e3e30280a8b11fa1f560d26a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DYT5VN4KPF3ABPE5YOR6FHO2IY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Upper and Lower Bounds on Likelihoods in Intractable Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael I. Jordan, Tommi S. Jaakkola","submitted_at":"2013-02-13T14:14:57Z","abstract_excerpt":"We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks.  These techniques become useful when the size of the network (or clique size) precludes exact computations.  We illustrate the tightness of the bounds by numerical experiments."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3586","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OQu/A12VYCkTyM6lyUQRLe5WX/+X6AqVtBYUryzVlIbNwIct2QMQdmu+lkQPsm3gT6ig6r6cHKIeRFGGH71Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T01:32:24.424269Z"},"content_sha256":"88efb343f80368145f78cc8ff56202881fd982b23a2a9e696222af825dd22e6d","schema_version":"1.0","event_id":"sha256:88efb343f80368145f78cc8ff56202881fd982b23a2a9e696222af825dd22e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/bundle.json","state_url":"https://pith.science/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/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-03T01:32:24Z","links":{"resolver":"https://pith.science/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY","bundle":"https://pith.science/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/bundle.json","state":"https://pith.science/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYT5VN4KPF3ABPE5YOR6FHO2IY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DYT5VN4KPF3ABPE5YOR6FHO2IY","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":"ba5d74926a643b89bc09f23752fc67d292881f4ca86e4c61443eda5642ce13bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:57Z","title_canon_sha256":"9f6a460542622ec62c39bf193f941faea9fa35e1dcdce1f1fc1deb993c273000"},"schema_version":"1.0","source":{"id":"1302.3586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3586","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3586v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3586","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"DYT5VN4KPF3A","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DYT5VN4KPF3ABPE5","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DYT5VN4K","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:88efb343f80368145f78cc8ff56202881fd982b23a2a9e696222af825dd22e6d","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks.  These techniques become useful when the size of the network (or clique size) precludes exact computations.  We illustrate the tightness of the bounds by numerical experiments.","authors_text":"Michael I. Jordan, Tommi S. Jaakkola","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:57Z","title":"Computing Upper and Lower Bounds on Likelihoods in Intractable Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3586","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:d629659ceff429050b4013ff8931398f2f5cfe83e3e30280a8b11fa1f560d26a","target":"record","created_at":"2026-05-18T03:33:36Z","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":"ba5d74926a643b89bc09f23752fc67d292881f4ca86e4c61443eda5642ce13bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-13T14:14:57Z","title_canon_sha256":"9f6a460542622ec62c39bf193f941faea9fa35e1dcdce1f1fc1deb993c273000"},"schema_version":"1.0","source":{"id":"1302.3586","kind":"arxiv","version":1}},"canonical_sha256":"1e27dab78a797600bc9dc3a3e29dda463ac7fead7ef4ee7fef9db1f78061ec56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e27dab78a797600bc9dc3a3e29dda463ac7fead7ef4ee7fef9db1f78061ec56","first_computed_at":"2026-05-18T03:33:36.635248Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.635248Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C7drfcnZ2R0wvuuTiIDs6R0I1Hz0mIUfWpvEvLAwTuO3vjaATsU2eV+ztQLs7R3hLp8rEeFrZwJGJoqXBULpDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.635859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d629659ceff429050b4013ff8931398f2f5cfe83e3e30280a8b11fa1f560d26a","sha256:88efb343f80368145f78cc8ff56202881fd982b23a2a9e696222af825dd22e6d"],"state_sha256":"b6684523a587929be98189f1197e73d5488ff3e99343e2fcb8ae2bd4d98a090c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D67q47ue3+QdIGr+rx7fkwgSStP0PPouG+e9yuNO2aPXW9xD926uUsZqyyz6eDNO/gAi1bN4Mv5/Sk6EgBClDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T01:32:24.426192Z","bundle_sha256":"f2221b9f6e20d38528df11b670dad98f96abf87503050edb1e82c1ce3bcdd9c1"}}