{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:5C4G6ULYRLC2XNG5P4LVMHJWXU","short_pith_number":"pith:5C4G6ULY","canonical_record":{"source":{"id":"2105.02383","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-06T00:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"a7db3c8a9f73a001acb8f4395173af30eab040f960a6560159596b4540d17319","abstract_canon_sha256":"919eee47ad87373fc84b2b679986bf4c4bc7acc4dc7ad32f16928b13b576caea"},"schema_version":"1.0"},"canonical_sha256":"e8b86f51788ac5abb4dd7f17561d36bd1e7a595652495671d3fec26d169edf9e","source":{"kind":"arxiv","id":"2105.02383","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.02383","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"2105.02383v2","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02383","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"5C4G6ULYRLC2","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_16","alias_value":"5C4G6ULYRLC2XNG5","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_8","alias_value":"5C4G6ULY","created_at":"2026-07-05T03:50:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:5C4G6ULYRLC2XNG5P4LVMHJWXU","target":"record","payload":{"canonical_record":{"source":{"id":"2105.02383","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-06T00:50:34Z","cross_cats_sorted":[],"title_canon_sha256":"a7db3c8a9f73a001acb8f4395173af30eab040f960a6560159596b4540d17319","abstract_canon_sha256":"919eee47ad87373fc84b2b679986bf4c4bc7acc4dc7ad32f16928b13b576caea"},"schema_version":"1.0"},"canonical_sha256":"e8b86f51788ac5abb4dd7f17561d36bd1e7a595652495671d3fec26d169edf9e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:34.897088Z","signature_b64":"pf/P6vTFQouYk3o8NOTduysLYFtScbD2cmZCAgX1V4/E9swg/AwOH7QkwBYcBx3jZxj7/aFvulC+0oOn6mwHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8b86f51788ac5abb4dd7f17561d36bd1e7a595652495671d3fec26d169edf9e","last_reissued_at":"2026-07-05T03:50:34.896636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:34.896636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2105.02383","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-05T03:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qENMuTnZG33+gyGcdl6C0RNcD4L7wAwanoUx9gl306kpTq6hZ++9WYgL61a1tjQnbNLOkKKFW1no6U+yAQ13AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:07:32.913036Z"},"content_sha256":"bb97afd63bcbce82256fe9d788e485ef7e45ef9b68659105dab3cbfac987b92b","schema_version":"1.0","event_id":"sha256:bb97afd63bcbce82256fe9d788e485ef7e45ef9b68659105dab3cbfac987b92b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:5C4G6ULYRLC2XNG5P4LVMHJWXU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ramsey numbers of sparse digraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Xiaoyu He, Yuval Wigderson","submitted_at":"2021-05-06T00:50:34Z","abstract_excerpt":"Burr and Erd\\H{o}s in 1975 conjectured, and Chv\\'atal, R\\\"odl, Szemer\\'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed analogue of the Burr--Erd\\H{o}s conjecture, answering a question of Buci\\'c, Letzter, and Sudakov. If $H$ is an acyclic digraph, the oriented Ramsey number of $H$, denoted $\\overrightarrow{r_{1}}(H)$, is the least $N$ such that every tournament on $N$ vertices contains a copy of $H$. We show that for any $\\Delta \\geq 2$ and any sufficiently large $n$, there exi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02383","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/2105.02383/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-05T03:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S+JMssLHRWfgCeNNxH0PNWYQGAJK5LF6tx5SkDNzBz2cRLZTof9wS2SviRgEZAJ0SzLlqd1XDZJa8nH43XfEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T09:07:32.913428Z"},"content_sha256":"44366e4ca360d06edabbba5f6bb22c97d4c557c3afbc1e9aca4b8ae2f0bade83","schema_version":"1.0","event_id":"sha256:44366e4ca360d06edabbba5f6bb22c97d4c557c3afbc1e9aca4b8ae2f0bade83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/bundle.json","state_url":"https://pith.science/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/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-07T09:07:32Z","links":{"resolver":"https://pith.science/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU","bundle":"https://pith.science/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/bundle.json","state":"https://pith.science/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5C4G6ULYRLC2XNG5P4LVMHJWXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:5C4G6ULYRLC2XNG5P4LVMHJWXU","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":"919eee47ad87373fc84b2b679986bf4c4bc7acc4dc7ad32f16928b13b576caea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-06T00:50:34Z","title_canon_sha256":"a7db3c8a9f73a001acb8f4395173af30eab040f960a6560159596b4540d17319"},"schema_version":"1.0","source":{"id":"2105.02383","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2105.02383","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"2105.02383v2","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.02383","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"5C4G6ULYRLC2","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_16","alias_value":"5C4G6ULYRLC2XNG5","created_at":"2026-07-05T03:50:34Z"},{"alias_kind":"pith_short_8","alias_value":"5C4G6ULY","created_at":"2026-07-05T03:50:34Z"}],"graph_snapshots":[{"event_id":"sha256:44366e4ca360d06edabbba5f6bb22c97d4c557c3afbc1e9aca4b8ae2f0bade83","target":"graph","created_at":"2026-07-05T03:50:34Z","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/2105.02383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Burr and Erd\\H{o}s in 1975 conjectured, and Chv\\'atal, R\\\"odl, Szemer\\'edi and Trotter later proved, that the Ramsey number of any bounded degree graph is linear in the number of vertices. In this paper, we disprove the natural directed analogue of the Burr--Erd\\H{o}s conjecture, answering a question of Buci\\'c, Letzter, and Sudakov. If $H$ is an acyclic digraph, the oriented Ramsey number of $H$, denoted $\\overrightarrow{r_{1}}(H)$, is the least $N$ such that every tournament on $N$ vertices contains a copy of $H$. We show that for any $\\Delta \\geq 2$ and any sufficiently large $n$, there exi","authors_text":"Jacob Fox, Xiaoyu He, Yuval Wigderson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-06T00:50:34Z","title":"Ramsey numbers of sparse digraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.02383","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:bb97afd63bcbce82256fe9d788e485ef7e45ef9b68659105dab3cbfac987b92b","target":"record","created_at":"2026-07-05T03:50:34Z","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":"919eee47ad87373fc84b2b679986bf4c4bc7acc4dc7ad32f16928b13b576caea","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2021-05-06T00:50:34Z","title_canon_sha256":"a7db3c8a9f73a001acb8f4395173af30eab040f960a6560159596b4540d17319"},"schema_version":"1.0","source":{"id":"2105.02383","kind":"arxiv","version":2}},"canonical_sha256":"e8b86f51788ac5abb4dd7f17561d36bd1e7a595652495671d3fec26d169edf9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8b86f51788ac5abb4dd7f17561d36bd1e7a595652495671d3fec26d169edf9e","first_computed_at":"2026-07-05T03:50:34.896636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:34.896636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pf/P6vTFQouYk3o8NOTduysLYFtScbD2cmZCAgX1V4/E9swg/AwOH7QkwBYcBx3jZxj7/aFvulC+0oOn6mwHAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:34.897088Z","signed_message":"canonical_sha256_bytes"},"source_id":"2105.02383","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb97afd63bcbce82256fe9d788e485ef7e45ef9b68659105dab3cbfac987b92b","sha256:44366e4ca360d06edabbba5f6bb22c97d4c557c3afbc1e9aca4b8ae2f0bade83"],"state_sha256":"f57aee7795adf00bcfbd34697a2d9a5b8a1367694d321459a48ea1152fa57643"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JR5rZGjbArSLgnOMUsn67BEgzeOSaXLnXEdXt0ldJGHjWGn/qDppDiC7STTq6fVvce4ZjECQIkkOiKJ1pNKVBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T09:07:32.915442Z","bundle_sha256":"021fde6cd4a368f823b4d098b4480d0f13b037b3b8cc9c52117117d1f1afefd9"}}