{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5SUTUPEYDAGGZJXQZYWT6OQHCP","short_pith_number":"pith:5SUTUPEY","canonical_record":{"source":{"id":"1611.01090","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-03T16:54:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0f79ac33620104fc996323b3312b18f912740cdfb0bb4f68cee6f2a1a2af939b","abstract_canon_sha256":"d61b3e506815e612768896ebdd16d2cd474708f6b0b9975536166e1b5f69fdc1"},"schema_version":"1.0"},"canonical_sha256":"eca93a3c98180c6ca6f0ce2d3f3a0713c94aba3ae7a3ab7a2cca7c4f8bf5fd60","source":{"kind":"arxiv","id":"1611.01090","version":11},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01090","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01090v11","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01090","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"5SUTUPEYDAGG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SUTUPEYDAGGZJXQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SUTUPEY","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5SUTUPEYDAGGZJXQZYWT6OQHCP","target":"record","payload":{"canonical_record":{"source":{"id":"1611.01090","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-03T16:54:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"0f79ac33620104fc996323b3312b18f912740cdfb0bb4f68cee6f2a1a2af939b","abstract_canon_sha256":"d61b3e506815e612768896ebdd16d2cd474708f6b0b9975536166e1b5f69fdc1"},"schema_version":"1.0"},"canonical_sha256":"eca93a3c98180c6ca6f0ce2d3f3a0713c94aba3ae7a3ab7a2cca7c4f8bf5fd60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:21.078954Z","signature_b64":"Img3pSOr890aQ7B/7KXb7f53I5SEke7LM1Hl1HW9IJyaKVh998OImZc8v5dqUTI15k3mltHFozX61IhBXlS3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eca93a3c98180c6ca6f0ce2d3f3a0713c94aba3ae7a3ab7a2cca7c4f8bf5fd60","last_reissued_at":"2026-05-17T23:40:21.078257Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:21.078257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.01090","source_version":11,"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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5qOjtBR2Pb8gkg8xNgtRheqd/FiSUDuqHNT/1co+JK7aJCTuYAdo4vCW9akOAj1Lt77hw7S4gkzdRhbhhisAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:42:26.794470Z"},"content_sha256":"663536cdea6eb7e4fd5e7311d1f9c155077c32712455340620271d1822f04245","schema_version":"1.0","event_id":"sha256:663536cdea6eb7e4fd5e7311d1f9c155077c32712455340620271d1822f04245"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5SUTUPEYDAGGZJXQZYWT6OQHCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"General and Fractional Hypertree Decompositions: Hard and Easy Cases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DB","authors_text":"Georg Gottlob, Reinhard Pichler, Wolfgang Fischl","submitted_at":"2016-11-03T16:54:37Z","abstract_excerpt":"Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering conjunctive queries and for the solution of constraint satisfaction problems. Every hypergraph H has a width relative to each of these decomposition methods: its hypertree width hw(H), its generalized hypertree width ghw(H), and its fractional hypertree width fhw(H), respectively.\n  It is known that hw(H) <= k can be checked in polynomial time for fixed k, while"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01090","kind":"arxiv","version":11},"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-17T23:40:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FUJXIUNV66MVBp1BmktPTV+ZcoO+uFYOHQKBN1awoG9gy7YxY76lu5Xkq7z6prVEY1QpPaaKVJ615mUFZCRTDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T10:42:26.794817Z"},"content_sha256":"dfa9e1c15aec953f06eb3cd12675d2427403955573c1b1cf4b0c300e4b067cdf","schema_version":"1.0","event_id":"sha256:dfa9e1c15aec953f06eb3cd12675d2427403955573c1b1cf4b0c300e4b067cdf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/bundle.json","state_url":"https://pith.science/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/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-01T10:42:26Z","links":{"resolver":"https://pith.science/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP","bundle":"https://pith.science/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/bundle.json","state":"https://pith.science/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SUTUPEYDAGGZJXQZYWT6OQHCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SUTUPEYDAGGZJXQZYWT6OQHCP","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":"d61b3e506815e612768896ebdd16d2cd474708f6b0b9975536166e1b5f69fdc1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-03T16:54:37Z","title_canon_sha256":"0f79ac33620104fc996323b3312b18f912740cdfb0bb4f68cee6f2a1a2af939b"},"schema_version":"1.0","source":{"id":"1611.01090","kind":"arxiv","version":11}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01090","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01090v11","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01090","created_at":"2026-05-17T23:40:21Z"},{"alias_kind":"pith_short_12","alias_value":"5SUTUPEYDAGG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SUTUPEYDAGGZJXQ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SUTUPEY","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:dfa9e1c15aec953f06eb3cd12675d2427403955573c1b1cf4b0c300e4b067cdf","target":"graph","created_at":"2026-05-17T23:40:21Z","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":"Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering conjunctive queries and for the solution of constraint satisfaction problems. Every hypergraph H has a width relative to each of these decomposition methods: its hypertree width hw(H), its generalized hypertree width ghw(H), and its fractional hypertree width fhw(H), respectively.\n  It is known that hw(H) <= k can be checked in polynomial time for fixed k, while","authors_text":"Georg Gottlob, Reinhard Pichler, Wolfgang Fischl","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-03T16:54:37Z","title":"General and Fractional Hypertree Decompositions: Hard and Easy Cases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01090","kind":"arxiv","version":11},"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:663536cdea6eb7e4fd5e7311d1f9c155077c32712455340620271d1822f04245","target":"record","created_at":"2026-05-17T23:40:21Z","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":"d61b3e506815e612768896ebdd16d2cd474708f6b0b9975536166e1b5f69fdc1","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-03T16:54:37Z","title_canon_sha256":"0f79ac33620104fc996323b3312b18f912740cdfb0bb4f68cee6f2a1a2af939b"},"schema_version":"1.0","source":{"id":"1611.01090","kind":"arxiv","version":11}},"canonical_sha256":"eca93a3c98180c6ca6f0ce2d3f3a0713c94aba3ae7a3ab7a2cca7c4f8bf5fd60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eca93a3c98180c6ca6f0ce2d3f3a0713c94aba3ae7a3ab7a2cca7c4f8bf5fd60","first_computed_at":"2026-05-17T23:40:21.078257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:21.078257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Img3pSOr890aQ7B/7KXb7f53I5SEke7LM1Hl1HW9IJyaKVh998OImZc8v5dqUTI15k3mltHFozX61IhBXlS3Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:21.078954Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01090","source_kind":"arxiv","source_version":11}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:663536cdea6eb7e4fd5e7311d1f9c155077c32712455340620271d1822f04245","sha256:dfa9e1c15aec953f06eb3cd12675d2427403955573c1b1cf4b0c300e4b067cdf"],"state_sha256":"a3521c21325056ec986a4a04b6b7b7f5b127ab5098d5097d887173a8928b40ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"baBnO3PRFUpWgT6VJLIve2oQVsz1MlyMZlY4NwbQ+lu1s/xSVQlo+/cDLNmCbfErwSq8E4OAMMJROdK5MRQ4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T10:42:26.796702Z","bundle_sha256":"085be2b84996efae17d5a464308b11c042205fedb35521a18efc2c95c20be543"}}