{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LVGGXTOOTMQC4DWPXB5KCKLOMN","short_pith_number":"pith:LVGGXTOO","canonical_record":{"source":{"id":"1306.0751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-04T12:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"f6334c0c36dfea18f161b6a128d7806450e5e289aaa3a58d362285220f8b5946","abstract_canon_sha256":"658bd33dd2e0eec1418ea09bb245dacb8854594bbb601e0a44551a26797c73ab"},"schema_version":"1.0"},"canonical_sha256":"5d4c6bcdce9b202e0ecfb87aa1296e6378d6c6e7a83ddd13c3ece192cd2c1a42","source":{"kind":"arxiv","id":"1306.0751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0751","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0751v1","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0751","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"LVGGXTOOTMQC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LVGGXTOOTMQC4DWP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LVGGXTOO","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LVGGXTOOTMQC4DWPXB5KCKLOMN","target":"record","payload":{"canonical_record":{"source":{"id":"1306.0751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-04T12:43:07Z","cross_cats_sorted":[],"title_canon_sha256":"f6334c0c36dfea18f161b6a128d7806450e5e289aaa3a58d362285220f8b5946","abstract_canon_sha256":"658bd33dd2e0eec1418ea09bb245dacb8854594bbb601e0a44551a26797c73ab"},"schema_version":"1.0"},"canonical_sha256":"5d4c6bcdce9b202e0ecfb87aa1296e6378d6c6e7a83ddd13c3ece192cd2c1a42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:53.293209Z","signature_b64":"L5yB/dZU3Ucj1wWRQrGPXMY7tTmmFF3sH2B/BzE5xYfjfEVvGCvJySBcBHKw9dP0fBRycvXYhtlIwD3wCiL9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d4c6bcdce9b202e0ecfb87aa1296e6378d6c6e7a83ddd13c3ece192cd2c1a42","last_reissued_at":"2026-05-18T03:21:53.292832Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:53.292832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.0751","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:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0bkaPu5LqL3LQ5igmi79xModIsU2ani3wDVhQg2I3oBgY+Dfno25Yn4kG42+4sIQGtahENZNPuu93yQffXpBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:50:09.516258Z"},"content_sha256":"69382ca9eb3edd4ec3f01fa6fda7e0cf908d76a15a2b0e7f2810653db296bc14","schema_version":"1.0","event_id":"sha256:69382ca9eb3edd4ec3f01fa6fda7e0cf908d76a15a2b0e7f2810653db296bc14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LVGGXTOOTMQC4DWPXB5KCKLOMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First-Order Decomposition Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Hendrik Blockeel, Jesse Davis, Nima Taghipour","submitted_at":"2013-06-04T12:43:07Z","abstract_excerpt":"Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the propositional case, there exist formal structures, such as decomposition trees (dtrees), that represent such a decomposition and allow us to determine the complexity of inference a priori. However, there is currently no equivalent structure nor analogous complexity results for lifted inference. In this paper, we introduce FO-dtrees, which upgrade propositional dtrees t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0751","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:21:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cjZHjwcpIlzQRX8DgzpSnKqcwFU4mRAUiTD/XthJbArQFz4zH84RDlIS1XG+06WPxoS2QCabbB5wDknswyZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:50:09.516622Z"},"content_sha256":"4c80dfcbbf9ca5a258bcc66a23cf633d70a5b246374daa6dc98578573060aae2","schema_version":"1.0","event_id":"sha256:4c80dfcbbf9ca5a258bcc66a23cf633d70a5b246374daa6dc98578573060aae2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/bundle.json","state_url":"https://pith.science/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/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-01T04:50:09Z","links":{"resolver":"https://pith.science/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN","bundle":"https://pith.science/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/bundle.json","state":"https://pith.science/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVGGXTOOTMQC4DWPXB5KCKLOMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LVGGXTOOTMQC4DWPXB5KCKLOMN","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":"658bd33dd2e0eec1418ea09bb245dacb8854594bbb601e0a44551a26797c73ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-04T12:43:07Z","title_canon_sha256":"f6334c0c36dfea18f161b6a128d7806450e5e289aaa3a58d362285220f8b5946"},"schema_version":"1.0","source":{"id":"1306.0751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.0751","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"arxiv_version","alias_value":"1306.0751v1","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0751","created_at":"2026-05-18T03:21:53Z"},{"alias_kind":"pith_short_12","alias_value":"LVGGXTOOTMQC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LVGGXTOOTMQC4DWP","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LVGGXTOO","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:4c80dfcbbf9ca5a258bcc66a23cf633d70a5b246374daa6dc98578573060aae2","target":"graph","created_at":"2026-05-18T03:21:53Z","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":"Lifting attempts to speed up probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the propositional case, there exist formal structures, such as decomposition trees (dtrees), that represent such a decomposition and allow us to determine the complexity of inference a priori. However, there is currently no equivalent structure nor analogous complexity results for lifted inference. In this paper, we introduce FO-dtrees, which upgrade propositional dtrees t","authors_text":"Hendrik Blockeel, Jesse Davis, Nima Taghipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-04T12:43:07Z","title":"First-Order Decomposition Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0751","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:69382ca9eb3edd4ec3f01fa6fda7e0cf908d76a15a2b0e7f2810653db296bc14","target":"record","created_at":"2026-05-18T03:21:53Z","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":"658bd33dd2e0eec1418ea09bb245dacb8854594bbb601e0a44551a26797c73ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-04T12:43:07Z","title_canon_sha256":"f6334c0c36dfea18f161b6a128d7806450e5e289aaa3a58d362285220f8b5946"},"schema_version":"1.0","source":{"id":"1306.0751","kind":"arxiv","version":1}},"canonical_sha256":"5d4c6bcdce9b202e0ecfb87aa1296e6378d6c6e7a83ddd13c3ece192cd2c1a42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d4c6bcdce9b202e0ecfb87aa1296e6378d6c6e7a83ddd13c3ece192cd2c1a42","first_computed_at":"2026-05-18T03:21:53.292832Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:53.292832Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L5yB/dZU3Ucj1wWRQrGPXMY7tTmmFF3sH2B/BzE5xYfjfEVvGCvJySBcBHKw9dP0fBRycvXYhtlIwD3wCiL9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:53.293209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.0751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69382ca9eb3edd4ec3f01fa6fda7e0cf908d76a15a2b0e7f2810653db296bc14","sha256:4c80dfcbbf9ca5a258bcc66a23cf633d70a5b246374daa6dc98578573060aae2"],"state_sha256":"d1efa1e84e82a47b137d7b4f83fb500a9f750d3e439133ed1e519f7866852fd3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TA3JCVOO7tPS8QeANlrIXou215G8IetoA5c3mdPbylVD71iESfWwSitWk2kkQXnmm66UtuVNg0Zedy21NzeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:50:09.518628Z","bundle_sha256":"64d73ecd173d0f5f926f4e549ef7ff96d909710109cb554d038e5e240150da74"}}