{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IZHRP25TWKTDLBUY7X3C3TOSBX","short_pith_number":"pith:IZHRP25T","canonical_record":{"source":{"id":"2501.11617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-20T17:29:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8a0a14c013705d96c5d1ae60f96dd2e9a2ef4295d62bc1a7a9d9ed8fad20f5a8","abstract_canon_sha256":"d4250f1e2830a842f1ff7da00cdea9e2273be53155b560e0006a022c838c7686"},"schema_version":"1.0"},"canonical_sha256":"464f17ebb3b2a6358698fdf62dcdd20dd5832041103a802370bd7ee1c87855d2","source":{"kind":"arxiv","id":"2501.11617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11617","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11617v1","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11617","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"IZHRP25TWKTD","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"IZHRP25TWKTDLBUY","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"IZHRP25T","created_at":"2026-07-05T10:03:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IZHRP25TWKTDLBUY7X3C3TOSBX","target":"record","payload":{"canonical_record":{"source":{"id":"2501.11617","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-20T17:29:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8a0a14c013705d96c5d1ae60f96dd2e9a2ef4295d62bc1a7a9d9ed8fad20f5a8","abstract_canon_sha256":"d4250f1e2830a842f1ff7da00cdea9e2273be53155b560e0006a022c838c7686"},"schema_version":"1.0"},"canonical_sha256":"464f17ebb3b2a6358698fdf62dcdd20dd5832041103a802370bd7ee1c87855d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:11.587498Z","signature_b64":"9TWD+6BjDcU7W1CZApyhUNcmzWP7pLxrQnPuGtPmuLWBy3l913alzVX/biOccQzOS5W8EDB44fhKZQAt5sI0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"464f17ebb3b2a6358698fdf62dcdd20dd5832041103a802370bd7ee1c87855d2","last_reissued_at":"2026-07-05T10:03:11.586958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:11.586958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.11617","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-07-05T10:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"55QQmJZI/d3lhRB3GauCWllLg4ybBuIb+XxXnfvH5Hj9OT+FYcu3Yujut4LKPtlf2HAd2snbCnkdN3E3v9dDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:27:44.711462Z"},"content_sha256":"b62cf60cd6f14a25b748522d84141cc6d09b179d0c678293c19f15094284ba1f","schema_version":"1.0","event_id":"sha256:b62cf60cd6f14a25b748522d84141cc6d09b179d0c678293c19f15094284ba1f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IZHRP25TWKTDLBUY7X3C3TOSBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Excluding a rectangular grid","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cl\\'ement Rambaud","submitted_at":"2025-01-20T17:29:53Z","abstract_excerpt":"For every positive integer $k$, we define the $k$-treedepth as the largest graph parameter $\\mathrm{td}_k$ satisfying (i) $\\mathrm{td}_k(\\emptyset)=0$; (ii) $\\mathrm{td}_k(G) \\leq 1+ \\mathrm{td}_k(G-u)$ for every graph $G$ and every vertex $u \\in V(G)$; and (iii) if $G$ is a $(<k)$-clique-sum of $G_1$ and $G_2$, then $\\mathrm{td}_k(G) \\leq \\max \\{\\mathrm{td}_k(G_1),\\mathrm{td}_k(G_2)\\}$, for all graphs $G_1,G_2$. This parameter coincides with treedepth if $k=1$, and with treewidth plus $1$ if $k \\geq |V(G)|$. We prove that for every positive integer $k$, a class of graphs $\\mathcal{C}$ has bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11617","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/2501.11617/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-07-05T10:03:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4v2PNr4RB661z1s+itnU0gPMAptiE241CpxEqrtKyFiJC7qtRzOfkBGplL0ldiy+bheREVGde7JFewwYKPTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:27:44.712418Z"},"content_sha256":"1a16c3f94e568868311d7b1fdd4de4ae4ea696efdd4f601e43975c7bcbfc9b67","schema_version":"1.0","event_id":"sha256:1a16c3f94e568868311d7b1fdd4de4ae4ea696efdd4f601e43975c7bcbfc9b67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/bundle.json","state_url":"https://pith.science/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/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-11T13:27:44Z","links":{"resolver":"https://pith.science/pith/IZHRP25TWKTDLBUY7X3C3TOSBX","bundle":"https://pith.science/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/bundle.json","state":"https://pith.science/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZHRP25TWKTDLBUY7X3C3TOSBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IZHRP25TWKTDLBUY7X3C3TOSBX","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":"d4250f1e2830a842f1ff7da00cdea9e2273be53155b560e0006a022c838c7686","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-20T17:29:53Z","title_canon_sha256":"8a0a14c013705d96c5d1ae60f96dd2e9a2ef4295d62bc1a7a9d9ed8fad20f5a8"},"schema_version":"1.0","source":{"id":"2501.11617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11617","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11617v1","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11617","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"IZHRP25TWKTD","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_16","alias_value":"IZHRP25TWKTDLBUY","created_at":"2026-07-05T10:03:11Z"},{"alias_kind":"pith_short_8","alias_value":"IZHRP25T","created_at":"2026-07-05T10:03:11Z"}],"graph_snapshots":[{"event_id":"sha256:1a16c3f94e568868311d7b1fdd4de4ae4ea696efdd4f601e43975c7bcbfc9b67","target":"graph","created_at":"2026-07-05T10:03:11Z","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/2501.11617/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For every positive integer $k$, we define the $k$-treedepth as the largest graph parameter $\\mathrm{td}_k$ satisfying (i) $\\mathrm{td}_k(\\emptyset)=0$; (ii) $\\mathrm{td}_k(G) \\leq 1+ \\mathrm{td}_k(G-u)$ for every graph $G$ and every vertex $u \\in V(G)$; and (iii) if $G$ is a $(<k)$-clique-sum of $G_1$ and $G_2$, then $\\mathrm{td}_k(G) \\leq \\max \\{\\mathrm{td}_k(G_1),\\mathrm{td}_k(G_2)\\}$, for all graphs $G_1,G_2$. This parameter coincides with treedepth if $k=1$, and with treewidth plus $1$ if $k \\geq |V(G)|$. We prove that for every positive integer $k$, a class of graphs $\\mathcal{C}$ has bou","authors_text":"Cl\\'ement Rambaud","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-20T17:29:53Z","title":"Excluding a rectangular grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11617","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:b62cf60cd6f14a25b748522d84141cc6d09b179d0c678293c19f15094284ba1f","target":"record","created_at":"2026-07-05T10:03:11Z","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":"d4250f1e2830a842f1ff7da00cdea9e2273be53155b560e0006a022c838c7686","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-20T17:29:53Z","title_canon_sha256":"8a0a14c013705d96c5d1ae60f96dd2e9a2ef4295d62bc1a7a9d9ed8fad20f5a8"},"schema_version":"1.0","source":{"id":"2501.11617","kind":"arxiv","version":1}},"canonical_sha256":"464f17ebb3b2a6358698fdf62dcdd20dd5832041103a802370bd7ee1c87855d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"464f17ebb3b2a6358698fdf62dcdd20dd5832041103a802370bd7ee1c87855d2","first_computed_at":"2026-07-05T10:03:11.586958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:03:11.586958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9TWD+6BjDcU7W1CZApyhUNcmzWP7pLxrQnPuGtPmuLWBy3l913alzVX/biOccQzOS5W8EDB44fhKZQAt5sI0CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:03:11.587498Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b62cf60cd6f14a25b748522d84141cc6d09b179d0c678293c19f15094284ba1f","sha256:1a16c3f94e568868311d7b1fdd4de4ae4ea696efdd4f601e43975c7bcbfc9b67"],"state_sha256":"af799e2c8dd4c2b3fab8eb0c5fdcfd12c433ff8bfcdc8ff435c22902c53d6d82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IrEIL0r1+ndMkpCGaFxZ0NzU9SyYHr2GPMDkuciQWw+JHPrRf+AwQHVzunbOtZr7A1F5r5hMvaKqsWz1rn7NAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:27:44.720840Z","bundle_sha256":"738283e84664c999b8ce84ad3740eebbec0066af67169488e6855f82393edb9b"}}