{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:TYDOZZIOB5K2ABW5E3ACLAY436","short_pith_number":"pith:TYDOZZIO","schema_version":"1.0","canonical_sha256":"9e06ece50e0f55a006dd26c025831cdfaa7c055ec969cf269b8e60d03f1586b8","source":{"kind":"arxiv","id":"2211.07033","version":2},"attestation_state":"computed","paper":{"title":"Directed graphs with lower orientation Ramsey thresholds","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruno Pasqualotto Cavalar, Gabriel Ferreira Barros, Guilherme Oliveira Mota, T\\'assio Naia, Yoshiharu Kohayakawa","submitted_at":"2022-11-13T22:27:39Z","abstract_excerpt":"We investigate the threshold $p_{\\vec H}=p_{\\vec H}(n)$ for the Ramsey-type property $G(n,p)\\to \\vec H$, where $G(n,p)$ is the binomial random graph and $G\\to\\vec H$ indicates that every orientation of the graph $G$ contains the oriented graph $\\vec H$ as a subdigraph. Similarly to the classical Ramsey setting, the upper bound $p_{\\vec H}\\leq Cn^{-1/m_2(\\vec H)}$ is known to hold for some constant $C=C(\\vec H)$, where $m_2(\\vec H)$ denotes the maximum $2$-density of the underlying graph $H$ of $\\vec H$. While this upper bound is indeed the threshold for some $\\vec H$, this is not always the ca"},"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":"2211.07033","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-11-13T22:27:39Z","cross_cats_sorted":[],"title_canon_sha256":"958b83f7b0e782f4d983ccd3332eb3c9331b0ab6f2d9809bf4b7971157d6c8fd","abstract_canon_sha256":"93d3d3ca5e8f7130cf9cccf03d940239239fff5fc29de29b044c6e4d26f3a3c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:28.055152Z","signature_b64":"oTSEPnNlp4qOyNiDizrZZPI3ZzT5JLJWa8kywOoBDjznZfb+C8E7odjLs5ENHKWS0tFJ3bUovhjHIoAHUEZADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e06ece50e0f55a006dd26c025831cdfaa7c055ec969cf269b8e60d03f1586b8","last_reissued_at":"2026-07-05T08:32:28.054734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:28.054734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Directed graphs with lower orientation Ramsey thresholds","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruno Pasqualotto Cavalar, Gabriel Ferreira Barros, Guilherme Oliveira Mota, T\\'assio Naia, Yoshiharu Kohayakawa","submitted_at":"2022-11-13T22:27:39Z","abstract_excerpt":"We investigate the threshold $p_{\\vec H}=p_{\\vec H}(n)$ for the Ramsey-type property $G(n,p)\\to \\vec H$, where $G(n,p)$ is the binomial random graph and $G\\to\\vec H$ indicates that every orientation of the graph $G$ contains the oriented graph $\\vec H$ as a subdigraph. Similarly to the classical Ramsey setting, the upper bound $p_{\\vec H}\\leq Cn^{-1/m_2(\\vec H)}$ is known to hold for some constant $C=C(\\vec H)$, where $m_2(\\vec H)$ denotes the maximum $2$-density of the underlying graph $H$ of $\\vec H$. While this upper bound is indeed the threshold for some $\\vec H$, this is not always the ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.07033","kind":"arxiv","version":2},"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/2211.07033/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":"2211.07033","created_at":"2026-07-05T08:32:28.054792+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.07033v2","created_at":"2026-07-05T08:32:28.054792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.07033","created_at":"2026-07-05T08:32:28.054792+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYDOZZIOB5K2","created_at":"2026-07-05T08:32:28.054792+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYDOZZIOB5K2ABW5","created_at":"2026-07-05T08:32:28.054792+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYDOZZIO","created_at":"2026-07-05T08:32:28.054792+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/TYDOZZIOB5K2ABW5E3ACLAY436","json":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436.json","graph_json":"https://pith.science/api/pith-number/TYDOZZIOB5K2ABW5E3ACLAY436/graph.json","events_json":"https://pith.science/api/pith-number/TYDOZZIOB5K2ABW5E3ACLAY436/events.json","paper":"https://pith.science/paper/TYDOZZIO"},"agent_actions":{"view_html":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436","download_json":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436.json","view_paper":"https://pith.science/paper/TYDOZZIO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.07033&json=true","fetch_graph":"https://pith.science/api/pith-number/TYDOZZIOB5K2ABW5E3ACLAY436/graph.json","fetch_events":"https://pith.science/api/pith-number/TYDOZZIOB5K2ABW5E3ACLAY436/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436/action/storage_attestation","attest_author":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436/action/author_attestation","sign_citation":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436/action/citation_signature","submit_replication":"https://pith.science/pith/TYDOZZIOB5K2ABW5E3ACLAY436/action/replication_record"}},"created_at":"2026-07-05T08:32:28.054792+00:00","updated_at":"2026-07-05T08:32:28.054792+00:00"}