{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MBJL3OC7YLQJ2IG5RO5WBOVJRN","short_pith_number":"pith:MBJL3OC7","schema_version":"1.0","canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","source":{"kind":"arxiv","id":"2606.01996","version":1},"attestation_state":"computed","paper":{"title":"On the threshold Ramsey multiplicity conjectures for paths and even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiabao Yang, Ting Huang, Yaojun Chen","submitted_at":"2026-06-01T09:51:25Z","abstract_excerpt":"The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ of $H$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $K_{r(H)}$. Let $P_t$ and $C_t$ be a path and a cycle on $t$ vertices, respectively. In this paper, by using combinatorial and local random construction, we show that $$m(C_{2t})\\le t^{-\\gamma+o(1)}\\frac{(2t-1)!}{2}, \\qquad m(P_{2t+1})\\le t^{-\\gamma+o(1)}\\frac{t}{2}"},"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.01996","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T09:51:25Z","cross_cats_sorted":[],"title_canon_sha256":"e48ade3b828fe46882e031a8ee39de5ae90d97ea27a85c5fb76034efccd95a8b","abstract_canon_sha256":"f79624c0d3463c68746ebb9badd66805dd5b41cb65d112abc324e40b6c5cb67e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:03.130835Z","signature_b64":"XDYoXUzCUwDGqUvg1kDLiWRwcmTlwccamjUR422Qq4NvVA6WQ+Q4W+Ko39TBbZCTMz6IN05iK2k9VTbgKjhXCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","last_reissued_at":"2026-06-02T02:05:03.130368Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:03.130368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the threshold Ramsey multiplicity conjectures for paths and even cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiabao Yang, Ting Huang, Yaojun Chen","submitted_at":"2026-06-01T09:51:25Z","abstract_excerpt":"The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ of $H$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $K_{r(H)}$. Let $P_t$ and $C_t$ be a path and a cycle on $t$ vertices, respectively. In this paper, by using combinatorial and local random construction, we show that $$m(C_{2t})\\le t^{-\\gamma+o(1)}\\frac{(2t-1)!}{2}, \\qquad m(P_{2t+1})\\le t^{-\\gamma+o(1)}\\frac{t}{2}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01996","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.01996/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.01996","created_at":"2026-06-02T02:05:03.130425+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01996v1","created_at":"2026-06-02T02:05:03.130425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01996","created_at":"2026-06-02T02:05:03.130425+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBJL3OC7YLQJ","created_at":"2026-06-02T02:05:03.130425+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBJL3OC7YLQJ2IG5","created_at":"2026-06-02T02:05:03.130425+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBJL3OC7","created_at":"2026-06-02T02:05:03.130425+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/MBJL3OC7YLQJ2IG5RO5WBOVJRN","json":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN.json","graph_json":"https://pith.science/api/pith-number/MBJL3OC7YLQJ2IG5RO5WBOVJRN/graph.json","events_json":"https://pith.science/api/pith-number/MBJL3OC7YLQJ2IG5RO5WBOVJRN/events.json","paper":"https://pith.science/paper/MBJL3OC7"},"agent_actions":{"view_html":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN","download_json":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN.json","view_paper":"https://pith.science/paper/MBJL3OC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01996&json=true","fetch_graph":"https://pith.science/api/pith-number/MBJL3OC7YLQJ2IG5RO5WBOVJRN/graph.json","fetch_events":"https://pith.science/api/pith-number/MBJL3OC7YLQJ2IG5RO5WBOVJRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/action/storage_attestation","attest_author":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/action/author_attestation","sign_citation":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/action/citation_signature","submit_replication":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/action/replication_record"}},"created_at":"2026-06-02T02:05:03.130425+00:00","updated_at":"2026-06-02T02:05:03.130425+00:00"}