{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:F3XKXPE3ACNK7DNJJEEDT6XGCT","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":"7fb24969ff49b954e705032d767cbb0580a1f92eeccd8806ae2ecbdc7cd0d6f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-02T18:58:04Z","title_canon_sha256":"58d8b15f924fa30bc26a9ee7d9eb510fb0d33482f50ac13830db3b929ef2978a"},"schema_version":"1.0","source":{"id":"2103.01942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2103.01942","created_at":"2026-07-05T02:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"2103.01942v2","created_at":"2026-07-05T02:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.01942","created_at":"2026-07-05T02:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"F3XKXPE3ACNK","created_at":"2026-07-05T02:32:35Z"},{"alias_kind":"pith_short_16","alias_value":"F3XKXPE3ACNK7DNJ","created_at":"2026-07-05T02:32:35Z"},{"alias_kind":"pith_short_8","alias_value":"F3XKXPE3","created_at":"2026-07-05T02:32:35Z"}],"graph_snapshots":[{"event_id":"sha256:9f22145a665ee27164e9b56630bdf6cf557fcd21012bcade9854fb8b2dc5deca","target":"graph","created_at":"2026-07-05T02:32:35Z","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/2103.01942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $s$-colour size-Ramsey number of a hypergraph $H$ is the minimum number of edges in a hypergraph $G$ whose every $s$-edge-colouring contains a monochromatic copy of $H$. We show that the $s$-colour size-Ramsey number of the $t$-power of the $r$-uniform tight path on $n$ vertices is linear in $n$, for every fixed $r, s, t$, thus answering a question of Dudek, La Fleur, Mubayi, and R\\\"odl (2017).\n  In fact, we prove a stronger result that allows us to deduce that powers of bounded degree hypergraph trees and powers of `long subdivisions' of bounded degree hypergraphs have size-Ramsey numbers","authors_text":"Alexey Pokrovskiy, Liana Yepremyan, Shoham Letzter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-02T18:58:04Z","title":"Size-Ramsey numbers of powers of hypergraph trees and long subdivisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.01942","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:0a8f292b0dca4a508e4d7d7374140cb451edb82578ff953f6a9952ba67640f51","target":"record","created_at":"2026-07-05T02:32:35Z","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":"7fb24969ff49b954e705032d767cbb0580a1f92eeccd8806ae2ecbdc7cd0d6f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-02T18:58:04Z","title_canon_sha256":"58d8b15f924fa30bc26a9ee7d9eb510fb0d33482f50ac13830db3b929ef2978a"},"schema_version":"1.0","source":{"id":"2103.01942","kind":"arxiv","version":2}},"canonical_sha256":"2eeeabbc9b009aaf8da9490839fae614c5b04669ea27483a037e4e4e9e680d36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2eeeabbc9b009aaf8da9490839fae614c5b04669ea27483a037e4e4e9e680d36","first_computed_at":"2026-07-05T02:32:35.836362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:32:35.836362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XnO0CGiCEOV69vczcVqfsd94EKa22aeOZd0QHNIhJFz+QMMUce/XVqI1ysTfrnQee8tdvLRO3pxgzv5blU8jAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:32:35.836836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2103.01942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a8f292b0dca4a508e4d7d7374140cb451edb82578ff953f6a9952ba67640f51","sha256:9f22145a665ee27164e9b56630bdf6cf557fcd21012bcade9854fb8b2dc5deca"],"state_sha256":"e3a9dc9cb9b927c213482d7ccc2974664656e9d52269a5e54a7c389dc47aca34"}