{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4EARCA6LKEVELZLFYZROHUZU2I","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":"41da808cca7b83725b62b8efd267ff2075488a4e8d98be9458b97cbebd9f919a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T17:55:00Z","title_canon_sha256":"d47fd2efd1034bfaa8f01ddd7e7d935045647095f6d9e146141bd347d7e51a3a"},"schema_version":"1.0","source":{"id":"2605.21471","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21471","created_at":"2026-05-21T02:05:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21471v1","created_at":"2026-05-21T02:05:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21471","created_at":"2026-05-21T02:05:38Z"},{"alias_kind":"pith_short_12","alias_value":"4EARCA6LKEVE","created_at":"2026-05-21T02:05:38Z"},{"alias_kind":"pith_short_16","alias_value":"4EARCA6LKEVELZLF","created_at":"2026-05-21T02:05:38Z"},{"alias_kind":"pith_short_8","alias_value":"4EARCA6L","created_at":"2026-05-21T02:05:38Z"}],"graph_snapshots":[{"event_id":"sha256:f0ea5b0839c1eb61ab552d8dafea2044f1b1ecfb361c4615187f140013b40e32","target":"graph","created_at":"2026-05-21T02:05:38Z","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/2605.21471/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $mH$ be the graph formed by $m$ vertex-disjoint copies of a graph $H$. Let $G \\to (H)_r$ denote that, in any $r$-colouring of the edges of $G$, there exists a monochromatic copy of $H$. In 1975, Burr, Erd\\H{o}s, and Spencer showed that if $H$ is a graph on $k$ vertices whose independence number is $\\alpha$, then $K_n \\to (mH)_2$, where $m\\sim n/(2k-\\alpha)$, and that the $1/(2k-\\alpha)$ factor is best possible. In the 1990s, R\\\"{o}dl and Ruci\\'{n}ski proved that, for all but a few graphs~$H$, the threshold for the property $\\mathbb{G}(n,p) \\to (H)_r$ is $n^{-1/m_2(H)}$. In this paper, gene","authors_text":"Danni Peng, Lucas Arag\\~ao, Rafael Filipe, Rafael Miyazaki, Xinbu Cheng, Zhifei Yan","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T17:55:00Z","title":"Ramsey properties for tilings in random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21471","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:ae33770301fc631de4d5d85c617d649e294ac4136cf8cfaa1be3ac8d77594518","target":"record","created_at":"2026-05-21T02:05:38Z","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":"41da808cca7b83725b62b8efd267ff2075488a4e8d98be9458b97cbebd9f919a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T17:55:00Z","title_canon_sha256":"d47fd2efd1034bfaa8f01ddd7e7d935045647095f6d9e146141bd347d7e51a3a"},"schema_version":"1.0","source":{"id":"2605.21471","kind":"arxiv","version":1}},"canonical_sha256":"e1011103cb512a45e565c662e3d334d21fd2e28ca8dfeaa84d128a22d2cadfd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1011103cb512a45e565c662e3d334d21fd2e28ca8dfeaa84d128a22d2cadfd1","first_computed_at":"2026-05-21T02:05:38.828417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T02:05:38.828417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/n/5CB6EGGEvgZJtOHDJkEmiTy/dcMCN2puxoEWbcw+FBSMSXSvtvbwUtBtf3qpff+gIp7Ts4A3wiQQw9xn9DQ==","signature_status":"signed_v1","signed_at":"2026-05-21T02:05:38.829117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21471","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae33770301fc631de4d5d85c617d649e294ac4136cf8cfaa1be3ac8d77594518","sha256:f0ea5b0839c1eb61ab552d8dafea2044f1b1ecfb361c4615187f140013b40e32"],"state_sha256":"40cbfc535520cd18a4b01de5c4bee214d9db8ad2905f001bc8e063e84a303b54"}