{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ROALM3RNTEVI5EKDQ656IICUSV","short_pith_number":"pith:ROALM3RN","canonical_record":{"source":{"id":"1807.03768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-10T17:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"73b0c93377bd034928db8655c4eec02a321c806af30df04b98d07941e3d85042","abstract_canon_sha256":"f91c06750aeeadf5bebc1e922b24b8b602e5819c5fc56d699ea9b2484e563196"},"schema_version":"1.0"},"canonical_sha256":"8b80b66e2d992a8e914387bbe420549564f498994e0881a723589e5096117949","source":{"kind":"arxiv","id":"1807.03768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03768","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03768v1","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03768","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"ROALM3RNTEVI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROALM3RNTEVI5EKD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROALM3RN","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ROALM3RNTEVI5EKDQ656IICUSV","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-10T17:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"73b0c93377bd034928db8655c4eec02a321c806af30df04b98d07941e3d85042","abstract_canon_sha256":"f91c06750aeeadf5bebc1e922b24b8b602e5819c5fc56d699ea9b2484e563196"},"schema_version":"1.0"},"canonical_sha256":"8b80b66e2d992a8e914387bbe420549564f498994e0881a723589e5096117949","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:00.991794Z","signature_b64":"KGe/aJNFmOBiihmsCcTITSfhc9ZF1NosfW86BZEnrF3ucl+BFNG5vWtCFiFY6IMMPeSWWo4NoAcsj5Gi8hNgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b80b66e2d992a8e914387bbe420549564f498994e0881a723589e5096117949","last_reissued_at":"2026-05-18T00:11:00.991079Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:00.991079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03768","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-05-18T00:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlOSIls6JHHLthDicilDNl0EH1uMuTP5skzlf4D5u+KxLUXGavk/Zx5nqOo/Yqv0Kb5GRjjO84i2g1J+L0lIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:19:25.760777Z"},"content_sha256":"f8fc3005a66c6647dd1cfeb85c87895aa2cae8100b518b91be343aa140db4d0d","schema_version":"1.0","event_id":"sha256:f8fc3005a66c6647dd1cfeb85c87895aa2cae8100b518b91be343aa140db4d0d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ROALM3RNTEVI5EKDQ656IICUSV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induced subgraphs of graphs with large chromatic number. XIII. New brooms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Paul Seymour","submitted_at":"2018-07-10T17:44:46Z","abstract_excerpt":"Gy\\'arf\\'as and Sumner independently conjectured that for every tree $T$, the class of graphs not containing $T$ as an induced subgraph is $\\chi$-bounded, that is, the chromatic numbers of graphs in this class are bounded above by a function of their clique numbers. This remains open for general trees $T$, but has been proved for some particular trees. For $k\\ge 1$, let us say a broom of length $k$ is a tree obtained from a $k$-edge path with ends $a,b$ by adding some number of leaves adjacent to $b$, and we call $a$ its handle. A tree obtained from brooms of lengths $k_1,...,k_n$ by identifyi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03768","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":""},"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:11:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Zgo7TUQprjwprgEam6riC6F0vs3p9Iv2YjsD94ql5yMB925zsc83tJqYV81QUcCrLqRBD//L5FmZmZRoJ47Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:19:25.761133Z"},"content_sha256":"03af0d624ab85ec255816f21350877a480355e6c5ec15a9191f103d7da114668","schema_version":"1.0","event_id":"sha256:03af0d624ab85ec255816f21350877a480355e6c5ec15a9191f103d7da114668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROALM3RNTEVI5EKDQ656IICUSV/bundle.json","state_url":"https://pith.science/pith/ROALM3RNTEVI5EKDQ656IICUSV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROALM3RNTEVI5EKDQ656IICUSV/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-28T06:19:25Z","links":{"resolver":"https://pith.science/pith/ROALM3RNTEVI5EKDQ656IICUSV","bundle":"https://pith.science/pith/ROALM3RNTEVI5EKDQ656IICUSV/bundle.json","state":"https://pith.science/pith/ROALM3RNTEVI5EKDQ656IICUSV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROALM3RNTEVI5EKDQ656IICUSV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ROALM3RNTEVI5EKDQ656IICUSV","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":"f91c06750aeeadf5bebc1e922b24b8b602e5819c5fc56d699ea9b2484e563196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-10T17:44:46Z","title_canon_sha256":"73b0c93377bd034928db8655c4eec02a321c806af30df04b98d07941e3d85042"},"schema_version":"1.0","source":{"id":"1807.03768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03768","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03768v1","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03768","created_at":"2026-05-18T00:11:00Z"},{"alias_kind":"pith_short_12","alias_value":"ROALM3RNTEVI","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"ROALM3RNTEVI5EKD","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"ROALM3RN","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:03af0d624ab85ec255816f21350877a480355e6c5ec15a9191f103d7da114668","target":"graph","created_at":"2026-05-18T00:11:00Z","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":"Gy\\'arf\\'as and Sumner independently conjectured that for every tree $T$, the class of graphs not containing $T$ as an induced subgraph is $\\chi$-bounded, that is, the chromatic numbers of graphs in this class are bounded above by a function of their clique numbers. This remains open for general trees $T$, but has been proved for some particular trees. For $k\\ge 1$, let us say a broom of length $k$ is a tree obtained from a $k$-edge path with ends $a,b$ by adding some number of leaves adjacent to $b$, and we call $a$ its handle. A tree obtained from brooms of lengths $k_1,...,k_n$ by identifyi","authors_text":"Alex Scott, Paul Seymour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-10T17:44:46Z","title":"Induced subgraphs of graphs with large chromatic number. XIII. New brooms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03768","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:f8fc3005a66c6647dd1cfeb85c87895aa2cae8100b518b91be343aa140db4d0d","target":"record","created_at":"2026-05-18T00:11:00Z","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":"f91c06750aeeadf5bebc1e922b24b8b602e5819c5fc56d699ea9b2484e563196","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-10T17:44:46Z","title_canon_sha256":"73b0c93377bd034928db8655c4eec02a321c806af30df04b98d07941e3d85042"},"schema_version":"1.0","source":{"id":"1807.03768","kind":"arxiv","version":1}},"canonical_sha256":"8b80b66e2d992a8e914387bbe420549564f498994e0881a723589e5096117949","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b80b66e2d992a8e914387bbe420549564f498994e0881a723589e5096117949","first_computed_at":"2026-05-18T00:11:00.991079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:00.991079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KGe/aJNFmOBiihmsCcTITSfhc9ZF1NosfW86BZEnrF3ucl+BFNG5vWtCFiFY6IMMPeSWWo4NoAcsj5Gi8hNgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:00.991794Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8fc3005a66c6647dd1cfeb85c87895aa2cae8100b518b91be343aa140db4d0d","sha256:03af0d624ab85ec255816f21350877a480355e6c5ec15a9191f103d7da114668"],"state_sha256":"ce66a3de0a6a5f874a14d1f1e3a03bbc30a23aba1d25fad9bdc2258f5fd55678"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+b5818scHe2mNNeBwWNe2Zuj3Aqj8XvjtOi8sFZSCVyRGoUaNeP8B6scKfy70qRTIzcPgb4fr1THCaVcP1MBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:19:25.763150Z","bundle_sha256":"61e71cf7c9322869c0e6b7136f3cbee41adb9e574c8516ca2344fb8618c9955b"}}