{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QDVMIIWKCD7GCVPRF2OB4LAORA","short_pith_number":"pith:QDVMIIWK","schema_version":"1.0","canonical_sha256":"80eac422ca10fe6155f12e9c1e2c0e882c48568e72018eed0b4c9105ed6c3949","source":{"kind":"arxiv","id":"2608.02299","version":1},"attestation_state":"computed","paper":{"title":"Ramsey multiplicity for ordered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Wei, Mengya He, Qinghong Zhao, Yaping Mao","submitted_at":"2026-08-03T14:25:23Z","abstract_excerpt":"Let \\(\\cG_1,\\ldots,\\cG_k\\) be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number \\(\\oR(\\cG_1,\\ldots,\\cG_k)\\) is the least integer \\(N\\) such that every \\(k\\)-edge-coloring of the ordered complete graph \\(\\cK_N\\) contains an order-preserving copy of \\(\\cG_i\\) in color \\(i\\) for some \\(i\\in[k]\\). For positive weights \\(\\blambda=(\\lambda_1,\\ldots,\\lambda_k)\\), let \\(\\oM_{\\blambda}(n;\\cG_1,\\ldots,\\cG_k)\\) denote the minimum weighted number of correctly colored, order-preserving copies of the target graphs over all \\(k\\)-edge-colorings of \\(\\cK_n\\). When \\(\\bl"},"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":"2608.02299","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-03T14:25:23Z","cross_cats_sorted":[],"title_canon_sha256":"1ce2f4d55d8703959e7a479c9fe64f03f0f66af37868aacd2f0fd2493cf1acfa","abstract_canon_sha256":"7cac1c9c8f356abd6f05c8e3276b7c458b061eaaad5c08e7a2624e39aaceab33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:11:45.981090Z","signature_b64":"5zqbv7w31K/nfr8xGFPYNyIHGNWR0rBRvGew3pZlzmFALQvVUJPYbRriFZxkQ0F3QAMqsRhrv4hlNB3ydfx2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80eac422ca10fe6155f12e9c1e2c0e882c48568e72018eed0b4c9105ed6c3949","last_reissued_at":"2026-08-04T02:11:45.979385Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:11:45.979385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey multiplicity for ordered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Wei, Mengya He, Qinghong Zhao, Yaping Mao","submitted_at":"2026-08-03T14:25:23Z","abstract_excerpt":"Let \\(\\cG_1,\\ldots,\\cG_k\\) be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number \\(\\oR(\\cG_1,\\ldots,\\cG_k)\\) is the least integer \\(N\\) such that every \\(k\\)-edge-coloring of the ordered complete graph \\(\\cK_N\\) contains an order-preserving copy of \\(\\cG_i\\) in color \\(i\\) for some \\(i\\in[k]\\). For positive weights \\(\\blambda=(\\lambda_1,\\ldots,\\lambda_k)\\), let \\(\\oM_{\\blambda}(n;\\cG_1,\\ldots,\\cG_k)\\) denote the minimum weighted number of correctly colored, order-preserving copies of the target graphs over all \\(k\\)-edge-colorings of \\(\\cK_n\\). When \\(\\bl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.02299","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/2608.02299/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":"2608.02299","created_at":"2026-08-04T02:11:45.980948+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.02299v1","created_at":"2026-08-04T02:11:45.980948+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.02299","created_at":"2026-08-04T02:11:45.980948+00:00"},{"alias_kind":"pith_short_12","alias_value":"QDVMIIWKCD7G","created_at":"2026-08-04T02:11:45.980948+00:00"},{"alias_kind":"pith_short_16","alias_value":"QDVMIIWKCD7GCVPR","created_at":"2026-08-04T02:11:45.980948+00:00"},{"alias_kind":"pith_short_8","alias_value":"QDVMIIWK","created_at":"2026-08-04T02:11:45.980948+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/QDVMIIWKCD7GCVPRF2OB4LAORA","json":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA.json","graph_json":"https://pith.science/api/pith-number/QDVMIIWKCD7GCVPRF2OB4LAORA/graph.json","events_json":"https://pith.science/api/pith-number/QDVMIIWKCD7GCVPRF2OB4LAORA/events.json","paper":"https://pith.science/paper/QDVMIIWK"},"agent_actions":{"view_html":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA","download_json":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA.json","view_paper":"https://pith.science/paper/QDVMIIWK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.02299&json=true","fetch_graph":"https://pith.science/api/pith-number/QDVMIIWKCD7GCVPRF2OB4LAORA/graph.json","fetch_events":"https://pith.science/api/pith-number/QDVMIIWKCD7GCVPRF2OB4LAORA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA/action/storage_attestation","attest_author":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA/action/author_attestation","sign_citation":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA/action/citation_signature","submit_replication":"https://pith.science/pith/QDVMIIWKCD7GCVPRF2OB4LAORA/action/replication_record"}},"created_at":"2026-08-04T02:11:45.980948+00:00","updated_at":"2026-08-04T02:11:45.980948+00:00"}