{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HCDBUXA4SGDEAQZW3LPTYP2FKK","short_pith_number":"pith:HCDBUXA4","schema_version":"1.0","canonical_sha256":"38861a5c1c9186404336dadf3c3f4552bf84a2160c6e126318c8441aef6a5115","source":{"kind":"arxiv","id":"1610.00935","version":1},"attestation_state":"computed","paper":{"title":"Symmetric and asymmetric Ramsey properties in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Henning Thomas, Luca Gugelmann, Nemanja \\v{S}kori\\'c, Rajko Nenadov, Yury Person","submitted_at":"2016-10-04T11:35:19Z","abstract_excerpt":"A celebrated result of R\\\"odl and Ruci\\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\\ge 2$ there exist positive constants $c, C$ such that for $p \\leq cn^{-1/m_2(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the \"0-statement\"), while for $p \\geq Cn^{-1/m_2(F)}$ it is $1-o(1)$ (the \"1-statement\"). Here $m_2(F)$ denotes the $2$-density of $F$. On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is"},"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":"1610.00935","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-04T11:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"c996fb3effb4a91f943a60ff354e6f6413450b974016d455a8d1b03b32eff117","abstract_canon_sha256":"a15c42b96d47fa36d5eedd7be482b8109428f1370e87bc5ba26be75a89bf86c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:12.876954Z","signature_b64":"G5kBqrhImxnfsU4wxQLjZP4LKZhOnPXgksvU6elAw0N1AVD9mYo1T9CW78EOoz0YnKZ3WiUPLts5td0/ygH5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38861a5c1c9186404336dadf3c3f4552bf84a2160c6e126318c8441aef6a5115","last_reissued_at":"2026-05-18T01:03:12.876431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:12.876431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetric and asymmetric Ramsey properties in random hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelika Steger, Henning Thomas, Luca Gugelmann, Nemanja \\v{S}kori\\'c, Rajko Nenadov, Yury Person","submitted_at":"2016-10-04T11:35:19Z","abstract_excerpt":"A celebrated result of R\\\"odl and Ruci\\'nski states that for every graph $F$, which is not a forest of stars and paths of length $3$, and fixed number of colours $r\\ge 2$ there exist positive constants $c, C$ such that for $p \\leq cn^{-1/m_2(F)}$ the probability that every colouring of the edges of the random graph $G(n,p)$ contains a monochromatic copy of $F$ is $o(1)$ (the \"0-statement\"), while for $p \\geq Cn^{-1/m_2(F)}$ it is $1-o(1)$ (the \"1-statement\"). Here $m_2(F)$ denotes the $2$-density of $F$. On the other hand, the case where $F$ is a forest of stars has a coarse threshold which is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.00935","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":""},"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":"1610.00935","created_at":"2026-05-18T01:03:12.876516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.00935v1","created_at":"2026-05-18T01:03:12.876516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.00935","created_at":"2026-05-18T01:03:12.876516+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCDBUXA4SGDE","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCDBUXA4SGDEAQZW","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCDBUXA4","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK","json":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK.json","graph_json":"https://pith.science/api/pith-number/HCDBUXA4SGDEAQZW3LPTYP2FKK/graph.json","events_json":"https://pith.science/api/pith-number/HCDBUXA4SGDEAQZW3LPTYP2FKK/events.json","paper":"https://pith.science/paper/HCDBUXA4"},"agent_actions":{"view_html":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK","download_json":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK.json","view_paper":"https://pith.science/paper/HCDBUXA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.00935&json=true","fetch_graph":"https://pith.science/api/pith-number/HCDBUXA4SGDEAQZW3LPTYP2FKK/graph.json","fetch_events":"https://pith.science/api/pith-number/HCDBUXA4SGDEAQZW3LPTYP2FKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK/action/storage_attestation","attest_author":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK/action/author_attestation","sign_citation":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK/action/citation_signature","submit_replication":"https://pith.science/pith/HCDBUXA4SGDEAQZW3LPTYP2FKK/action/replication_record"}},"created_at":"2026-05-18T01:03:12.876516+00:00","updated_at":"2026-05-18T01:03:12.876516+00:00"}