{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WRZI5NCNHGSSYI3K45GOOXTFMX","short_pith_number":"pith:WRZI5NCN","schema_version":"1.0","canonical_sha256":"b4728eb44d39a52c236ae74ce75e6565e6be75633ff5e463830f3a70182e788a","source":{"kind":"arxiv","id":"1704.02939","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1704.02939","created_at":"2026-05-18T00:40:58.062804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.02939v2","created_at":"2026-05-18T00:40:58.062804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02939","created_at":"2026-05-18T00:40:58.062804+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRZI5NCNHGSS","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRZI5NCNHGSSYI3K","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRZI5NCN","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX","json":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX.json","graph_json":"https://pith.science/api/pith-number/WRZI5NCNHGSSYI3K45GOOXTFMX/graph.json","events_json":"https://pith.science/api/pith-number/WRZI5NCNHGSSYI3K45GOOXTFMX/events.json","paper":"https://pith.science/paper/WRZI5NCN"},"agent_actions":{"view_html":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX","download_json":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX.json","view_paper":"https://pith.science/paper/WRZI5NCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.02939&json=true","fetch_graph":"https://pith.science/api/pith-number/WRZI5NCNHGSSYI3K45GOOXTFMX/graph.json","fetch_events":"https://pith.science/api/pith-number/WRZI5NCNHGSSYI3K45GOOXTFMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/action/storage_attestation","attest_author":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/action/author_attestation","sign_citation":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/action/citation_signature","submit_replication":"https://pith.science/pith/WRZI5NCNHGSSYI3K45GOOXTFMX/action/replication_record"}},"created_at":"2026-05-18T00:40:58.062804+00:00","updated_at":"2026-05-18T00:40:58.062804+00:00"}