{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LOTSAHNE3UNQV6P364BOTCPFVL","short_pith_number":"pith:LOTSAHNE","canonical_record":{"source":{"id":"1808.04025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T00:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"b4e10cfe2971b2a78c30a79b31ad95c418149564a9373e3f9625e299e0c39e4e","abstract_canon_sha256":"20cabbff5fce7c60723916a79586ddab687c93c79c7dc79a9bf09b37b919e440"},"schema_version":"1.0"},"canonical_sha256":"5ba7201da4dd1b0af9fbf702e989e5aaf9c58219b0039a237bbafd2d86fd7554","source":{"kind":"arxiv","id":"1808.04025","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04025","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04025v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04025","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"LOTSAHNE3UNQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOTSAHNE3UNQV6P3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOTSAHNE","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LOTSAHNE3UNQV6P364BOTCPFVL","target":"record","payload":{"canonical_record":{"source":{"id":"1808.04025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T00:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"b4e10cfe2971b2a78c30a79b31ad95c418149564a9373e3f9625e299e0c39e4e","abstract_canon_sha256":"20cabbff5fce7c60723916a79586ddab687c93c79c7dc79a9bf09b37b919e440"},"schema_version":"1.0"},"canonical_sha256":"5ba7201da4dd1b0af9fbf702e989e5aaf9c58219b0039a237bbafd2d86fd7554","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.059791Z","signature_b64":"n0Y4n276gwk/yFxfV/Bbz5i9FQmYsIcL4EdEybs6tNNqU6tpK5Uaiw3xBHNMWDFB+iRbpGTPx1ZpeZDrZOMFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba7201da4dd1b0af9fbf702e989e5aaf9c58219b0039a237bbafd2d86fd7554","last_reissued_at":"2026-05-18T00:08:19.059264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.059264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.04025","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-05-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AZExD6U+RXI95yjiOOJye4T4l1KHRgg9nd5ZLI/64oDC68n21BWrSKZrP9Ty/I5YIS+5M0G+EKas3BPPtj+WCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:14:49.478573Z"},"content_sha256":"f4e3d350e206d84f608aca20fc1e26c194d5ae5625fa65a4517fd9b08cfe6a14","schema_version":"1.0","event_id":"sha256:f4e3d350e206d84f608aca20fc1e26c194d5ae5625fa65a4517fd9b08cfe6a14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LOTSAHNE3UNQV6P364BOTCPFVL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Off-diagonal ordered Ramsey numbers of matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Rohatgi","submitted_at":"2018-08-13T00:00:52Z","abstract_excerpt":"For ordered graphs $G$ and $H$, the ordered Ramsey number $r_<(G,H)$ is the smallest $n$ such that every red/blue edge coloring of the complete graph on vertices $\\{1,\\dots,n\\}$ contains either a blue copy of $G$ or a red copy of $H$, where the embedding must preserve the relative order of vertices. One number of interest, first studied by Conlon, Fox, Lee, and Sudakov, is the \"off-diagonal\" ordered Ramsey number $r_<(M, K_3)$, where $M$ is an ordered matching on $n$ vertices. In particular, Conlon et al. asked what asymptotic bounds (in $n$) can be obtained for $\\max r_<(M, K_3)$, where the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04025","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":""},"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-18T00:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MYLO0ixDoj5Ntt4QRGFMijs7pvzZ89GHbNJY7XAGRRAufM7WiZMj3F0eb4E6Bwh4oWQS8Ncxt2Lf+kpUGb67Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:14:49.478932Z"},"content_sha256":"1392c8d98a4d801377a555b807849a8345a5c18898b40d6740dbd07fac3e667a","schema_version":"1.0","event_id":"sha256:1392c8d98a4d801377a555b807849a8345a5c18898b40d6740dbd07fac3e667a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LOTSAHNE3UNQV6P364BOTCPFVL/bundle.json","state_url":"https://pith.science/pith/LOTSAHNE3UNQV6P364BOTCPFVL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LOTSAHNE3UNQV6P364BOTCPFVL/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-05-27T16:14:49Z","links":{"resolver":"https://pith.science/pith/LOTSAHNE3UNQV6P364BOTCPFVL","bundle":"https://pith.science/pith/LOTSAHNE3UNQV6P364BOTCPFVL/bundle.json","state":"https://pith.science/pith/LOTSAHNE3UNQV6P364BOTCPFVL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LOTSAHNE3UNQV6P364BOTCPFVL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LOTSAHNE3UNQV6P364BOTCPFVL","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":"20cabbff5fce7c60723916a79586ddab687c93c79c7dc79a9bf09b37b919e440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T00:00:52Z","title_canon_sha256":"b4e10cfe2971b2a78c30a79b31ad95c418149564a9373e3f9625e299e0c39e4e"},"schema_version":"1.0","source":{"id":"1808.04025","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04025","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04025v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04025","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"LOTSAHNE3UNQ","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LOTSAHNE3UNQV6P3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LOTSAHNE","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:1392c8d98a4d801377a555b807849a8345a5c18898b40d6740dbd07fac3e667a","target":"graph","created_at":"2026-05-18T00:08:19Z","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":"For ordered graphs $G$ and $H$, the ordered Ramsey number $r_<(G,H)$ is the smallest $n$ such that every red/blue edge coloring of the complete graph on vertices $\\{1,\\dots,n\\}$ contains either a blue copy of $G$ or a red copy of $H$, where the embedding must preserve the relative order of vertices. One number of interest, first studied by Conlon, Fox, Lee, and Sudakov, is the \"off-diagonal\" ordered Ramsey number $r_<(M, K_3)$, where $M$ is an ordered matching on $n$ vertices. In particular, Conlon et al. asked what asymptotic bounds (in $n$) can be obtained for $\\max r_<(M, K_3)$, where the m","authors_text":"Dhruv Rohatgi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T00:00:52Z","title":"Off-diagonal ordered Ramsey numbers of matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04025","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:f4e3d350e206d84f608aca20fc1e26c194d5ae5625fa65a4517fd9b08cfe6a14","target":"record","created_at":"2026-05-18T00:08:19Z","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":"20cabbff5fce7c60723916a79586ddab687c93c79c7dc79a9bf09b37b919e440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-13T00:00:52Z","title_canon_sha256":"b4e10cfe2971b2a78c30a79b31ad95c418149564a9373e3f9625e299e0c39e4e"},"schema_version":"1.0","source":{"id":"1808.04025","kind":"arxiv","version":1}},"canonical_sha256":"5ba7201da4dd1b0af9fbf702e989e5aaf9c58219b0039a237bbafd2d86fd7554","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ba7201da4dd1b0af9fbf702e989e5aaf9c58219b0039a237bbafd2d86fd7554","first_computed_at":"2026-05-18T00:08:19.059264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.059264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n0Y4n276gwk/yFxfV/Bbz5i9FQmYsIcL4EdEybs6tNNqU6tpK5Uaiw3xBHNMWDFB+iRbpGTPx1ZpeZDrZOMFDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.059791Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04025","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4e3d350e206d84f608aca20fc1e26c194d5ae5625fa65a4517fd9b08cfe6a14","sha256:1392c8d98a4d801377a555b807849a8345a5c18898b40d6740dbd07fac3e667a"],"state_sha256":"2abbfc9cdaf6702a3f39fde3d4008b6ab01146cbdaac10d07513a458f6685940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z24Sxl6ajQ3vDNe7ozF6sO/BT9CUqSbaCIeRi+J/ROcE69fRg5CnPPa7Q3okm1UIhVyiTiAhzsQ7YXg2m3vQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:14:49.482081Z","bundle_sha256":"32fc1ba1a84eec9bd06a908806f982af31ff8c09bfa58ba28286ede9702633b6"}}