{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NDSMNUUNNCCWDWBE22YORPQLBG","short_pith_number":"pith:NDSMNUUN","schema_version":"1.0","canonical_sha256":"68e4c6d28d688561d824d6b0e8be0b09a42111038e2a4997e179e034d2bec6e2","source":{"kind":"arxiv","id":"1304.6466","version":1},"attestation_state":"computed","paper":{"title":"Planar Ramsey Numbers of Four Cycles Versus Wheels","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chen Yaojun, Miao Zhengke, Zhou Guofei","submitted_at":"2013-04-24T02:30:55Z","abstract_excerpt":"For two given graphs $G$ and $H$ the planar Ramsey number $PR(G,H)$ is the smallest integer $n$ such that every planar graph $F$ on $n$ vertices either contains a copy of $G$, or its complement contains a copy of $H$. In this paper, we first characterize some structural properties of $C_4$-free planar graphs, and then we determine all planar Ramsey numbers $PR(C_4, W_n)$, for $n\\ge 3$."},"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":"1304.6466","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.CO","submitted_at":"2013-04-24T02:30:55Z","cross_cats_sorted":[],"title_canon_sha256":"13cdc3fe77b5d0ae79ca9a14f87ae52191407e9c04b20ddc9284e0e1616e136f","abstract_canon_sha256":"b920b8304427b12fa78100046e10823a842ffad9b21f05e56d09d0f25089a47c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.035481Z","signature_b64":"hmfoXyK4m766Jp8EMTC3ingqG4pwazt2M1D8ILnMKQrz25UvrMhqvQxQGMF7YeQVxYEuv1HFO4s51PR+WS9ADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68e4c6d28d688561d824d6b0e8be0b09a42111038e2a4997e179e034d2bec6e2","last_reissued_at":"2026-05-18T03:27:13.034922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.034922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar Ramsey Numbers of Four Cycles Versus Wheels","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chen Yaojun, Miao Zhengke, Zhou Guofei","submitted_at":"2013-04-24T02:30:55Z","abstract_excerpt":"For two given graphs $G$ and $H$ the planar Ramsey number $PR(G,H)$ is the smallest integer $n$ such that every planar graph $F$ on $n$ vertices either contains a copy of $G$, or its complement contains a copy of $H$. In this paper, we first characterize some structural properties of $C_4$-free planar graphs, and then we determine all planar Ramsey numbers $PR(C_4, W_n)$, for $n\\ge 3$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6466","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":"1304.6466","created_at":"2026-05-18T03:27:13.035006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6466v1","created_at":"2026-05-18T03:27:13.035006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6466","created_at":"2026-05-18T03:27:13.035006+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDSMNUUNNCCW","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDSMNUUNNCCWDWBE","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDSMNUUN","created_at":"2026-05-18T12:27:52.871228+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/NDSMNUUNNCCWDWBE22YORPQLBG","json":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG.json","graph_json":"https://pith.science/api/pith-number/NDSMNUUNNCCWDWBE22YORPQLBG/graph.json","events_json":"https://pith.science/api/pith-number/NDSMNUUNNCCWDWBE22YORPQLBG/events.json","paper":"https://pith.science/paper/NDSMNUUN"},"agent_actions":{"view_html":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG","download_json":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG.json","view_paper":"https://pith.science/paper/NDSMNUUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6466&json=true","fetch_graph":"https://pith.science/api/pith-number/NDSMNUUNNCCWDWBE22YORPQLBG/graph.json","fetch_events":"https://pith.science/api/pith-number/NDSMNUUNNCCWDWBE22YORPQLBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG/action/storage_attestation","attest_author":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG/action/author_attestation","sign_citation":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG/action/citation_signature","submit_replication":"https://pith.science/pith/NDSMNUUNNCCWDWBE22YORPQLBG/action/replication_record"}},"created_at":"2026-05-18T03:27:13.035006+00:00","updated_at":"2026-05-18T03:27:13.035006+00:00"}