{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GLK5BGUR4W2J4P5UUZZB46DKXF","short_pith_number":"pith:GLK5BGUR","canonical_record":{"source":{"id":"1207.1418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"f311515b2b23af555d164828f9ec1c00e821c847c4403a8198760a8f7d0a31b5","abstract_canon_sha256":"a620e7a70e999d1523a65bbcef0e8c857a3eff501f972998a365cd79e8c32aca"},"schema_version":"1.0"},"canonical_sha256":"32d5d09a91e5b49e3fb4a6721e786ab955295bd54633b21c077868326ce52497","source":{"kind":"arxiv","id":"1207.1418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1418","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1418v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1418","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"GLK5BGUR4W2J","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GLK5BGUR4W2J4P5U","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GLK5BGUR","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GLK5BGUR4W2J4P5UUZZB46DKXF","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:26:12Z","cross_cats_sorted":[],"title_canon_sha256":"f311515b2b23af555d164828f9ec1c00e821c847c4403a8198760a8f7d0a31b5","abstract_canon_sha256":"a620e7a70e999d1523a65bbcef0e8c857a3eff501f972998a365cd79e8c32aca"},"schema_version":"1.0"},"canonical_sha256":"32d5d09a91e5b49e3fb4a6721e786ab955295bd54633b21c077868326ce52497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.157969Z","signature_b64":"6Xw4pRgJJc5mDWxojb3Kh97prqrtx3RqaoObP87CtMhJMysGo9HXjugu3j8PO+hHGH9cuWRpZP0lJK0/LrqjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32d5d09a91e5b49e3fb4a6721e786ab955295bd54633b21c077868326ce52497","last_reissued_at":"2026-05-18T03:51:37.157530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.157530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1418","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xljGVVSrQPQlZfZHA1u8NEsADXzw0Bs1B0sBSSD4yrO9hbkJn+AJr0kmS4cPJoFdQeD8QlRzkIaX3GRwDo2eBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:56:16.938252Z"},"content_sha256":"690ee371c8373adf044ce0ed286634ec5315e13e39683c1aec52d94d9f1ac841","schema_version":"1.0","event_id":"sha256:690ee371c8373adf044ce0ed286634ec5315e13e39683c1aec52d94d9f1ac841"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GLK5BGUR4W2J4P5UUZZB46DKXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Test Selection in Active Diagnosis via Entropy Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alice X. Zheng, Alina Beygelzimer, Irina Rish","submitted_at":"2012-07-04T16:26:12Z","abstract_excerpt":"We consider the problem of diagnosing faults in a system represented by a Bayesian network, where diagnosis corresponds to recovering the most likely state of unobserved nodes given the outcomes of tests (observed nodes). Finding an optimal subset of tests in this setting is intractable in general. We show that it is difficult even to compute the next most-informative test using greedy test selection, as it involves several entropy terms whose exact computation is intractable. We propose an approximate approach that utilizes the loopy belief propagation infrastructure to simultaneously compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1418","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEw8oNaj4KwfxJ6zk/1iXPr0wKCWOsRM9Dj+/tlpBylnxzPavH9JUBpit4FPdc4OocCJ2ixSDnjWZ8AayuSgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:56:16.938611Z"},"content_sha256":"8b3c5ae531ecb031b11a5aedb3f7266bff77b13288da52ce176784259c9bdbb0","schema_version":"1.0","event_id":"sha256:8b3c5ae531ecb031b11a5aedb3f7266bff77b13288da52ce176784259c9bdbb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/bundle.json","state_url":"https://pith.science/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/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-03T06:56:16Z","links":{"resolver":"https://pith.science/pith/GLK5BGUR4W2J4P5UUZZB46DKXF","bundle":"https://pith.science/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/bundle.json","state":"https://pith.science/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLK5BGUR4W2J4P5UUZZB46DKXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GLK5BGUR4W2J4P5UUZZB46DKXF","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":"a620e7a70e999d1523a65bbcef0e8c857a3eff501f972998a365cd79e8c32aca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:26:12Z","title_canon_sha256":"f311515b2b23af555d164828f9ec1c00e821c847c4403a8198760a8f7d0a31b5"},"schema_version":"1.0","source":{"id":"1207.1418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1418","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1418v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1418","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"GLK5BGUR4W2J","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GLK5BGUR4W2J4P5U","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GLK5BGUR","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:8b3c5ae531ecb031b11a5aedb3f7266bff77b13288da52ce176784259c9bdbb0","target":"graph","created_at":"2026-05-18T03:51:37Z","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 consider the problem of diagnosing faults in a system represented by a Bayesian network, where diagnosis corresponds to recovering the most likely state of unobserved nodes given the outcomes of tests (observed nodes). Finding an optimal subset of tests in this setting is intractable in general. We show that it is difficult even to compute the next most-informative test using greedy test selection, as it involves several entropy terms whose exact computation is intractable. We propose an approximate approach that utilizes the loopy belief propagation infrastructure to simultaneously compute","authors_text":"Alice X. Zheng, Alina Beygelzimer, Irina Rish","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:26:12Z","title":"Efficient Test Selection in Active Diagnosis via Entropy Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1418","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:690ee371c8373adf044ce0ed286634ec5315e13e39683c1aec52d94d9f1ac841","target":"record","created_at":"2026-05-18T03:51:37Z","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":"a620e7a70e999d1523a65bbcef0e8c857a3eff501f972998a365cd79e8c32aca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-07-04T16:26:12Z","title_canon_sha256":"f311515b2b23af555d164828f9ec1c00e821c847c4403a8198760a8f7d0a31b5"},"schema_version":"1.0","source":{"id":"1207.1418","kind":"arxiv","version":1}},"canonical_sha256":"32d5d09a91e5b49e3fb4a6721e786ab955295bd54633b21c077868326ce52497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32d5d09a91e5b49e3fb4a6721e786ab955295bd54633b21c077868326ce52497","first_computed_at":"2026-05-18T03:51:37.157530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.157530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Xw4pRgJJc5mDWxojb3Kh97prqrtx3RqaoObP87CtMhJMysGo9HXjugu3j8PO+hHGH9cuWRpZP0lJK0/LrqjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.157969Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:690ee371c8373adf044ce0ed286634ec5315e13e39683c1aec52d94d9f1ac841","sha256:8b3c5ae531ecb031b11a5aedb3f7266bff77b13288da52ce176784259c9bdbb0"],"state_sha256":"f2646d1d8355c35949acf4611a2cba867cf7d6d77beab013c3c46e34e2ad2ce7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cu00aav+dtupqBsyUjPi1SOBAThW6czYYSdycXINXJYLFYhS5CaOUApaYKZuDxlhxNfNrGXg0DKe7WqYaZ8wBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:56:16.940841Z","bundle_sha256":"52dc7772e6e7c9def88d35787a79f82eb162e3326148c3d923af02f36afa37ff"}}