{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:F7PTP27AUTRP2IJUK2MWUSZPZS","short_pith_number":"pith:F7PTP27A","canonical_record":{"source":{"id":"2203.03612","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-07T18:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"73fc01ee44eba7d49e0892a6edd22700a4594e221ea261778630717715ce878d","abstract_canon_sha256":"178ade91edec433bdf1a2db724d691879ceb28d89f020b15ff245f58d0298d36"},"schema_version":"1.0"},"canonical_sha256":"2fdf37ebe0a4e2fd213456996a4b2fcc8481ea4eff97514cc2394a105a655d93","source":{"kind":"arxiv","id":"2203.03612","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.03612","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"2203.03612v4","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03612","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"F7PTP27AUTRP","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"F7PTP27AUTRP2IJU","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"F7PTP27A","created_at":"2026-07-05T06:51:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:F7PTP27AUTRP2IJUK2MWUSZPZS","target":"record","payload":{"canonical_record":{"source":{"id":"2203.03612","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-07T18:59:32Z","cross_cats_sorted":[],"title_canon_sha256":"73fc01ee44eba7d49e0892a6edd22700a4594e221ea261778630717715ce878d","abstract_canon_sha256":"178ade91edec433bdf1a2db724d691879ceb28d89f020b15ff245f58d0298d36"},"schema_version":"1.0"},"canonical_sha256":"2fdf37ebe0a4e2fd213456996a4b2fcc8481ea4eff97514cc2394a105a655d93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:51:17.514524Z","signature_b64":"JhrmPm+FQtOnxz/b4FgyQHGGnin+vP/TyEMVXFTJPVBmbT/UJLZXy1eFKXUIDvPbalxK/ZFmQmh6JKrt2AelBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fdf37ebe0a4e2fd213456996a4b2fcc8481ea4eff97514cc2394a105a655d93","last_reissued_at":"2026-07-05T06:51:17.514029Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:51:17.514029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.03612","source_version":4,"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-05T06:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfSsC4WqTqWOCxrJQcuTfb0kwNI01XMIR1bohxMblFlB1DQYcL/UEwtqBiwIHxieqIbnKqobmyRyKuAGbTaQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:12:26.836414Z"},"content_sha256":"e5f1926aba04ce0bfd8bed3a872044407626e6dcb1d6b07ab6243fa73ee31ec8","schema_version":"1.0","event_id":"sha256:e5f1926aba04ce0bfd8bed3a872044407626e6dcb1d6b07ab6243fa73ee31ec8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:F7PTP27AUTRP2IJUK2MWUSZPZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induced subgraphs of induced subgraphs of large chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alex Scott, Ant\\'onio Gir\\~ao, Emil Powierski, Freddie Illingworth, Jane Tan, Michael Savery, Youri Tamitegama","submitted_at":"2022-03-07T18:59:32Z","abstract_excerpt":"We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there are graphs of arbitrarily large chromatic number and the same clique number as $F$ in which every $F$-free induced subgraph has chromatic number at most $c_F$. This generalises recent theorems of Bria\\'{n}ski, Davies and Walczak, and Carbonero, Hompe, Moore and Spirkl. Our results imply that for every $r\\geq 3$ the class of $K_r$-free graphs has a very strong vertex Ramsey-type property, giving a vast generalisation of a result of Folkman from 1970. We also prove related results for tournaments"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03612","kind":"arxiv","version":4},"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/2203.03612/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-05T06:51:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zI0HGGqEt4s+vX4ywaBTMfviEj/tsphL00HIi04f6JL1Q7PUB93iCyFoTmBSMDbCBKh0UBLfR0sLsAi8Z9qqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T00:12:26.836790Z"},"content_sha256":"aee5141915d0d3b0fab0bd105f41ea6747a1328119b83b149f8fde3a2e9a5811","schema_version":"1.0","event_id":"sha256:aee5141915d0d3b0fab0bd105f41ea6747a1328119b83b149f8fde3a2e9a5811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/bundle.json","state_url":"https://pith.science/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/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-07-09T00:12:26Z","links":{"resolver":"https://pith.science/pith/F7PTP27AUTRP2IJUK2MWUSZPZS","bundle":"https://pith.science/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/bundle.json","state":"https://pith.science/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7PTP27AUTRP2IJUK2MWUSZPZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:F7PTP27AUTRP2IJUK2MWUSZPZS","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":"178ade91edec433bdf1a2db724d691879ceb28d89f020b15ff245f58d0298d36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-07T18:59:32Z","title_canon_sha256":"73fc01ee44eba7d49e0892a6edd22700a4594e221ea261778630717715ce878d"},"schema_version":"1.0","source":{"id":"2203.03612","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.03612","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"arxiv_version","alias_value":"2203.03612v4","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.03612","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_12","alias_value":"F7PTP27AUTRP","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_16","alias_value":"F7PTP27AUTRP2IJU","created_at":"2026-07-05T06:51:17Z"},{"alias_kind":"pith_short_8","alias_value":"F7PTP27A","created_at":"2026-07-05T06:51:17Z"}],"graph_snapshots":[{"event_id":"sha256:aee5141915d0d3b0fab0bd105f41ea6747a1328119b83b149f8fde3a2e9a5811","target":"graph","created_at":"2026-07-05T06:51:17Z","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/2203.03612/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there are graphs of arbitrarily large chromatic number and the same clique number as $F$ in which every $F$-free induced subgraph has chromatic number at most $c_F$. This generalises recent theorems of Bria\\'{n}ski, Davies and Walczak, and Carbonero, Hompe, Moore and Spirkl. Our results imply that for every $r\\geq 3$ the class of $K_r$-free graphs has a very strong vertex Ramsey-type property, giving a vast generalisation of a result of Folkman from 1970. We also prove related results for tournaments","authors_text":"Alex Scott, Ant\\'onio Gir\\~ao, Emil Powierski, Freddie Illingworth, Jane Tan, Michael Savery, Youri Tamitegama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-07T18:59:32Z","title":"Induced subgraphs of induced subgraphs of large chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.03612","kind":"arxiv","version":4},"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:e5f1926aba04ce0bfd8bed3a872044407626e6dcb1d6b07ab6243fa73ee31ec8","target":"record","created_at":"2026-07-05T06:51:17Z","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":"178ade91edec433bdf1a2db724d691879ceb28d89f020b15ff245f58d0298d36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-03-07T18:59:32Z","title_canon_sha256":"73fc01ee44eba7d49e0892a6edd22700a4594e221ea261778630717715ce878d"},"schema_version":"1.0","source":{"id":"2203.03612","kind":"arxiv","version":4}},"canonical_sha256":"2fdf37ebe0a4e2fd213456996a4b2fcc8481ea4eff97514cc2394a105a655d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fdf37ebe0a4e2fd213456996a4b2fcc8481ea4eff97514cc2394a105a655d93","first_computed_at":"2026-07-05T06:51:17.514029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:51:17.514029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JhrmPm+FQtOnxz/b4FgyQHGGnin+vP/TyEMVXFTJPVBmbT/UJLZXy1eFKXUIDvPbalxK/ZFmQmh6JKrt2AelBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:51:17.514524Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.03612","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5f1926aba04ce0bfd8bed3a872044407626e6dcb1d6b07ab6243fa73ee31ec8","sha256:aee5141915d0d3b0fab0bd105f41ea6747a1328119b83b149f8fde3a2e9a5811"],"state_sha256":"d4411009a322059fa5dba97abb7f2614bf228d23640366f9bd54e63de4912cc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZnD60ate/BDIznCI413w/eacNKp29QupxqW6co81mBD7VyT3xS9piPe+bZ+phpBZriO0Rnlct13W66jX5X4AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T00:12:26.838828Z","bundle_sha256":"52fc88449492ed7ba8d73eb890328b864bdc5dc354bc09cddd4b03f3cb086393"}}