{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MBJL3OC7YLQJ2IG5RO5WBOVJRN","short_pith_number":"pith:MBJL3OC7","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"},"canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","source":{"kind":"arxiv","id":"2606.01996","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01996","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01996v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01996","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBJL3OC7YLQJ","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"MBJL3OC7YLQJ2IG5","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"MBJL3OC7","created_at":"2026-06-02T02:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MBJL3OC7YLQJ2IG5RO5WBOVJRN","target":"record","payload":{"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"},"canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","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"},"source_kind":"arxiv","source_id":"2606.01996","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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpyV08RTVgDlGrAm6dK8OZWKzYX7eRG2n6vNHU3zQIReB+G2UF6O+DgvZzzlvAlqCho9htfX311v0qRoe1mmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:37:57.188130Z"},"content_sha256":"1693289763aa2c5cb2055204502508b1fbba9d3c8ab3c9ce5f1b029a9d6627a2","schema_version":"1.0","event_id":"sha256:1693289763aa2c5cb2055204502508b1fbba9d3c8ab3c9ce5f1b029a9d6627a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MBJL3OC7YLQJ2IG5RO5WBOVJRN","target":"graph","payload":{"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"},"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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N+W6mO/V2knXfx9LeXMWWXKw2QWRJdkfWnWXaPgSI/Jv6xCzjXLmJU/uNMiZ0rM6lXnLwXOvg/8xvHfZALlJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:37:57.188940Z"},"content_sha256":"48f385c1a43b4c7b4fd801ef76c77ab3b498ba72c4b56e244629cfa8f94b4e59","schema_version":"1.0","event_id":"sha256:48f385c1a43b4c7b4fd801ef76c77ab3b498ba72c4b56e244629cfa8f94b4e59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/bundle.json","state_url":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/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-06-11T22:37:57Z","links":{"resolver":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN","bundle":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/bundle.json","state":"https://pith.science/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MBJL3OC7YLQJ2IG5RO5WBOVJRN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MBJL3OC7YLQJ2IG5RO5WBOVJRN","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":"f79624c0d3463c68746ebb9badd66805dd5b41cb65d112abc324e40b6c5cb67e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T09:51:25Z","title_canon_sha256":"e48ade3b828fe46882e031a8ee39de5ae90d97ea27a85c5fb76034efccd95a8b"},"schema_version":"1.0","source":{"id":"2606.01996","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.01996","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.01996v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01996","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"MBJL3OC7YLQJ","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"MBJL3OC7YLQJ2IG5","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"MBJL3OC7","created_at":"2026-06-02T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:48f385c1a43b4c7b4fd801ef76c77ab3b498ba72c4b56e244629cfa8f94b4e59","target":"graph","created_at":"2026-06-02T02:05:03Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.01996/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}","authors_text":"Jiabao Yang, Ting Huang, Yaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T09:51:25Z","title":"On the threshold Ramsey multiplicity conjectures for paths and even cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01996","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:1693289763aa2c5cb2055204502508b1fbba9d3c8ab3c9ce5f1b029a9d6627a2","target":"record","created_at":"2026-06-02T02:05:03Z","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":"f79624c0d3463c68746ebb9badd66805dd5b41cb65d112abc324e40b6c5cb67e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T09:51:25Z","title_canon_sha256":"e48ade3b828fe46882e031a8ee39de5ae90d97ea27a85c5fb76034efccd95a8b"},"schema_version":"1.0","source":{"id":"2606.01996","kind":"arxiv","version":1}},"canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6052bdb85fc2e09d20dd8bbb60baa98b74ad609f52e2508a3ecf27f1473c181a","first_computed_at":"2026-06-02T02:05:03.130368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:03.130368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XDYoXUzCUwDGqUvg1kDLiWRwcmTlwccamjUR422Qq4NvVA6WQ+Q4W+Ko39TBbZCTMz6IN05iK2k9VTbgKjhXCQ==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:03.130835Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.01996","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1693289763aa2c5cb2055204502508b1fbba9d3c8ab3c9ce5f1b029a9d6627a2","sha256:48f385c1a43b4c7b4fd801ef76c77ab3b498ba72c4b56e244629cfa8f94b4e59"],"state_sha256":"7c65e79e17530b3533791681b7597853082f941a7af5582b5b9735d2da2c86ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kiHRc7T4TYp+FPIRY/CpaMjxtQbo4xvnqtRNtaFu8qWdg2b04S5uGnOGStA2Uy2lIdctrIjef1XbtaszHK1DDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:37:57.193114Z","bundle_sha256":"b625423f49504ca81f80efdeecc28ad9f39d2e75609f3dfc084357039ce49c9c"}}