{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IGEN6HVQLFUAMLIKIFH2L4YFQY","short_pith_number":"pith:IGEN6HVQ","schema_version":"1.0","canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","source":{"kind":"arxiv","id":"1807.08423","version":2},"attestation_state":"computed","paper":{"title":"Tree decompositions of graphs without large bipartite holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Younjin Kim","submitted_at":"2018-07-23T03:52:44Z","abstract_excerpt":"A recent result of Condon, Kim, K\\\"{u}hn and Osthus implies that for any $r\\geq (\\frac{1}{2}+o(1))n$, an $n$-vertex almost $r$-regular graph $G$ has an approximate decomposition into any collections of $n$-vertex bounded degree trees. In this paper, we prove that a similar result holds for an almost $\\alpha n$-regular graph $G$ with any $\\alpha>0$ and a collection of bounded degree trees on at most $(1-o(1))n$ vertices if $G$ does not contain large bipartite holes. This result is sharp in the sense that it is necessary to exclude large bipartite holes and we cannot hope for an approximate deco"},"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":"1807.08423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-23T03:52:44Z","cross_cats_sorted":[],"title_canon_sha256":"c95f0c01e5d97617d11704da8905fba0aa9805235ee2e7840e61398c9d47d763","abstract_canon_sha256":"d060df7aeb18ff6429e76513d89d449e6c217d9af5d8442bdcd59cea87e93e9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:17.159915Z","signature_b64":"Jj1f1RggWKR7uNb2oMlSnxkLb4GKlwHcSHtaVCh28aNhGgvJriMnJOZN72BBokWLY3E8Uty6FELmWxHeM6AUDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","last_reissued_at":"2026-05-18T00:07:17.159388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:17.159388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree decompositions of graphs without large bipartite holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Jaehoon Kim, Younjin Kim","submitted_at":"2018-07-23T03:52:44Z","abstract_excerpt":"A recent result of Condon, Kim, K\\\"{u}hn and Osthus implies that for any $r\\geq (\\frac{1}{2}+o(1))n$, an $n$-vertex almost $r$-regular graph $G$ has an approximate decomposition into any collections of $n$-vertex bounded degree trees. In this paper, we prove that a similar result holds for an almost $\\alpha n$-regular graph $G$ with any $\\alpha>0$ and a collection of bounded degree trees on at most $(1-o(1))n$ vertices if $G$ does not contain large bipartite holes. This result is sharp in the sense that it is necessary to exclude large bipartite holes and we cannot hope for an approximate deco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08423","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":"1807.08423","created_at":"2026-05-18T00:07:17.159462+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08423v2","created_at":"2026-05-18T00:07:17.159462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08423","created_at":"2026-05-18T00:07:17.159462+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGEN6HVQLFUA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGEN6HVQLFUAMLIK","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGEN6HVQ","created_at":"2026-05-18T12:32:28.185984+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/IGEN6HVQLFUAMLIKIFH2L4YFQY","json":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY.json","graph_json":"https://pith.science/api/pith-number/IGEN6HVQLFUAMLIKIFH2L4YFQY/graph.json","events_json":"https://pith.science/api/pith-number/IGEN6HVQLFUAMLIKIFH2L4YFQY/events.json","paper":"https://pith.science/paper/IGEN6HVQ"},"agent_actions":{"view_html":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY","download_json":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY.json","view_paper":"https://pith.science/paper/IGEN6HVQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08423&json=true","fetch_graph":"https://pith.science/api/pith-number/IGEN6HVQLFUAMLIKIFH2L4YFQY/graph.json","fetch_events":"https://pith.science/api/pith-number/IGEN6HVQLFUAMLIKIFH2L4YFQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/action/storage_attestation","attest_author":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/action/author_attestation","sign_citation":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/action/citation_signature","submit_replication":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/action/replication_record"}},"created_at":"2026-05-18T00:07:17.159462+00:00","updated_at":"2026-05-18T00:07:17.159462+00:00"}