{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LMWHOQWVDIMW4JJOI2ZVQ7V4WG","short_pith_number":"pith:LMWHOQWV","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"},"canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","source":{"kind":"arxiv","id":"2608.12723","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12723","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12723v1","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12723","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"LMWHOQWVDIMW","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_16","alias_value":"LMWHOQWVDIMW4JJO","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_8","alias_value":"LMWHOQWV","created_at":"2026-08-14T00:47:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LMWHOQWVDIMW4JJOI2ZVQ7V4WG","target":"record","payload":{"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"},"canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","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"},"source_kind":"arxiv","source_id":"2608.12723","source_version":1,"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-08-14T00:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yL05t/GJggnCJSfHf01P4LmDKyHVxTzfZpiCdQNKCyl8liIzoRq8Qtb+EUsS92WjMszzS2X1NIJQFscf3ZiBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:59:33.899791Z"},"content_sha256":"a7b07c375117a648cfa7e48a77a4e38466468f8486a77e772cc7f34e329f53fb","schema_version":"1.0","event_id":"sha256:a7b07c375117a648cfa7e48a77a4e38466468f8486a77e772cc7f34e329f53fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LMWHOQWVDIMW4JJOI2ZVQ7V4WG","target":"graph","payload":{"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"},"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-08-14T00:47:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B03Mko2HVymXkRE1Jp+uDK/7ZOGaHyJazUupw2ZY1G0pTZcQshxKLBZX5JzbW64jK6bUPVh+3+5TB+2FQQAaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T20:59:33.900417Z"},"content_sha256":"776e1d493b237dfdde8d4f83bf85d95ec17e42dc70ad5cf1811b93c73b59aa50","schema_version":"1.0","event_id":"sha256:776e1d493b237dfdde8d4f83bf85d95ec17e42dc70ad5cf1811b93c73b59aa50"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/bundle.json","state_url":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/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-08-18T20:59:33Z","links":{"resolver":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG","bundle":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/bundle.json","state":"https://pith.science/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LMWHOQWVDIMW4JJOI2ZVQ7V4WG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LMWHOQWVDIMW4JJOI2ZVQ7V4WG","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":"b601c189b67242372a0460a680f9a6bc3e0089f7b3ffdcc100c2ba08ce6e287f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T02:09:50Z","title_canon_sha256":"b1e1ad7c792ac3553a4e7d1ef163742fee917dcabbf7361e63d2eecbe2b30da2"},"schema_version":"1.0","source":{"id":"2608.12723","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.12723","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"arxiv_version","alias_value":"2608.12723v1","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12723","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_12","alias_value":"LMWHOQWVDIMW","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_16","alias_value":"LMWHOQWVDIMW4JJO","created_at":"2026-08-14T00:47:08Z"},{"alias_kind":"pith_short_8","alias_value":"LMWHOQWV","created_at":"2026-08-14T00:47:08Z"}],"graph_snapshots":[{"event_id":"sha256:776e1d493b237dfdde8d4f83bf85d95ec17e42dc70ad5cf1811b93c73b59aa50","target":"graph","created_at":"2026-08-14T00:47:08Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.12723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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$.","authors_text":"Huayue Liu, Rong chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T02:09:50Z","title":"Tree-partitions of graphs with bounded tree-depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12723","kind":"arxiv","version":1},"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:a7b07c375117a648cfa7e48a77a4e38466468f8486a77e772cc7f34e329f53fb","target":"record","created_at":"2026-08-14T00:47:08Z","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":"b601c189b67242372a0460a680f9a6bc3e0089f7b3ffdcc100c2ba08ce6e287f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-13T02:09:50Z","title_canon_sha256":"b1e1ad7c792ac3553a4e7d1ef163742fee917dcabbf7361e63d2eecbe2b30da2"},"schema_version":"1.0","source":{"id":"2608.12723","kind":"arxiv","version":1}},"canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5b2c7742d51a196e252e46b3587ebcb196808a0204ddf9fef085082fb4c8addc","first_computed_at":"2026-08-14T00:47:08.932158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-14T00:47:08.932158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkgvfJG7RZGluPJhHOvOeMO6qs2EQ9Imm9YuIS2K2Zqy8VI7AJL0gOPQL01nQ/VwtMnGbTY0ux37zbkZx7UNDw==","signature_status":"signed_v1","signed_at":"2026-08-14T00:47:08.934516Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.12723","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7b07c375117a648cfa7e48a77a4e38466468f8486a77e772cc7f34e329f53fb","sha256:776e1d493b237dfdde8d4f83bf85d95ec17e42dc70ad5cf1811b93c73b59aa50"],"state_sha256":"d3fc89850d64b29e9a9c11b7d59567820bed4bd80926c20ee8efe745ab1faec5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdW1wWDhpvH2OhFes5FIqqrgfyTNNRjY1BOZ7ipeG+m6WEZ5t9ZD0VWroxKFlsCrAGCI9ed1ggd/TtAoxlRtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T20:59:33.904069Z","bundle_sha256":"f152f68649df061da8fb0fe33f5e4a76dfe206f3c282bbb3ba2c25f6a9ad7132"}}