{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7G6HG7KSSLZZSFNTLHZ3ABQWFG","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":"2bdd985a18ae75361b1938d3fc8699eb0378ca48b3f0b09bfe08d69057d250e2","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T10:30:26Z","title_canon_sha256":"3cd8f6c3d2ba371c367880c1a2f007a29a5ec0b843d3e2f153c2383f1395cbe3"},"schema_version":"1.0","source":{"id":"1908.07264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07264","created_at":"2026-07-04T23:58:32Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07264v1","created_at":"2026-07-04T23:58:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07264","created_at":"2026-07-04T23:58:32Z"},{"alias_kind":"pith_short_12","alias_value":"7G6HG7KSSLZZ","created_at":"2026-07-04T23:58:32Z"},{"alias_kind":"pith_short_16","alias_value":"7G6HG7KSSLZZSFNT","created_at":"2026-07-04T23:58:32Z"},{"alias_kind":"pith_short_8","alias_value":"7G6HG7KS","created_at":"2026-07-04T23:58:32Z"}],"graph_snapshots":[{"event_id":"sha256:5fd03a5e7de84f0ab96c2c856346462c932145c64d350aee7cf59e8b9321561c","target":"graph","created_at":"2026-07-04T23:58:32Z","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/1908.07264/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Chris Lambie-Hanson proved recently that for every function $ f:\\mathbb{N}\\rightarrow \\mathbb{N} $ there is an $ \\aleph_1 $-chromatic graph $ G $ of size $ 2^{\\aleph_1} $ such that every $ (n+3) $-chromatic subgraph of $ G $ has at least $ f(n) $ vertices. Previously, this fact was just known to be consistently true due to P. Komj\\'ath and S. Shelah. We investigate the analogue of this question for directed graphs. In the first part of the paper we give a simple method to construct for an arbitrary $ f:\\mathbb{N}\\rightarrow \\mathbb{N} $ an uncountably dichromatic digraph $ D $ of size $ 2^{\\al","authors_text":"Attila Jo\\'o","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T10:30:26Z","title":"On the growth rate of dichromatic numbers of finite subdigraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07264","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:600d4a7dcb5e518b83d226ac0e887831c9f46a344088a2039ffcfe1d5f588149","target":"record","created_at":"2026-07-04T23:58:32Z","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":"2bdd985a18ae75361b1938d3fc8699eb0378ca48b3f0b09bfe08d69057d250e2","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T10:30:26Z","title_canon_sha256":"3cd8f6c3d2ba371c367880c1a2f007a29a5ec0b843d3e2f153c2383f1395cbe3"},"schema_version":"1.0","source":{"id":"1908.07264","kind":"arxiv","version":1}},"canonical_sha256":"f9bc737d5292f39915b359f3b0061629b2db0a34594c175bc6f40ac73be41d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9bc737d5292f39915b359f3b0061629b2db0a34594c175bc6f40ac73be41d6c","first_computed_at":"2026-07-04T23:58:32.384074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:32.384074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mLtfqYaSUrangrMi2wTqvURO76y2Azqw/2cG1ZrKrlEdJJqier6pXa08Zln0VFxIBEKo9zXb2IxnK92MDlG+DQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:32.384416Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:600d4a7dcb5e518b83d226ac0e887831c9f46a344088a2039ffcfe1d5f588149","sha256:5fd03a5e7de84f0ab96c2c856346462c932145c64d350aee7cf59e8b9321561c"],"state_sha256":"79be0390479e79046a34b0b3f1b49501af2804f8a037aeb9ce4c5ec509f56603"}