{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2USPIUKNXSJFZYUPD3QN6S4QHY","short_pith_number":"pith:2USPIUKN","schema_version":"1.0","canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","source":{"kind":"arxiv","id":"1902.00259","version":2},"attestation_state":"computed","paper":{"title":"Ramsey numbers of ordered graphs under graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amber Holmes, Dana Neidinger, Isaac Wass, Jesse Geneson, Xujun Liu, Yanitsa Pehova","submitted_at":"2019-02-01T10:12:11Z","abstract_excerpt":"An ordered graph $\\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph on $N$ vertices has a monochromatic copy of $\\mathcal{G}$ that respects the ordering. In this paper we investigate the effect of various graph operations on the Ramsey number of a given ordered graph, and detail a general framework for applying results on extremal functions of 0-1 matrices to ordered Ramsey problems. We apply this method to give upper bounds"},"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":"1902.00259","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T10:12:11Z","cross_cats_sorted":[],"title_canon_sha256":"794092a7edac933b8e839c63bd98bbc9ce1edd130e169e1694fb5c923babf134","abstract_canon_sha256":"0b9df312f7e35286dc4663b27e0d8c3484daf494803eeb9c73cc0e43b6f74164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.946780Z","signature_b64":"j5zodeieH/ayPixKh747KzY51Ngjw898Y5QFTQWjto+oxIiwtnw/j+orL/arbaUxOYdHIisCJQJXw1sPeue6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","last_reissued_at":"2026-05-17T23:52:50.946059Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.946059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey numbers of ordered graphs under graph operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amber Holmes, Dana Neidinger, Isaac Wass, Jesse Geneson, Xujun Liu, Yanitsa Pehova","submitted_at":"2019-02-01T10:12:11Z","abstract_excerpt":"An ordered graph $\\mathcal{G}$ is a simple graph together with a total ordering on its vertices. The (2-color) Ramsey number of $\\mathcal{G}$ is the smallest integer $N$ such that every 2-coloring of the edges of the complete ordered graph on $N$ vertices has a monochromatic copy of $\\mathcal{G}$ that respects the ordering. In this paper we investigate the effect of various graph operations on the Ramsey number of a given ordered graph, and detail a general framework for applying results on extremal functions of 0-1 matrices to ordered Ramsey problems. We apply this method to give upper bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00259","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":""},"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":"1902.00259","created_at":"2026-05-17T23:52:50.946178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00259v2","created_at":"2026-05-17T23:52:50.946178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00259","created_at":"2026-05-17T23:52:50.946178+00:00"},{"alias_kind":"pith_short_12","alias_value":"2USPIUKNXSJF","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2USPIUKNXSJFZYUP","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2USPIUKN","created_at":"2026-05-18T12:33:07.085635+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/2USPIUKNXSJFZYUPD3QN6S4QHY","json":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY.json","graph_json":"https://pith.science/api/pith-number/2USPIUKNXSJFZYUPD3QN6S4QHY/graph.json","events_json":"https://pith.science/api/pith-number/2USPIUKNXSJFZYUPD3QN6S4QHY/events.json","paper":"https://pith.science/paper/2USPIUKN"},"agent_actions":{"view_html":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY","download_json":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY.json","view_paper":"https://pith.science/paper/2USPIUKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00259&json=true","fetch_graph":"https://pith.science/api/pith-number/2USPIUKNXSJFZYUPD3QN6S4QHY/graph.json","fetch_events":"https://pith.science/api/pith-number/2USPIUKNXSJFZYUPD3QN6S4QHY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/action/storage_attestation","attest_author":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/action/author_attestation","sign_citation":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/action/citation_signature","submit_replication":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/action/replication_record"}},"created_at":"2026-05-17T23:52:50.946178+00:00","updated_at":"2026-05-17T23:52:50.946178+00:00"}