{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:E4CMACPY2L3O6GTMOTSJPVWZOV","short_pith_number":"pith:E4CMACPY","canonical_record":{"source":{"id":"2403.06370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-11T01:48:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f192885199ea9ca733ae29e4e5acb97e180cc2b28aaa9e04e47428ecd04582c1","abstract_canon_sha256":"694d5791d5154fc77497a9dbbc673e1bc64be389547448710abec543c0952a58"},"schema_version":"1.0"},"canonical_sha256":"2704c009f8d2f6ef1a6c74e497d6d9755933c790545ef388e222c190b1808610","source":{"kind":"arxiv","id":"2403.06370","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06370","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06370v2","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06370","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"E4CMACPY2L3O","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_16","alias_value":"E4CMACPY2L3O6GTM","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_8","alias_value":"E4CMACPY","created_at":"2026-07-05T10:18:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:E4CMACPY2L3O6GTMOTSJPVWZOV","target":"record","payload":{"canonical_record":{"source":{"id":"2403.06370","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-11T01:48:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f192885199ea9ca733ae29e4e5acb97e180cc2b28aaa9e04e47428ecd04582c1","abstract_canon_sha256":"694d5791d5154fc77497a9dbbc673e1bc64be389547448710abec543c0952a58"},"schema_version":"1.0"},"canonical_sha256":"2704c009f8d2f6ef1a6c74e497d6d9755933c790545ef388e222c190b1808610","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:35.208924Z","signature_b64":"NGm33H/KwT87z6Tbl8aEHCtbeam8kVrbpGjgwEYRaJ6kGMom0eb/wZB+2ZGaVyQLJmeM7OljrbxCrIwPbSUsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2704c009f8d2f6ef1a6c74e497d6d9755933c790545ef388e222c190b1808610","last_reissued_at":"2026-07-05T10:18:35.208436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:35.208436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.06370","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-07-05T10:18:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dh5Bn87y0yln8SCV9FLBZYL8jU25bZX8qZZO5EU+vS8oso2P6Qf1vIrmkjYp7ecZBuXqPTVnkfpHdyvFzmGaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:34:44.051051Z"},"content_sha256":"94b0e329f037a3c604b605fab062dd96d2ef95037fcc133fcdb46df28927b501","schema_version":"1.0","event_id":"sha256:94b0e329f037a3c604b605fab062dd96d2ef95037fcc133fcdb46df28927b501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:E4CMACPY2L3O6GTMOTSJPVWZOV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight bound for the Erd\\H{o}s-P\\'osa property of tree minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Gwena\\\"el Joret, Pat Morin, Piotr Micek, Vida Dujmovi\\'c","submitted_at":"2024-03-11T01:48:39Z","abstract_excerpt":"Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices of $G$ such that $G-X$ has no $T$ minor. The bound on the size of $X$ is best possible and improves on an earlier $f(t)k$ bound proved by Fiorini, Joret, and Wood (2013) with some fast growing function $f(t)$. Moreover, our proof is short and simple."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06370","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.06370/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:18:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njM28L/b9ZDB0zRxwGmqCPmSM1zKXHII1funER+7sYlcBBjqP8f87AnWU7jEO3JvQNR9FYBIVEi3YWg760eLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T07:34:44.051560Z"},"content_sha256":"1860f57053f25f8a3b08db885945d5c7e4fbd4f29175582e23a6947edcbd6b6c","schema_version":"1.0","event_id":"sha256:1860f57053f25f8a3b08db885945d5c7e4fbd4f29175582e23a6947edcbd6b6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/bundle.json","state_url":"https://pith.science/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/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-12T07:34:44Z","links":{"resolver":"https://pith.science/pith/E4CMACPY2L3O6GTMOTSJPVWZOV","bundle":"https://pith.science/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/bundle.json","state":"https://pith.science/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4CMACPY2L3O6GTMOTSJPVWZOV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:E4CMACPY2L3O6GTMOTSJPVWZOV","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":"694d5791d5154fc77497a9dbbc673e1bc64be389547448710abec543c0952a58","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-11T01:48:39Z","title_canon_sha256":"f192885199ea9ca733ae29e4e5acb97e180cc2b28aaa9e04e47428ecd04582c1"},"schema_version":"1.0","source":{"id":"2403.06370","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.06370","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"arxiv_version","alias_value":"2403.06370v2","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06370","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_12","alias_value":"E4CMACPY2L3O","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_16","alias_value":"E4CMACPY2L3O6GTM","created_at":"2026-07-05T10:18:35Z"},{"alias_kind":"pith_short_8","alias_value":"E4CMACPY","created_at":"2026-07-05T10:18:35Z"}],"graph_snapshots":[{"event_id":"sha256:1860f57053f25f8a3b08db885945d5c7e4fbd4f29175582e23a6947edcbd6b6c","target":"graph","created_at":"2026-07-05T10:18:35Z","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/2403.06370/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $T$ be a tree on $t$ vertices. We prove that for every positive integer $k$ and every graph $G$, either $G$ contains $k$ pairwise vertex-disjoint subgraphs each having a $T$ minor, or there exists a set $X$ of at most $t(k-1)$ vertices of $G$ such that $G-X$ has no $T$ minor. The bound on the size of $X$ is best possible and improves on an earlier $f(t)k$ bound proved by Fiorini, Joret, and Wood (2013) with some fast growing function $f(t)$. Moreover, our proof is short and simple.","authors_text":"Gwena\\\"el Joret, Pat Morin, Piotr Micek, Vida Dujmovi\\'c","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-11T01:48:39Z","title":"Tight bound for the Erd\\H{o}s-P\\'osa property of tree minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06370","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:94b0e329f037a3c604b605fab062dd96d2ef95037fcc133fcdb46df28927b501","target":"record","created_at":"2026-07-05T10:18:35Z","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":"694d5791d5154fc77497a9dbbc673e1bc64be389547448710abec543c0952a58","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-11T01:48:39Z","title_canon_sha256":"f192885199ea9ca733ae29e4e5acb97e180cc2b28aaa9e04e47428ecd04582c1"},"schema_version":"1.0","source":{"id":"2403.06370","kind":"arxiv","version":2}},"canonical_sha256":"2704c009f8d2f6ef1a6c74e497d6d9755933c790545ef388e222c190b1808610","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2704c009f8d2f6ef1a6c74e497d6d9755933c790545ef388e222c190b1808610","first_computed_at":"2026-07-05T10:18:35.208436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:18:35.208436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NGm33H/KwT87z6Tbl8aEHCtbeam8kVrbpGjgwEYRaJ6kGMom0eb/wZB+2ZGaVyQLJmeM7OljrbxCrIwPbSUsBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:18:35.208924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.06370","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94b0e329f037a3c604b605fab062dd96d2ef95037fcc133fcdb46df28927b501","sha256:1860f57053f25f8a3b08db885945d5c7e4fbd4f29175582e23a6947edcbd6b6c"],"state_sha256":"33994aa21f8466d80c0ba55e32b47ae4f37ec373cf173318a376031072ffbdc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVVwS0SZCesuzhGBGMqUkPqxTsecSoh5h66wGDUc37JsbsZ26yzZJlQqc0QmyqNlnuhKnvdpiOXfeCUli50RDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T07:34:44.055839Z","bundle_sha256":"454072272fa94dd1c06c6cf1b6b8937dda0f108669283eee689e1b5f25de6dd2"}}