{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NEA6F3YZKHY4C43MNVBB63DKCB","short_pith_number":"pith:NEA6F3YZ","canonical_record":{"source":{"id":"1301.7392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:05:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"acf464a9f1e9902e87fe671047193a5f1c1c19a8112369b3297998c568503c70","abstract_canon_sha256":"78f7bc9a15646be8bfce7fb51b3ffb1cea71667ebcdcabc48daf1badca50f383"},"schema_version":"1.0"},"canonical_sha256":"6901e2ef1951f1c1736c6d421f6c6a10461c8d014392de1908dd2d27715ce10c","source":{"kind":"arxiv","id":"1301.7392","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7392","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7392v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7392","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"NEA6F3YZKHY4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NEA6F3YZKHY4C43M","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NEA6F3YZ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NEA6F3YZKHY4C43MNVBB63DKCB","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7392","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:05:09Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"acf464a9f1e9902e87fe671047193a5f1c1c19a8112369b3297998c568503c70","abstract_canon_sha256":"78f7bc9a15646be8bfce7fb51b3ffb1cea71667ebcdcabc48daf1badca50f383"},"schema_version":"1.0"},"canonical_sha256":"6901e2ef1951f1c1736c6d421f6c6a10461c8d014392de1908dd2d27715ce10c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:00.054962Z","signature_b64":"wIqSgwoefRcUVlyKyORKVQ/HDwXsCh4acIfwAPHEhtK2GK1mvkICRg6hJhYs1xyhn94fpkQcCwYHacQZlbFEDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6901e2ef1951f1c1736c6d421f6c6a10461c8d014392de1908dd2d27715ce10c","last_reissued_at":"2026-05-18T03:35:00.054299Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:00.054299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7392","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZN35q5Nboc+lEhQefXYiPRjOO1SEd9dKIbGq+IhLfkOwZ5z4hmwKa+rcU7EObbqqOC1rdBAICnf0S0qUqwwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:30:43.880750Z"},"content_sha256":"d4cea1160625dff6e796fc453d5256edda6bf39b79dd285258fe3153745d79e0","schema_version":"1.0","event_id":"sha256:d4cea1160625dff6e796fc453d5256edda6bf39b79dd285258fe3153745d79e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NEA6F3YZKHY4C43MNVBB63DKCB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Deviation Methods for Approximate Probabilistic Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Lawrence Saul, Michael Kearns","submitted_at":"2013-01-30T15:05:09Z","abstract_excerpt":"We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of interest. In particular, using methods from large deviation theory, we derive rigorous bounds on marginal probabilities such as Pr[children] and prove rates of convergence for the accuracy of our bounds as a function of network size. Our results apply to networks with generic transfer "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7392","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SZ5HcRZaLS2LJaP3WYEQJpzCOXjPtpSDAQSwX1o02TEReBGJ5WkaVGSIvbiKugKdF9OuL3K0ExEnLBqsL4krBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:30:43.881091Z"},"content_sha256":"1ef57a6ff6acd8732f57f0650412511db44a921c7a6703b48e98cd885c0ba1d3","schema_version":"1.0","event_id":"sha256:1ef57a6ff6acd8732f57f0650412511db44a921c7a6703b48e98cd885c0ba1d3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEA6F3YZKHY4C43MNVBB63DKCB/bundle.json","state_url":"https://pith.science/pith/NEA6F3YZKHY4C43MNVBB63DKCB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEA6F3YZKHY4C43MNVBB63DKCB/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-04T17:30:43Z","links":{"resolver":"https://pith.science/pith/NEA6F3YZKHY4C43MNVBB63DKCB","bundle":"https://pith.science/pith/NEA6F3YZKHY4C43MNVBB63DKCB/bundle.json","state":"https://pith.science/pith/NEA6F3YZKHY4C43MNVBB63DKCB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEA6F3YZKHY4C43MNVBB63DKCB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NEA6F3YZKHY4C43MNVBB63DKCB","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":"78f7bc9a15646be8bfce7fb51b3ffb1cea71667ebcdcabc48daf1badca50f383","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:05:09Z","title_canon_sha256":"acf464a9f1e9902e87fe671047193a5f1c1c19a8112369b3297998c568503c70"},"schema_version":"1.0","source":{"id":"1301.7392","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7392","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7392v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7392","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"NEA6F3YZKHY4","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NEA6F3YZKHY4C43M","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NEA6F3YZ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:1ef57a6ff6acd8732f57f0650412511db44a921c7a6703b48e98cd885c0ba1d3","target":"graph","created_at":"2026-05-18T03:35:00Z","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 study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of interest. In particular, using methods from large deviation theory, we derive rigorous bounds on marginal probabilities such as Pr[children] and prove rates of convergence for the accuracy of our bounds as a function of network size. Our results apply to networks with generic transfer ","authors_text":"Lawrence Saul, Michael Kearns","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:05:09Z","title":"Large Deviation Methods for Approximate Probabilistic Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7392","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:d4cea1160625dff6e796fc453d5256edda6bf39b79dd285258fe3153745d79e0","target":"record","created_at":"2026-05-18T03:35:00Z","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":"78f7bc9a15646be8bfce7fb51b3ffb1cea71667ebcdcabc48daf1badca50f383","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:05:09Z","title_canon_sha256":"acf464a9f1e9902e87fe671047193a5f1c1c19a8112369b3297998c568503c70"},"schema_version":"1.0","source":{"id":"1301.7392","kind":"arxiv","version":1}},"canonical_sha256":"6901e2ef1951f1c1736c6d421f6c6a10461c8d014392de1908dd2d27715ce10c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6901e2ef1951f1c1736c6d421f6c6a10461c8d014392de1908dd2d27715ce10c","first_computed_at":"2026-05-18T03:35:00.054299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:00.054299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wIqSgwoefRcUVlyKyORKVQ/HDwXsCh4acIfwAPHEhtK2GK1mvkICRg6hJhYs1xyhn94fpkQcCwYHacQZlbFEDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:00.054962Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7392","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4cea1160625dff6e796fc453d5256edda6bf39b79dd285258fe3153745d79e0","sha256:1ef57a6ff6acd8732f57f0650412511db44a921c7a6703b48e98cd885c0ba1d3"],"state_sha256":"a61d87878c3cd111063288a3144f07c4777f2b5ce4c9df73be16cabf1c65144f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPHiS4qBAYexYstQv6TgvKMMh7uSt/DMtXcK6/yy1gT8Q9gv9FU4e/h8Ohhtd8Nupiy879mqrXZ0TFDcsm77BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:30:43.883053Z","bundle_sha256":"9ecfd69b3bae405f82315b9a1bf2fbb9cd53d54f9a3ef07388259b1f17f91391"}}