{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2OW7LEKDRPDPTU24ACX2BWFXEY","short_pith_number":"pith:2OW7LEKD","schema_version":"1.0","canonical_sha256":"d3adf591438bc6f9d35c00afa0d8b7261f51d257b8873425c385fd3104d0bfa0","source":{"kind":"arxiv","id":"2012.08632","version":1},"attestation_state":"computed","paper":{"title":"Orientation Ramsey thresholds for cycles and cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruno Pasqualotto Cavalar, Gabriel Ferreira Barros, T\\'assio Naia, Yoshiharu Kohayakawa","submitted_at":"2020-12-15T21:41:16Z","abstract_excerpt":"If $G$ is a graph and $\\vec H$ is an oriented graph, we write $G\\to \\vec H$ to say that every orientation of the edges of $G$ contains $\\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We determine the threshold $p_{\\vec H}=p_{\\vec H}(n)$ for the property $G(n,p)\\to \\vec H$ for the cases in which $\\vec H$ is an acyclic orientation of a complete graph or of a cycle."},"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":"2012.08632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-12-15T21:41:16Z","cross_cats_sorted":[],"title_canon_sha256":"3706d048ada52f087ebf26454af0a6a2da5709060290788aee23452d140a9ad7","abstract_canon_sha256":"80ed3c1eae5fc42ec70d0d6bec2002582f815786ea3139c4369d5ec96280b7fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:00:01.581058Z","signature_b64":"IDrsfBvLdNSeqwhurOh+weOmPq97muvqG+Slp9as+Yx8+B/2tF0AVbZUzOuW31ZFVaZdTwM2f9hOZ6i2UhplDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3adf591438bc6f9d35c00afa0d8b7261f51d257b8873425c385fd3104d0bfa0","last_reissued_at":"2026-07-05T02:00:01.580565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:00:01.580565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orientation Ramsey thresholds for cycles and cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bruno Pasqualotto Cavalar, Gabriel Ferreira Barros, T\\'assio Naia, Yoshiharu Kohayakawa","submitted_at":"2020-12-15T21:41:16Z","abstract_excerpt":"If $G$ is a graph and $\\vec H$ is an oriented graph, we write $G\\to \\vec H$ to say that every orientation of the edges of $G$ contains $\\vec H$ as a subdigraph. We consider the case in which $G=G(n,p)$, the binomial random graph. We determine the threshold $p_{\\vec H}=p_{\\vec H}(n)$ for the property $G(n,p)\\to \\vec H$ for the cases in which $\\vec H$ is an acyclic orientation of a complete graph or of a cycle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.08632","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/2012.08632/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":"2012.08632","created_at":"2026-07-05T02:00:01.580621+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.08632v1","created_at":"2026-07-05T02:00:01.580621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.08632","created_at":"2026-07-05T02:00:01.580621+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OW7LEKDRPDP","created_at":"2026-07-05T02:00:01.580621+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OW7LEKDRPDPTU24","created_at":"2026-07-05T02:00:01.580621+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OW7LEKD","created_at":"2026-07-05T02:00:01.580621+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/2OW7LEKDRPDPTU24ACX2BWFXEY","json":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY.json","graph_json":"https://pith.science/api/pith-number/2OW7LEKDRPDPTU24ACX2BWFXEY/graph.json","events_json":"https://pith.science/api/pith-number/2OW7LEKDRPDPTU24ACX2BWFXEY/events.json","paper":"https://pith.science/paper/2OW7LEKD"},"agent_actions":{"view_html":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY","download_json":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY.json","view_paper":"https://pith.science/paper/2OW7LEKD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.08632&json=true","fetch_graph":"https://pith.science/api/pith-number/2OW7LEKDRPDPTU24ACX2BWFXEY/graph.json","fetch_events":"https://pith.science/api/pith-number/2OW7LEKDRPDPTU24ACX2BWFXEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY/action/storage_attestation","attest_author":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY/action/author_attestation","sign_citation":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY/action/citation_signature","submit_replication":"https://pith.science/pith/2OW7LEKDRPDPTU24ACX2BWFXEY/action/replication_record"}},"created_at":"2026-07-05T02:00:01.580621+00:00","updated_at":"2026-07-05T02:00:01.580621+00:00"}