{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WRZI5NCNHGSSYI3K45GOOXTFMX","short_pith_number":"pith:WRZI5NCN","canonical_record":{"source":{"id":"1704.02939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T16:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"042151ec78feb221bd886901c551337d076bb1fdce482d3c629abd53f91be357","abstract_canon_sha256":"531c102b0bf489881aa045e500e37c5a68f19b9a8215a505ece57542f2639f30"},"schema_version":"1.0"},"canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","source":{"kind":"arxiv","id":"1704.02939","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02939","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02939v2","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02939","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"pith_short_12","alias_value":"WRZI5NCNHGSS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRZI5NCNHGSSYI3K","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRZI5NCN","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WRZI5NCNHGSSYI3K45GOOXTFMX","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02939","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T16:25:55Z","cross_cats_sorted":[],"title_canon_sha256":"042151ec78feb221bd886901c551337d076bb1fdce482d3c629abd53f91be357","abstract_canon_sha256":"531c102b0bf489881aa045e500e37c5a68f19b9a8215a505ece57542f2639f30"},"schema_version":"1.0"},"canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:58.063368Z","signature_b64":"KVOlaKbU/3QmX+KTE9UAf7zE0alVL18KVqMGh5/1zc4FYF1p1MeSJHnD/26MVBOwyHOG0zCwLtpDRnAo8BNOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","last_reissued_at":"2026-05-18T00:40:58.062710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:58.062710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02939","source_version":2,"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-18T00:40:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DjtrF+eDuXo6MyVi6l1d7hHVceKHB5evIgG3czynZNXA1DQprznIth/nn8cYAqhJ1WHWSC/4kqkgNGAP2SLsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:18:17.059959Z"},"content_sha256":"9520e11423c1f9ca9828c456df1378627adca56a2696c0d9c18d6be22f2050f0","schema_version":"1.0","event_id":"sha256:9520e11423c1f9ca9828c456df1378627adca56a2696c0d9c18d6be22f2050f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WRZI5NCNHGSSYI3K45GOOXTFMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minor-matching hypertree width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nikola Yolov","submitted_at":"2017-04-10T16:25:55Z","abstract_excerpt":"In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\\mu\\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a polynomially-sized restriction to each decomposition bag. The relaxed conditions of the decomposition allow a much wider class of graphs and hypergraphs of bounded width compared to other tree decompositions. We show that, for fixed $k$, there are $2^{(1 - \\frac1k + o(1)){n \\choose 2}}$ $n$-vertex graphs of minor-matching hypertree width at most $k$. A number of prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02939","kind":"arxiv","version":2},"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-18T00:40:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g589n9UaH03GWIEZy8wUu99qVojDnQ5t4awpE35Kd0CJ8JRnslufbofBJf55c+vG1ZYy8Q5+QjqBwtwhSfnnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T21:18:17.060512Z"},"content_sha256":"b3714b4e111a1a06467ba3c53ed715550305b4106aa75ae7e6266d5f1e35c08d","schema_version":"1.0","event_id":"sha256:b3714b4e111a1a06467ba3c53ed715550305b4106aa75ae7e6266d5f1e35c08d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/bundle.json","state_url":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/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-27T21:18:17Z","links":{"resolver":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX","bundle":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/bundle.json","state":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WRZI5NCNHGSSYI3K45GOOXTFMX","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":"531c102b0bf489881aa045e500e37c5a68f19b9a8215a505ece57542f2639f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T16:25:55Z","title_canon_sha256":"042151ec78feb221bd886901c551337d076bb1fdce482d3c629abd53f91be357"},"schema_version":"1.0","source":{"id":"1704.02939","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02939","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02939v2","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02939","created_at":"2026-05-18T00:40:58Z"},{"alias_kind":"pith_short_12","alias_value":"WRZI5NCNHGSS","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WRZI5NCNHGSSYI3K","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WRZI5NCN","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:b3714b4e111a1a06467ba3c53ed715550305b4106aa75ae7e6266d5f1e35c08d","target":"graph","created_at":"2026-05-18T00:40:58Z","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":"In this paper we present a new width measure for a tree decomposition, minor-matching hypertree width, $\\mu\\text{-}tw$, for graphs and hypergraphs, such that bounding the width guarantees that set of maximal independent sets has a polynomially-sized restriction to each decomposition bag. The relaxed conditions of the decomposition allow a much wider class of graphs and hypergraphs of bounded width compared to other tree decompositions. We show that, for fixed $k$, there are $2^{(1 - \\frac1k + o(1)){n \\choose 2}}$ $n$-vertex graphs of minor-matching hypertree width at most $k$. A number of prob","authors_text":"Nikola Yolov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T16:25:55Z","title":"Minor-matching hypertree width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02939","kind":"arxiv","version":2},"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:9520e11423c1f9ca9828c456df1378627adca56a2696c0d9c18d6be22f2050f0","target":"record","created_at":"2026-05-18T00:40:58Z","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":"531c102b0bf489881aa045e500e37c5a68f19b9a8215a505ece57542f2639f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-10T16:25:55Z","title_canon_sha256":"042151ec78feb221bd886901c551337d076bb1fdce482d3c629abd53f91be357"},"schema_version":"1.0","source":{"id":"1704.02939","kind":"arxiv","version":2}},"canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","first_computed_at":"2026-05-18T00:40:58.062710Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:58.062710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KVOlaKbU/3QmX+KTE9UAf7zE0alVL18KVqMGh5/1zc4FYF1p1MeSJHnD/26MVBOwyHOG0zCwLtpDRnAo8BNOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:58.063368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02939","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9520e11423c1f9ca9828c456df1378627adca56a2696c0d9c18d6be22f2050f0","sha256:b3714b4e111a1a06467ba3c53ed715550305b4106aa75ae7e6266d5f1e35c08d"],"state_sha256":"215b3c6a4df0b432b71be23a1e3dd482840996b5df977587100ab57e58f42786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2jl74WAJjunyKnCPlUQ0MoBygql+3C/bTEZsdRhyRWJApSvtDCzDwP2hn/2v9Pg2go9YnjBHt+xuWR8E/uQBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T21:18:17.063054Z","bundle_sha256":"d147eeb84ce79023bd736d7979596047551dfefee171e6e98c370542e8d14d30"}}