{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4EARCA6LKEVELZLFYZROHUZU2I","short_pith_number":"pith:4EARCA6L","schema_version":"1.0","canonical_sha256":"e1011103cb512a45e565c662e3d334d21fd2e28ca8dfeaa84d128a22d2cadfd1","source":{"kind":"arxiv","id":"2605.21471","version":1},"attestation_state":"computed","paper":{"title":"Ramsey properties for tilings in random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danni Peng, Lucas Arag\\~ao, Rafael Filipe, Rafael Miyazaki, Xinbu Cheng, Zhifei Yan","submitted_at":"2026-05-20T17:55:00Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.21471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-20T17:55:00Z","cross_cats_sorted":[],"title_canon_sha256":"d47fd2efd1034bfaa8f01ddd7e7d935045647095f6d9e146141bd347d7e51a3a","abstract_canon_sha256":"41da808cca7b83725b62b8efd267ff2075488a4e8d98be9458b97cbebd9f919a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T02:05:38.829117Z","signature_b64":"/n/5CB6EGGEvgZJtOHDJkEmiTy/dcMCN2puxoEWbcw+FBSMSXSvtvbwUtBtf3qpff+gIp7Ts4A3wiQQw9xn9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1011103cb512a45e565c662e3d334d21fd2e28ca8dfeaa84d128a22d2cadfd1","last_reissued_at":"2026-05-21T02:05:38.828417Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T02:05:38.828417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey properties for tilings in random graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danni Peng, Lucas Arag\\~ao, Rafael Filipe, Rafael Miyazaki, Xinbu Cheng, Zhifei Yan","submitted_at":"2026-05-20T17:55:00Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21471","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/2605.21471/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.21471","created_at":"2026-05-21T02:05:38.828539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.21471v1","created_at":"2026-05-21T02:05:38.828539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21471","created_at":"2026-05-21T02:05:38.828539+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EARCA6LKEVE","created_at":"2026-05-21T02:05:38.828539+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EARCA6LKEVELZLF","created_at":"2026-05-21T02:05:38.828539+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EARCA6L","created_at":"2026-05-21T02:05:38.828539+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.22395","citing_title":"A random version of the Burr-Erd\\H{o}s-Spencer theorem","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I","json":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I.json","graph_json":"https://pith.science/api/pith-number/4EARCA6LKEVELZLFYZROHUZU2I/graph.json","events_json":"https://pith.science/api/pith-number/4EARCA6LKEVELZLFYZROHUZU2I/events.json","paper":"https://pith.science/paper/4EARCA6L"},"agent_actions":{"view_html":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I","download_json":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I.json","view_paper":"https://pith.science/paper/4EARCA6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.21471&json=true","fetch_graph":"https://pith.science/api/pith-number/4EARCA6LKEVELZLFYZROHUZU2I/graph.json","fetch_events":"https://pith.science/api/pith-number/4EARCA6LKEVELZLFYZROHUZU2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I/action/storage_attestation","attest_author":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I/action/author_attestation","sign_citation":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I/action/citation_signature","submit_replication":"https://pith.science/pith/4EARCA6LKEVELZLFYZROHUZU2I/action/replication_record"}},"created_at":"2026-05-21T02:05:38.828539+00:00","updated_at":"2026-05-21T02:05:38.828539+00:00"}