{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ON36UA432PYGK7BPBQEXOSMGFA","short_pith_number":"pith:ON36UA43","canonical_record":{"source":{"id":"1212.2455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"8724c555f15c7bdf680ef9b82a959781074ee20e9f39b857ebf2f71343305563","abstract_canon_sha256":"9c8f981a3d80f51350808db55f8f148c2d8dd121dfb6fc2dbefe49bb600c7832"},"schema_version":"1.0"},"canonical_sha256":"7377ea039bd3f0657c2f0c097749862810c69b0880503291416ccadb005fa9c9","source":{"kind":"arxiv","id":"1212.2455","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2455","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2455v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2455","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"ON36UA432PYG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ON36UA432PYGK7BP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ON36UA43","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ON36UA432PYGK7BPBQEXOSMGFA","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"8724c555f15c7bdf680ef9b82a959781074ee20e9f39b857ebf2f71343305563","abstract_canon_sha256":"9c8f981a3d80f51350808db55f8f148c2d8dd121dfb6fc2dbefe49bb600c7832"},"schema_version":"1.0"},"canonical_sha256":"7377ea039bd3f0657c2f0c097749862810c69b0880503291416ccadb005fa9c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.847065Z","signature_b64":"CkMrUxjbZ6iPUTHNq/IeTnJaoUqbFANapZr91BeShK62eQYshiwEeUJ6lgOuquU+1vtylUIuwoFYzaN+4uBsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7377ea039bd3f0657c2f0c097749862810c69b0880503291416ccadb005fa9c9","last_reissued_at":"2026-05-18T03:38:44.846598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.846598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2455","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjhfp+PTrzE0rpcLuDdTAIrDJtyHB6nEwQiyJaLSEdln4af8oTzfnkU2VHxnm9JHONUqQmbYyFlzn+cxIyHCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:31:13.968569Z"},"content_sha256":"78ec69e288771bfae2ed557fdebdf19664930caee8e0d3c391a3e9f7b4e36181","schema_version":"1.0","event_id":"sha256:78ec69e288771bfae2ed557fdebdf19664930caee8e0d3c391a3e9f7b4e36181"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ON36UA432PYGK7BPBQEXOSMGFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Advances in Inference by Recursive Conditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adnan Darwiche, David Allen","submitted_at":"2012-10-19T15:03:22Z","abstract_excerpt":"Recursive Conditioning (RC) was introduced recently as the first any-space     algorithm for inference in Bayesian networks which can trade time for space by     varying the size of its cache at the increment needed to store a floating point     number. Under full caching, RC has an asymptotic time and space complexity     which is comparable to mainstream algorithms based on variable elimination and     clustering (exponential in the network treewidth and linear in its size). We     show two main results about RC in this paper. First, we show that its actual     space requirements under full "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2455","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iZDeRlKwEnSPmsPranpyx0TiEGWyMFxxc15CJAu1dCm82i2y+0KOo2iTyvm5HXeEhkufb+D980rH7g210XbGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:31:13.968969Z"},"content_sha256":"3532c169711cb9857b8e73fe6ea1e9d64588bf309158c0e5334991ada5cac945","schema_version":"1.0","event_id":"sha256:3532c169711cb9857b8e73fe6ea1e9d64588bf309158c0e5334991ada5cac945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON36UA432PYGK7BPBQEXOSMGFA/bundle.json","state_url":"https://pith.science/pith/ON36UA432PYGK7BPBQEXOSMGFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON36UA432PYGK7BPBQEXOSMGFA/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-07T14:31:13Z","links":{"resolver":"https://pith.science/pith/ON36UA432PYGK7BPBQEXOSMGFA","bundle":"https://pith.science/pith/ON36UA432PYGK7BPBQEXOSMGFA/bundle.json","state":"https://pith.science/pith/ON36UA432PYGK7BPBQEXOSMGFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON36UA432PYGK7BPBQEXOSMGFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ON36UA432PYGK7BPBQEXOSMGFA","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":"9c8f981a3d80f51350808db55f8f148c2d8dd121dfb6fc2dbefe49bb600c7832","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:03:22Z","title_canon_sha256":"8724c555f15c7bdf680ef9b82a959781074ee20e9f39b857ebf2f71343305563"},"schema_version":"1.0","source":{"id":"1212.2455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2455","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2455v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2455","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"ON36UA432PYG","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"ON36UA432PYGK7BP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"ON36UA43","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:3532c169711cb9857b8e73fe6ea1e9d64588bf309158c0e5334991ada5cac945","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"Recursive Conditioning (RC) was introduced recently as the first any-space     algorithm for inference in Bayesian networks which can trade time for space by     varying the size of its cache at the increment needed to store a floating point     number. Under full caching, RC has an asymptotic time and space complexity     which is comparable to mainstream algorithms based on variable elimination and     clustering (exponential in the network treewidth and linear in its size). We     show two main results about RC in this paper. First, we show that its actual     space requirements under full ","authors_text":"Adnan Darwiche, David Allen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:03:22Z","title":"New Advances in Inference by Recursive Conditioning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2455","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:78ec69e288771bfae2ed557fdebdf19664930caee8e0d3c391a3e9f7b4e36181","target":"record","created_at":"2026-05-18T03:38:44Z","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":"9c8f981a3d80f51350808db55f8f148c2d8dd121dfb6fc2dbefe49bb600c7832","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:03:22Z","title_canon_sha256":"8724c555f15c7bdf680ef9b82a959781074ee20e9f39b857ebf2f71343305563"},"schema_version":"1.0","source":{"id":"1212.2455","kind":"arxiv","version":1}},"canonical_sha256":"7377ea039bd3f0657c2f0c097749862810c69b0880503291416ccadb005fa9c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7377ea039bd3f0657c2f0c097749862810c69b0880503291416ccadb005fa9c9","first_computed_at":"2026-05-18T03:38:44.846598Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.846598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CkMrUxjbZ6iPUTHNq/IeTnJaoUqbFANapZr91BeShK62eQYshiwEeUJ6lgOuquU+1vtylUIuwoFYzaN+4uBsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.847065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:78ec69e288771bfae2ed557fdebdf19664930caee8e0d3c391a3e9f7b4e36181","sha256:3532c169711cb9857b8e73fe6ea1e9d64588bf309158c0e5334991ada5cac945"],"state_sha256":"e433a042985acd860754b86966db938797ae0a68d330a07ef968b4c56bc90177"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sMsPjJDihEJwIWplkDOt0zoAZTpx1XCNvWswRQoYXdK8rd8f70cLCMrmFEklu5feBoBNiZ3E8ek5rHt7NZyDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:31:13.972233Z","bundle_sha256":"b380b08a5570274be4752b196d8c4fed4aba242b35f6c4bc4fa74076ea53065f"}}