{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:PHG5DG5DKQCUCOZVORSI737QGV","short_pith_number":"pith:PHG5DG5D","canonical_record":{"source":{"id":"1206.3284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"53c7af0efee7c1cfa84f0134a081d5ae48367061dc4621d81b18305b3e27088c","abstract_canon_sha256":"891ad1bbdb75f76f73891017e03e6d112791a65cec0cdf9023b0c802c033c49d"},"schema_version":"1.0"},"canonical_sha256":"79cdd19ba35405413b3574648feff0354c5cb9d206199db16060d3cb62640e0c","source":{"kind":"arxiv","id":"1206.3284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3284","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3284v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3284","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"PHG5DG5DKQCU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PHG5DG5DKQCUCOZV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PHG5DG5D","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:PHG5DG5DKQCUCOZVORSI737QGV","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:44:34Z","cross_cats_sorted":[],"title_canon_sha256":"53c7af0efee7c1cfa84f0134a081d5ae48367061dc4621d81b18305b3e27088c","abstract_canon_sha256":"891ad1bbdb75f76f73891017e03e6d112791a65cec0cdf9023b0c802c033c49d"},"schema_version":"1.0"},"canonical_sha256":"79cdd19ba35405413b3574648feff0354c5cb9d206199db16060d3cb62640e0c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:30.755953Z","signature_b64":"S5A3Fs7QN0TDb7kyu3MakodHX3MCMy1tCIO7/dZeQVPeA6BgqYIIJjTn7KJq9YgDwijA+OofN+rH9IrE3cZSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79cdd19ba35405413b3574648feff0354c5cb9d206199db16060d3cb62640e0c","last_reissued_at":"2026-05-18T03:53:30.755365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:30.755365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3284","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDmnOrzY1MQtEUrULPutH1FKTD5B1Ek5cOe19kufvZ1NqHCn2MN3BUQQnWSBYW61SJc3B/rgSWh73UA3KXOGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:21:44.712451Z"},"content_sha256":"263d7cfa8f167d71daa129d767ceddfe2fe89d8dd9940f164cbc70410fed36b3","schema_version":"1.0","event_id":"sha256:263d7cfa8f167d71daa129d767ceddfe2fe89d8dd9940f164cbc70410fed36b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:PHG5DG5DKQCUCOZVORSI737QGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounding Search Space Size via (Hyper)tree Decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lars Otten, Rina Dechter","submitted_at":"2012-06-13T15:44:34Z","abstract_excerpt":"This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism in the problem specification and produce tighter bounds. We demonstrate on a variety of practical problem instances that we are often able to improve upon existing bounds by several orders of magnitude."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3284","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:53:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usLCyzkrcIm6OX0v/eM71W/PGLcM94/o1NAJDCDey9S4wYwHKiyozTjCKrWNB9+lo10PsGKt84b15UwAxVW+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:21:44.712812Z"},"content_sha256":"4a84f112f271b6db56c1b6679817cf74a99f718fe5c01b5d873652d185bf6b97","schema_version":"1.0","event_id":"sha256:4a84f112f271b6db56c1b6679817cf74a99f718fe5c01b5d873652d185bf6b97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHG5DG5DKQCUCOZVORSI737QGV/bundle.json","state_url":"https://pith.science/pith/PHG5DG5DKQCUCOZVORSI737QGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHG5DG5DKQCUCOZVORSI737QGV/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-05-31T01:21:44Z","links":{"resolver":"https://pith.science/pith/PHG5DG5DKQCUCOZVORSI737QGV","bundle":"https://pith.science/pith/PHG5DG5DKQCUCOZVORSI737QGV/bundle.json","state":"https://pith.science/pith/PHG5DG5DKQCUCOZVORSI737QGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHG5DG5DKQCUCOZVORSI737QGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PHG5DG5DKQCUCOZVORSI737QGV","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":"891ad1bbdb75f76f73891017e03e6d112791a65cec0cdf9023b0c802c033c49d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:44:34Z","title_canon_sha256":"53c7af0efee7c1cfa84f0134a081d5ae48367061dc4621d81b18305b3e27088c"},"schema_version":"1.0","source":{"id":"1206.3284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3284","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3284v1","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3284","created_at":"2026-05-18T03:53:30Z"},{"alias_kind":"pith_short_12","alias_value":"PHG5DG5DKQCU","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PHG5DG5DKQCUCOZV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PHG5DG5D","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:4a84f112f271b6db56c1b6679817cf74a99f718fe5c01b5d873652d185bf6b97","target":"graph","created_at":"2026-05-18T03:53:30Z","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":"This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to the recent notion of hypertree decompositions allows to exploit determinism in the problem specification and produce tighter bounds. We demonstrate on a variety of practical problem instances that we are often able to improve upon existing bounds by several orders of magnitude.","authors_text":"Lars Otten, Rina Dechter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:44:34Z","title":"Bounding Search Space Size via (Hyper)tree Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3284","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:263d7cfa8f167d71daa129d767ceddfe2fe89d8dd9940f164cbc70410fed36b3","target":"record","created_at":"2026-05-18T03:53:30Z","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":"891ad1bbdb75f76f73891017e03e6d112791a65cec0cdf9023b0c802c033c49d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-13T15:44:34Z","title_canon_sha256":"53c7af0efee7c1cfa84f0134a081d5ae48367061dc4621d81b18305b3e27088c"},"schema_version":"1.0","source":{"id":"1206.3284","kind":"arxiv","version":1}},"canonical_sha256":"79cdd19ba35405413b3574648feff0354c5cb9d206199db16060d3cb62640e0c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79cdd19ba35405413b3574648feff0354c5cb9d206199db16060d3cb62640e0c","first_computed_at":"2026-05-18T03:53:30.755365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:30.755365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S5A3Fs7QN0TDb7kyu3MakodHX3MCMy1tCIO7/dZeQVPeA6BgqYIIJjTn7KJq9YgDwijA+OofN+rH9IrE3cZSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:30.755953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:263d7cfa8f167d71daa129d767ceddfe2fe89d8dd9940f164cbc70410fed36b3","sha256:4a84f112f271b6db56c1b6679817cf74a99f718fe5c01b5d873652d185bf6b97"],"state_sha256":"568544ef6b7a865c4220fa24979361ed580a071d8e388a1c49fad88ebdb77c4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLaU8L3Ki8aCTGVR/QOUf+XSSdgBduSpTpv6BpAMWgduzvZfl2hN/h43XcXp9VxafN8DpRlh+diLSRX8r+W/Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:21:44.715088Z","bundle_sha256":"bf86f0c492772e9edcdbb30112ed7b630e6d7eac02dd3ece25906bf7f744d489"}}