{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LMWHOQWVDIMW4JJOI2ZVQ7V4WG","short_pith_number":"pith:LMWHOQWV","schema_version":"1.0","canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","source":{"kind":"arxiv","id":"2608.12723","version":1},"attestation_state":"computed","paper":{"title":"Tree-partitions of graphs with bounded tree-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huayue Liu, Rong chen","submitted_at":"2026-08-13T02:09:50Z","abstract_excerpt":"Wood~ recently showed that every graph $G$ of pathwidth $h$ and $\\Delta(G)\\ge1$ admits a $T$-partition of width at most $4(h+1)^2\\Delta(G)$ for some tree $T$ with $pw(T)\\leq2h+1$. In this paper, we establish an analogous result for tree-depth, which is a stronger parameter than pathwidth. We prove that every connected graph with tree-depth $h$ admits a $T$-partition of width at most $\\mathrm{max}\\{1, (4h-10)\\Delta(G)+1\\}$ for some tree $T$ with $\\operatorname{rad}(T)\\leq h-1$."},"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":"2608.12723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T02:09:50Z","cross_cats_sorted":[],"title_canon_sha256":"b1e1ad7c792ac3553a4e7d1ef163742fee917dcabbf7361e63d2eecbe2b30da2","abstract_canon_sha256":"b601c189b67242372a0460a680f9a6bc3e0089f7b3ffdcc100c2ba08ce6e287f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-14T00:47:08.934516Z","signature_b64":"PkgvfJG7RZGluPJhHOvOeMO6qs2EQ9Imm9YuIS2K2Zqy8VI7AJL0gOPQL01nQ/VwtMnGbTY0ux37zbkZx7UNDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","last_reissued_at":"2026-08-14T00:47:08.932158Z","signature_status":"signed_v1","first_computed_at":"2026-08-14T00:47:08.932158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-partitions of graphs with bounded tree-depth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huayue Liu, Rong chen","submitted_at":"2026-08-13T02:09:50Z","abstract_excerpt":"Wood~ recently showed that every graph $G$ of pathwidth $h$ and $\\Delta(G)\\ge1$ admits a $T$-partition of width at most $4(h+1)^2\\Delta(G)$ for some tree $T$ with $pw(T)\\leq2h+1$. In this paper, we establish an analogous result for tree-depth, which is a stronger parameter than pathwidth. We prove that every connected graph with tree-depth $h$ admits a $T$-partition of width at most $\\mathrm{max}\\{1, (4h-10)\\Delta(G)+1\\}$ for some tree $T$ with $\\operatorname{rad}(T)\\leq h-1$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12723","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.12723/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.12723","created_at":"2026-08-14T00:47:08.933390+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12723v1","created_at":"2026-08-14T00:47:08.933390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12723","created_at":"2026-08-14T00:47:08.933390+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMWHOQWVDIMW","created_at":"2026-08-14T00:47:08.933390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMWHOQWVDIMW4JJO","created_at":"2026-08-14T00:47:08.933390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMWHOQWV","created_at":"2026-08-14T00:47:08.933390+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/LMWHOQWVDIMW4JJOI2ZVQ7V4WG","json":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG.json","graph_json":"https://pith.science/api/pith-number/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/graph.json","events_json":"https://pith.science/api/pith-number/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/events.json","paper":"https://pith.science/paper/LMWHOQWV"},"agent_actions":{"view_html":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG","download_json":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG.json","view_paper":"https://pith.science/paper/LMWHOQWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12723&json=true","fetch_graph":"https://pith.science/api/pith-number/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/graph.json","fetch_events":"https://pith.science/api/pith-number/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/action/storage_attestation","attest_author":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/action/author_attestation","sign_citation":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/action/citation_signature","submit_replication":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/action/replication_record"}},"created_at":"2026-08-14T00:47:08.933390+00:00","updated_at":"2026-08-14T00:47:08.933390+00:00"}