{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2USPIUKNXSJFZYUPD3QN6S4QHY","short_pith_number":"pith:2USPIUKN","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"},"canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","source":{"kind":"arxiv","id":"1902.00259","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00259","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00259v2","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00259","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"2USPIUKNXSJF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2USPIUKNXSJFZYUP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2USPIUKN","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2USPIUKNXSJFZYUPD3QN6S4QHY","target":"record","payload":{"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"},"canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","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"},"source_kind":"arxiv","source_id":"1902.00259","source_version":2,"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-05-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDzmB2OMrKRKilQXe4qhNsNnaXGuhlUSXQB/Zq7MC9c/EH65ejYVaDjmUgOEdUKHEnDW6aMl9rs/zVMXlEP2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:03:10.086353Z"},"content_sha256":"fd063c80f858e0c0281559487a7f2420f665f8900a05bf0a1da1970e64f77444","schema_version":"1.0","event_id":"sha256:fd063c80f858e0c0281559487a7f2420f665f8900a05bf0a1da1970e64f77444"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2USPIUKNXSJFZYUPD3QN6S4QHY","target":"graph","payload":{"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"},"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-05-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecx8VvvIzWgbCJ3r84N59XXpiPzHQgOhtwIRKzAh6L/yUv1P0/d58qkOytyyNMgP984TKUdenQHwz9dCgdKtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T01:03:10.086962Z"},"content_sha256":"0b272c66cf8128d4d7cdb8be3b7bfa13d166d5c9831755b4074d8306e1bf210d","schema_version":"1.0","event_id":"sha256:0b272c66cf8128d4d7cdb8be3b7bfa13d166d5c9831755b4074d8306e1bf210d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/bundle.json","state_url":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/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-23T01:03:10Z","links":{"resolver":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY","bundle":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/bundle.json","state":"https://pith.science/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2USPIUKNXSJFZYUPD3QN6S4QHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2USPIUKNXSJFZYUPD3QN6S4QHY","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":"0b9df312f7e35286dc4663b27e0d8c3484daf494803eeb9c73cc0e43b6f74164","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T10:12:11Z","title_canon_sha256":"794092a7edac933b8e839c63bd98bbc9ce1edd130e169e1694fb5c923babf134"},"schema_version":"1.0","source":{"id":"1902.00259","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00259","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00259v2","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00259","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"2USPIUKNXSJF","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2USPIUKNXSJFZYUP","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2USPIUKN","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:0b272c66cf8128d4d7cdb8be3b7bfa13d166d5c9831755b4074d8306e1bf210d","target":"graph","created_at":"2026-05-17T23:52:50Z","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"},"paper":{"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","authors_text":"Amber Holmes, Dana Neidinger, Isaac Wass, Jesse Geneson, Xujun Liu, Yanitsa Pehova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T10:12:11Z","title":"Ramsey numbers of ordered graphs under graph operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00259","kind":"arxiv","version":2},"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:fd063c80f858e0c0281559487a7f2420f665f8900a05bf0a1da1970e64f77444","target":"record","created_at":"2026-05-17T23:52:50Z","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":"0b9df312f7e35286dc4663b27e0d8c3484daf494803eeb9c73cc0e43b6f74164","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-01T10:12:11Z","title_canon_sha256":"794092a7edac933b8e839c63bd98bbc9ce1edd130e169e1694fb5c923babf134"},"schema_version":"1.0","source":{"id":"1902.00259","kind":"arxiv","version":2}},"canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d524f4514dbc925ce28f1ee0df4b903e2730cf2b756632bbdca4d02dbe0728f5","first_computed_at":"2026-05-17T23:52:50.946059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:50.946059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j5zodeieH/ayPixKh747KzY51Ngjw898Y5QFTQWjto+oxIiwtnw/j+orL/arbaUxOYdHIisCJQJXw1sPeue6Bw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:50.946780Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00259","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd063c80f858e0c0281559487a7f2420f665f8900a05bf0a1da1970e64f77444","sha256:0b272c66cf8128d4d7cdb8be3b7bfa13d166d5c9831755b4074d8306e1bf210d"],"state_sha256":"b5e8bbef82c12c74be85ad2023e1761c9364a6628c6029d67e3cb22d00f9887b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zI5mbe0gdPUrK2TMa5SjelYFRlB7F6aQultdrahAB0RsDSHAsTTqTAoLwCd89n9gRdPyLN0OSFeVA4ftyeYaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T01:03:10.089783Z","bundle_sha256":"8f17560da6504bf0d4965313084b22638109c8af8e6b8c7d3939f86d15b215bb"}}