{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:726UQMIXBCK6DCQMPRDRW6A6A4","short_pith_number":"pith:726UQMIX","schema_version":"1.0","canonical_sha256":"febd4831170895e18a0c7c471b781e07262675db9edeabd86a75a765fdf5310e","source":{"kind":"arxiv","id":"2606.11174","version":1},"attestation_state":"computed","paper":{"title":"A general bound on $R(C_k,H)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Freschi, Stijn Cambie","submitted_at":"2026-06-09T17:50:13Z","abstract_excerpt":"In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $(k-1)m+1\\le km$. This settles a problem of Erd\\H{o}s, Faudree, Rousseau and Schelp, which is listed as problem 34 in the graph theory collection."},"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":"2606.11174","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-09T17:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"db8f9363d36fa699bd6ee04b012a2ce460ad2a813d2afd74fa064809ea8b5aba","abstract_canon_sha256":"87c721807928d9e008236d3e82bfc2466b798b99a66d605b71a38dc3f89dde57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:11:15.267100Z","signature_b64":"cfOKK0j+hVDeD8JjTKf1w8PTCBdt8p3V4VjOktFMkH7ELHWhm1M1jWDbHQqMGA+ynhchG0s40QF80igH/dA6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"febd4831170895e18a0c7c471b781e07262675db9edeabd86a75a765fdf5310e","last_reissued_at":"2026-06-10T01:11:15.266571Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:11:15.266571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general bound on $R(C_k,H)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea Freschi, Stijn Cambie","submitted_at":"2026-06-09T17:50:13Z","abstract_excerpt":"In this paper, we prove that for every $k$ and every graph $H$ with $m$ edges and no isolated vertices, the Ramsey number $R(C_k,H)$ is at most $(k-1)m+1\\le km$. This settles a problem of Erd\\H{o}s, Faudree, Rousseau and Schelp, which is listed as problem 34 in the graph theory collection."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.11174","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/2606.11174/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":"2606.11174","created_at":"2026-06-10T01:11:15.266630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.11174v1","created_at":"2026-06-10T01:11:15.266630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.11174","created_at":"2026-06-10T01:11:15.266630+00:00"},{"alias_kind":"pith_short_12","alias_value":"726UQMIXBCK6","created_at":"2026-06-10T01:11:15.266630+00:00"},{"alias_kind":"pith_short_16","alias_value":"726UQMIXBCK6DCQM","created_at":"2026-06-10T01:11:15.266630+00:00"},{"alias_kind":"pith_short_8","alias_value":"726UQMIX","created_at":"2026-06-10T01:11:15.266630+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/726UQMIXBCK6DCQMPRDRW6A6A4","json":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4.json","graph_json":"https://pith.science/api/pith-number/726UQMIXBCK6DCQMPRDRW6A6A4/graph.json","events_json":"https://pith.science/api/pith-number/726UQMIXBCK6DCQMPRDRW6A6A4/events.json","paper":"https://pith.science/paper/726UQMIX"},"agent_actions":{"view_html":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4","download_json":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4.json","view_paper":"https://pith.science/paper/726UQMIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.11174&json=true","fetch_graph":"https://pith.science/api/pith-number/726UQMIXBCK6DCQMPRDRW6A6A4/graph.json","fetch_events":"https://pith.science/api/pith-number/726UQMIXBCK6DCQMPRDRW6A6A4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4/action/storage_attestation","attest_author":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4/action/author_attestation","sign_citation":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4/action/citation_signature","submit_replication":"https://pith.science/pith/726UQMIXBCK6DCQMPRDRW6A6A4/action/replication_record"}},"created_at":"2026-06-10T01:11:15.266630+00:00","updated_at":"2026-06-10T01:11:15.266630+00:00"}