{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BF2YYDLK2NIKNXF6VAQQN5QSDD","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":"41cf690dc7353b4b74304dc83bd6d24fb1adf48ae8224db619db13f5bfb88c8e","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-12T15:13:34Z","title_canon_sha256":"e0892df73081dcbf81190dbe0bef2fac631284ed8fe9c13e6090c3dce2fb42f0"},"schema_version":"1.0","source":{"id":"2311.06872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.06872","created_at":"2026-07-05T07:12:04Z"},{"alias_kind":"arxiv_version","alias_value":"2311.06872v1","created_at":"2026-07-05T07:12:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06872","created_at":"2026-07-05T07:12:04Z"},{"alias_kind":"pith_short_12","alias_value":"BF2YYDLK2NIK","created_at":"2026-07-05T07:12:04Z"},{"alias_kind":"pith_short_16","alias_value":"BF2YYDLK2NIKNXF6","created_at":"2026-07-05T07:12:04Z"},{"alias_kind":"pith_short_8","alias_value":"BF2YYDLK","created_at":"2026-07-05T07:12:04Z"}],"graph_snapshots":[{"event_id":"sha256:45fea78424f547f36ef9b87b7f950ca74bedf02144904c47462ed5adf635bcc5","target":"graph","created_at":"2026-07-05T07:12:04Z","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/2311.06872/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a general Ramsey theorem for trees with a successor operation. This theorem is a common generalization of the Carlson-Simpson Theorem and the Milliken Tree Theorem for regularly branching trees.\n  Our theorem has a number of applications both in finite and infinite combinatorics. For example, we give a short proof of the unrestricted Ne\\v{s}et\\v{r}il-R\\\"odl theorem, and we recover the Graham-Rothschild theorem. Our original motivation came from the study of big Ramsey degrees - various trees used in the study can be viewed as trees with a successor operation. To illustrate this, we gi","authors_text":"Andy Zucker, David Chodounsk\\'y, Jan Hubi\\v{c}ka, Jaroslav Ne\\v{s}et\\v{r}il, Martin Balko, Mat\\v{e}j Kone\\v{c}n\\'y, Natasha Dobrinen","cross_cats":["cs.DM","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-12T15:13:34Z","title":"Ramsey theorem for trees with successor operation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06872","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:a3109b0458eedcd1ecdf2e55cb505b61704b83b21e2907361acd2f72eddb368a","target":"record","created_at":"2026-07-05T07:12:04Z","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":"41cf690dc7353b4b74304dc83bd6d24fb1adf48ae8224db619db13f5bfb88c8e","cross_cats_sorted":["cs.DM","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-11-12T15:13:34Z","title_canon_sha256":"e0892df73081dcbf81190dbe0bef2fac631284ed8fe9c13e6090c3dce2fb42f0"},"schema_version":"1.0","source":{"id":"2311.06872","kind":"arxiv","version":1}},"canonical_sha256":"09758c0d6ad350a6dcbea82106f61218c5252c8f4a7ddbd46c6ee3956f766527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09758c0d6ad350a6dcbea82106f61218c5252c8f4a7ddbd46c6ee3956f766527","first_computed_at":"2026-07-05T07:12:04.961406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:04.961406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R6QmB2L+fJ08bTlMA8X7UHslbmzRTrrpp/kRwwTPmNwKaUMfw+zdNKEt8ktaeB3/9vRPHnmlqGvOF/qJBFjMAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:04.961938Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.06872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3109b0458eedcd1ecdf2e55cb505b61704b83b21e2907361acd2f72eddb368a","sha256:45fea78424f547f36ef9b87b7f950ca74bedf02144904c47462ed5adf635bcc5"],"state_sha256":"c9cf6c4163f65519d76be53cc9fbdfe53e4f818bd44dc8b015249c24c2d86010"}