{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IGEN6HVQLFUAMLIKIFH2L4YFQY","short_pith_number":"pith:IGEN6HVQ","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"},"canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","source":{"kind":"arxiv","id":"1807.08423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08423","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08423v2","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08423","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"IGEN6HVQLFUA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGEN6HVQLFUAMLIK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGEN6HVQ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IGEN6HVQLFUAMLIKIFH2L4YFQY","target":"record","payload":{"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"},"canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","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"},"source_kind":"arxiv","source_id":"1807.08423","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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kbws56xGnkWYTC/kZyMjgrrD8ObN3eRTo1alZrNzQF0PgXPixHjj5vK7RUnDYnX+rEJkSFOq6JOzSWbMz7IUBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:36.925475Z"},"content_sha256":"f6c2629b228e9e5c7d66e61c2b069175492248eef13f984c4e17dd51df14bf1d","schema_version":"1.0","event_id":"sha256:f6c2629b228e9e5c7d66e61c2b069175492248eef13f984c4e17dd51df14bf1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IGEN6HVQLFUAMLIKIFH2L4YFQY","target":"graph","payload":{"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"},"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:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbp/M2URJv8QnoVupavot2641o5HlWhQkKQIEm2g90uzA7t5XpxTWDyMp26sMXxy1MkSn96S6QgMXQGIFywhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:23:36.926206Z"},"content_sha256":"341c1b58710e797ab904e3346c91e55bc42c3ddd5b34a2120786e7977a4887db","schema_version":"1.0","event_id":"sha256:341c1b58710e797ab904e3346c91e55bc42c3ddd5b34a2120786e7977a4887db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/bundle.json","state_url":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/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-05-27T09:23:36Z","links":{"resolver":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY","bundle":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/bundle.json","state":"https://pith.science/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGEN6HVQLFUAMLIKIFH2L4YFQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IGEN6HVQLFUAMLIKIFH2L4YFQY","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":"d060df7aeb18ff6429e76513d89d449e6c217d9af5d8442bdcd59cea87e93e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-23T03:52:44Z","title_canon_sha256":"c95f0c01e5d97617d11704da8905fba0aa9805235ee2e7840e61398c9d47d763"},"schema_version":"1.0","source":{"id":"1807.08423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.08423","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1807.08423v2","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08423","created_at":"2026-05-18T00:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"IGEN6HVQLFUA","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IGEN6HVQLFUAMLIK","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IGEN6HVQ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:341c1b58710e797ab904e3346c91e55bc42c3ddd5b34a2120786e7977a4887db","target":"graph","created_at":"2026-05-18T00:07:17Z","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":"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","authors_text":"Hong Liu, Jaehoon Kim, Younjin Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-23T03:52:44Z","title":"Tree decompositions of graphs without large bipartite holes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08423","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:f6c2629b228e9e5c7d66e61c2b069175492248eef13f984c4e17dd51df14bf1d","target":"record","created_at":"2026-05-18T00:07:17Z","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":"d060df7aeb18ff6429e76513d89d449e6c217d9af5d8442bdcd59cea87e93e9a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-23T03:52:44Z","title_canon_sha256":"c95f0c01e5d97617d11704da8905fba0aa9805235ee2e7840e61398c9d47d763"},"schema_version":"1.0","source":{"id":"1807.08423","kind":"arxiv","version":2}},"canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4188df1eb05968062d0a414fa5f30586314d4f9f20e902f203b5e09e9a66edbe","first_computed_at":"2026-05-18T00:07:17.159388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:17.159388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jj1f1RggWKR7uNb2oMlSnxkLb4GKlwHcSHtaVCh28aNhGgvJriMnJOZN72BBokWLY3E8Uty6FELmWxHeM6AUDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:17.159915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.08423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6c2629b228e9e5c7d66e61c2b069175492248eef13f984c4e17dd51df14bf1d","sha256:341c1b58710e797ab904e3346c91e55bc42c3ddd5b34a2120786e7977a4887db"],"state_sha256":"97c8c2e8cdcbd89138165bd5325a609a4de601f664995ab3e73427b9d11f0f29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77cfZX0j3DzQG/ZyDJnDVEejww/AM7jazGkFzf6xPs4CskGfPsAPp9h7swe2phX0/g4m2khmXO0ViN2FudVoBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:23:36.929691Z","bundle_sha256":"76a3cd62f3f42592a6488fd37be89c034c4fd1135b98c87401a8d695f5b0fb8a"}}