{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:CXZGH5KNYQ5LMS2CXWKBOQOQEW","short_pith_number":"pith:CXZGH5KN","schema_version":"1.0","canonical_sha256":"15f263f54dc43ab64b42bd941741d02597724e9156e714002f4308d8b9141380","source":{"kind":"arxiv","id":"2306.17388","version":2},"attestation_state":"computed","paper":{"title":"Off-Diagonal Ramsey Multiplicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elena Moss, Jonathan A. Noel","submitted_at":"2023-06-30T03:36:31Z","abstract_excerpt":"The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to minimize a certain weighted sum of the densities of red copies of one graph and blue copies of another. We build up various properties of this new notion, including a useful \"dual formulation,\" and use these results to solve the problem for several pairs of graphs."},"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":"2306.17388","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-06-30T03:36:31Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2db577c7820df19a24127e3922ff1ed7267b52bbed60aed10ce1572692bc7017","abstract_canon_sha256":"ea2edb530796ef1a31096eff8509bf8213f586dca672fbcbb7f733b392a22f85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:23.721865Z","signature_b64":"9Dw8EcoxrLLdS2x/yh96hBu/516oL2holSaElKAjfq5NwH3A1cRE+E8+lcYB9tp+Rc/G8hdSQdFoTe7PLEidBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15f263f54dc43ab64b42bd941741d02597724e9156e714002f4308d8b9141380","last_reissued_at":"2026-06-05T01:14:23.721106Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:23.721106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Off-Diagonal Ramsey Multiplicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Elena Moss, Jonathan A. Noel","submitted_at":"2023-06-30T03:36:31Z","abstract_excerpt":"The Ramsey multiplicity problem asks for the minimum asymptotic density of monochromatic labelled copies of a graph $H$ in a red/blue colouring of the edges of $K_n$. We introduce an off-diagonal generalization in which the goal is to minimize a certain weighted sum of the densities of red copies of one graph and blue copies of another. We build up various properties of this new notion, including a useful \"dual formulation,\" and use these results to solve the problem for several pairs of graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17388","kind":"arxiv","version":2},"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/2306.17388/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":"2306.17388","created_at":"2026-06-05T01:14:23.721199+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17388v2","created_at":"2026-06-05T01:14:23.721199+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17388","created_at":"2026-06-05T01:14:23.721199+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXZGH5KNYQ5L","created_at":"2026-06-05T01:14:23.721199+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXZGH5KNYQ5LMS2C","created_at":"2026-06-05T01:14:23.721199+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXZGH5KN","created_at":"2026-06-05T01:14:23.721199+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/CXZGH5KNYQ5LMS2CXWKBOQOQEW","json":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW.json","graph_json":"https://pith.science/api/pith-number/CXZGH5KNYQ5LMS2CXWKBOQOQEW/graph.json","events_json":"https://pith.science/api/pith-number/CXZGH5KNYQ5LMS2CXWKBOQOQEW/events.json","paper":"https://pith.science/paper/CXZGH5KN"},"agent_actions":{"view_html":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW","download_json":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW.json","view_paper":"https://pith.science/paper/CXZGH5KN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17388&json=true","fetch_graph":"https://pith.science/api/pith-number/CXZGH5KNYQ5LMS2CXWKBOQOQEW/graph.json","fetch_events":"https://pith.science/api/pith-number/CXZGH5KNYQ5LMS2CXWKBOQOQEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW/action/storage_attestation","attest_author":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW/action/author_attestation","sign_citation":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW/action/citation_signature","submit_replication":"https://pith.science/pith/CXZGH5KNYQ5LMS2CXWKBOQOQEW/action/replication_record"}},"created_at":"2026-06-05T01:14:23.721199+00:00","updated_at":"2026-06-05T01:14:23.721199+00:00"}