{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7G6HG7KSSLZZSFNTLHZ3ABQWFG","short_pith_number":"pith:7G6HG7KS","canonical_record":{"source":{"id":"1908.07264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T10:30:26Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"3cd8f6c3d2ba371c367880c1a2f007a29a5ec0b843d3e2f153c2383f1395cbe3","abstract_canon_sha256":"2bdd985a18ae75361b1938d3fc8699eb0378ca48b3f0b09bfe08d69057d250e2"},"schema_version":"1.0"},"canonical_sha256":"f9bc737d5292f39915b359f3b0061629b2db0a34594c175bc6f40ac73be41d6c","source":{"kind":"arxiv","id":"1908.07264","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7G6HG7KSSLZZSFNTLHZ3ABQWFG","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-20T10:30:26Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"3cd8f6c3d2ba371c367880c1a2f007a29a5ec0b843d3e2f153c2383f1395cbe3","abstract_canon_sha256":"2bdd985a18ae75361b1938d3fc8699eb0378ca48b3f0b09bfe08d69057d250e2"},"schema_version":"1.0"},"canonical_sha256":"f9bc737d5292f39915b359f3b0061629b2db0a34594c175bc6f40ac73be41d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:32.384416Z","signature_b64":"mLtfqYaSUrangrMi2wTqvURO76y2Azqw/2cG1ZrKrlEdJJqier6pXa08Zln0VFxIBEKo9zXb2IxnK92MDlG+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9bc737d5292f39915b359f3b0061629b2db0a34594c175bc6f40ac73be41d6c","last_reissued_at":"2026-07-04T23:58:32.384074Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:32.384074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07264","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-04T23:58:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShCgo/iiQnfWfBY7qQsIZegKUWyNXRQqR+qnukmqQALGyJLlot8oMv2M17BppUwL1W726JIo4TdgPYn4LSlpBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:38:59.327317Z"},"content_sha256":"600d4a7dcb5e518b83d226ac0e887831c9f46a344088a2039ffcfe1d5f588149","schema_version":"1.0","event_id":"sha256:600d4a7dcb5e518b83d226ac0e887831c9f46a344088a2039ffcfe1d5f588149"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7G6HG7KSSLZZSFNTLHZ3ABQWFG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the growth rate of dichromatic numbers of finite subdigraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"math.CO","authors_text":"Attila Jo\\'o","submitted_at":"2019-08-20T10:30:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07264","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/1908.07264/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-04T23:58:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbRR6wQ0aqVLzlPSz0MFCowryI1rcjxHgi87F66uFDKfUky3dvEP79HIMyPdBNargmzwGDwDbofdAxj1Z4CfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:38:59.328220Z"},"content_sha256":"5fd03a5e7de84f0ab96c2c856346462c932145c64d350aee7cf59e8b9321561c","schema_version":"1.0","event_id":"sha256:5fd03a5e7de84f0ab96c2c856346462c932145c64d350aee7cf59e8b9321561c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/bundle.json","state_url":"https://pith.science/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/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-16T07:38:59Z","links":{"resolver":"https://pith.science/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG","bundle":"https://pith.science/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/bundle.json","state":"https://pith.science/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7G6HG7KSSLZZSFNTLHZ3ABQWFG/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rLLyKw6crf906CTikOmolcIE9mvWNnjmn1LQYD69JmxLHhe2IUii8uekwp37p4GVtS7T8CJ8KTN4EHmgRYYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:38:59.335034Z","bundle_sha256":"c6cb70bd45014b832411e542e8b87470e8fcafadbe5ff49270b4c6204e2af442"}}