{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JGQCOCKHZVOCP2PQSRLRQAYUDV","short_pith_number":"pith:JGQCOCKH","canonical_record":{"source":{"id":"1602.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T14:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"4a7f56d6420c90a4305b03082525fb1aeff89dcf3a6b2f7d82d561435ebee5d8","abstract_canon_sha256":"eaf283a4bfff78b63fa47bbbed357140bbd5b20f9937e5766659acd2dba3e4f5"},"schema_version":"1.0"},"canonical_sha256":"49a0270947cd5c27e9f094571803141d5bcfa5c4d46d08d19987d060f19a50d4","source":{"kind":"arxiv","id":"1602.04059","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04059","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04059v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04059","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"JGQCOCKHZVOC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGQCOCKHZVOCP2PQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGQCOCKH","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JGQCOCKHZVOCP2PQSRLRQAYUDV","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T14:04:47Z","cross_cats_sorted":[],"title_canon_sha256":"4a7f56d6420c90a4305b03082525fb1aeff89dcf3a6b2f7d82d561435ebee5d8","abstract_canon_sha256":"eaf283a4bfff78b63fa47bbbed357140bbd5b20f9937e5766659acd2dba3e4f5"},"schema_version":"1.0"},"canonical_sha256":"49a0270947cd5c27e9f094571803141d5bcfa5c4d46d08d19987d060f19a50d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:54.726643Z","signature_b64":"MsJdwH9xR1m7A3nC/SZVWQECwl5i3R2J5LfOIfoyfKLfbD3s7myRW0q1QsZ4Ntqd1iXtZxt9GYhhoa2yZ7a4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49a0270947cd5c27e9f094571803141d5bcfa5c4d46d08d19987d060f19a50d4","last_reissued_at":"2026-05-18T01:20:54.726073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:54.726073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04059","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSqHT4WBe8yPsksmm4YhQm6rw2lIL03qtt1BUEE0OgoHxaJ1jefv6kofUsxOgji1tHKpo7vz1K7ktMWJG+ksBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:08.792486Z"},"content_sha256":"288460790bd3f35a93af73a772b8cf6b174d3a1eaab5c35a24d555bd9ccdb62e","schema_version":"1.0","event_id":"sha256:288460790bd3f35a93af73a772b8cf6b174d3a1eaab5c35a24d555bd9ccdb62e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JGQCOCKHZVOCP2PQSRLRQAYUDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper bounds on probability thresholds for asymmetric Ramsey properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mathias Schacht, Reto Sp\\\"ohel, Yoshiharu Kohayakawa","submitted_at":"2016-02-12T14:04:47Z","abstract_excerpt":"Given two graphs $G$ and $H$, we investigate for which functions $p=p(n)$ the random graph $G_{n,p}$ (the binomial random graph on $n$ vertices with edge probability $p$) satisfies with probability $1-o(1)$ that every red-blue-coloring of its edges contains a red copy of $G$ or a blue copy of $H$. We prove a general upper bound on the threshold for this property under the assumption that the denser of the two graphs satisfies a certain balancedness condition. Our result partially confirms a conjecture by the first author and Kreuter, and together with earlier lower bound results establishes th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04059","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:20:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eYSP7IyStRhkye97rJ2UMSeJWG3A4qwrgKLgNotMEuiB+5BxgmAzao0AWDIB5drwiS1MCP+6L0LyIDcyA4vyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:34:08.793115Z"},"content_sha256":"08a45eb7a1a95997bd60eee63649bb1cefa78cee4e0556970e0f17b068b3fb34","schema_version":"1.0","event_id":"sha256:08a45eb7a1a95997bd60eee63649bb1cefa78cee4e0556970e0f17b068b3fb34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/bundle.json","state_url":"https://pith.science/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:34:08Z","links":{"resolver":"https://pith.science/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV","bundle":"https://pith.science/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/bundle.json","state":"https://pith.science/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGQCOCKHZVOCP2PQSRLRQAYUDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JGQCOCKHZVOCP2PQSRLRQAYUDV","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":"eaf283a4bfff78b63fa47bbbed357140bbd5b20f9937e5766659acd2dba3e4f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T14:04:47Z","title_canon_sha256":"4a7f56d6420c90a4305b03082525fb1aeff89dcf3a6b2f7d82d561435ebee5d8"},"schema_version":"1.0","source":{"id":"1602.04059","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04059","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04059v1","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04059","created_at":"2026-05-18T01:20:54Z"},{"alias_kind":"pith_short_12","alias_value":"JGQCOCKHZVOC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JGQCOCKHZVOCP2PQ","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JGQCOCKH","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:08a45eb7a1a95997bd60eee63649bb1cefa78cee4e0556970e0f17b068b3fb34","target":"graph","created_at":"2026-05-18T01:20:54Z","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"},"paper":{"abstract_excerpt":"Given two graphs $G$ and $H$, we investigate for which functions $p=p(n)$ the random graph $G_{n,p}$ (the binomial random graph on $n$ vertices with edge probability $p$) satisfies with probability $1-o(1)$ that every red-blue-coloring of its edges contains a red copy of $G$ or a blue copy of $H$. We prove a general upper bound on the threshold for this property under the assumption that the denser of the two graphs satisfies a certain balancedness condition. Our result partially confirms a conjecture by the first author and Kreuter, and together with earlier lower bound results establishes th","authors_text":"Mathias Schacht, Reto Sp\\\"ohel, Yoshiharu Kohayakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T14:04:47Z","title":"Upper bounds on probability thresholds for asymmetric Ramsey properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04059","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:288460790bd3f35a93af73a772b8cf6b174d3a1eaab5c35a24d555bd9ccdb62e","target":"record","created_at":"2026-05-18T01:20:54Z","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":"eaf283a4bfff78b63fa47bbbed357140bbd5b20f9937e5766659acd2dba3e4f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-12T14:04:47Z","title_canon_sha256":"4a7f56d6420c90a4305b03082525fb1aeff89dcf3a6b2f7d82d561435ebee5d8"},"schema_version":"1.0","source":{"id":"1602.04059","kind":"arxiv","version":1}},"canonical_sha256":"49a0270947cd5c27e9f094571803141d5bcfa5c4d46d08d19987d060f19a50d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49a0270947cd5c27e9f094571803141d5bcfa5c4d46d08d19987d060f19a50d4","first_computed_at":"2026-05-18T01:20:54.726073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:54.726073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MsJdwH9xR1m7A3nC/SZVWQECwl5i3R2J5LfOIfoyfKLfbD3s7myRW0q1QsZ4Ntqd1iXtZxt9GYhhoa2yZ7a4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:54.726643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04059","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:288460790bd3f35a93af73a772b8cf6b174d3a1eaab5c35a24d555bd9ccdb62e","sha256:08a45eb7a1a95997bd60eee63649bb1cefa78cee4e0556970e0f17b068b3fb34"],"state_sha256":"82633b3a98d7688a4758cba0bf35baee93844112e0fe8cd27ead7bc1db9f5c48"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZP2BTDMe4xD8Ru/dNS7zW/3HTQ3Np1qioXTGzMoKH+1BIp5ExL3YRbNFuTq8wIlJbxwJ8H3oohlu9hb3GiaWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:34:08.796271Z","bundle_sha256":"e69313c68a1d89c28250b70d4ef0ac90c394efa6729bc217659949869257de35"}}