{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KLXYV7AJGNZFH3NIEKFXU6PJ5F","short_pith_number":"pith:KLXYV7AJ","schema_version":"1.0","canonical_sha256":"52ef8afc09337253eda8228b7a79e9e95d06cfe06ce05fad431195db8f072115","source":{"kind":"arxiv","id":"2605.26815","version":1},"attestation_state":"computed","paper":{"title":"Prime Certificates for Exact Vertex-Coprime Ramsey Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"math.CO","authors_text":"Lan Ma, Wenji Xi, Zhicheng Du, Zhuo Deng","submitted_at":"2026-05-26T10:31:20Z","abstract_excerpt":"Let $G_n$ be the coprime graph on $\\{1,\\ldots,n\\}$. We prove that the mixed vertex-coloring coprime Ramsey number satisfies \\[\n  \\Rcop(k_1,\\ldots,k_c)=p_{\\sum_{i=1}^c(k_i-1)}, \\] where $p_m$ is the $m$-th prime. The proof is elementary: the prime clique $\\{1\\}\\cup\\{p\\le n:p\\text{ prime}\\}$ gives the upper bound by pigeonhole, while a prime-bin partition gives the matching lower bound by coloring each composite with a bin containing one of its prime divisors. We reserve $\\Rcop$ for this vertex-coloring parameter; the edge-coloring parameter on the same host graph is denoted $\\Redge$. The same c"},"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":"2605.26815","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T10:31:20Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"e9fc8e8634456d064663dae7cf798e5df5471d61b52001c529b44389d8810320","abstract_canon_sha256":"99d84521733dcdd37ec4a2cf6693bb0ccedb7a0b2be71afabcb4a3da6862d6e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:14.057856Z","signature_b64":"+hdUk/rVZ2SZBE4FSK9aa8BzPpssafyzzSkXl9rfWXwpb3PglGEuptYr+6o+gc9xaNOpQ5JR64SNOcws0L1jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52ef8afc09337253eda8228b7a79e9e95d06cfe06ce05fad431195db8f072115","last_reissued_at":"2026-05-27T01:06:14.057194Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:14.057194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prime Certificates for Exact Vertex-Coprime Ramsey Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"math.CO","authors_text":"Lan Ma, Wenji Xi, Zhicheng Du, Zhuo Deng","submitted_at":"2026-05-26T10:31:20Z","abstract_excerpt":"Let $G_n$ be the coprime graph on $\\{1,\\ldots,n\\}$. We prove that the mixed vertex-coloring coprime Ramsey number satisfies \\[\n  \\Rcop(k_1,\\ldots,k_c)=p_{\\sum_{i=1}^c(k_i-1)}, \\] where $p_m$ is the $m$-th prime. The proof is elementary: the prime clique $\\{1\\}\\cup\\{p\\le n:p\\text{ prime}\\}$ gives the upper bound by pigeonhole, while a prime-bin partition gives the matching lower bound by coloring each composite with a bin containing one of its prime divisors. We reserve $\\Rcop$ for this vertex-coloring parameter; the edge-coloring parameter on the same host graph is denoted $\\Redge$. The same c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26815","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/2605.26815/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":"2605.26815","created_at":"2026-05-27T01:06:14.057299+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26815v1","created_at":"2026-05-27T01:06:14.057299+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26815","created_at":"2026-05-27T01:06:14.057299+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLXYV7AJGNZF","created_at":"2026-05-27T01:06:14.057299+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLXYV7AJGNZFH3NI","created_at":"2026-05-27T01:06:14.057299+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLXYV7AJ","created_at":"2026-05-27T01:06:14.057299+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/KLXYV7AJGNZFH3NIEKFXU6PJ5F","json":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F.json","graph_json":"https://pith.science/api/pith-number/KLXYV7AJGNZFH3NIEKFXU6PJ5F/graph.json","events_json":"https://pith.science/api/pith-number/KLXYV7AJGNZFH3NIEKFXU6PJ5F/events.json","paper":"https://pith.science/paper/KLXYV7AJ"},"agent_actions":{"view_html":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F","download_json":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F.json","view_paper":"https://pith.science/paper/KLXYV7AJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26815&json=true","fetch_graph":"https://pith.science/api/pith-number/KLXYV7AJGNZFH3NIEKFXU6PJ5F/graph.json","fetch_events":"https://pith.science/api/pith-number/KLXYV7AJGNZFH3NIEKFXU6PJ5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F/action/storage_attestation","attest_author":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F/action/author_attestation","sign_citation":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F/action/citation_signature","submit_replication":"https://pith.science/pith/KLXYV7AJGNZFH3NIEKFXU6PJ5F/action/replication_record"}},"created_at":"2026-05-27T01:06:14.057299+00:00","updated_at":"2026-05-27T01:06:14.057299+00:00"}