{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LDS63PWTCP37KMHMSAP3V3NBBX","short_pith_number":"pith:LDS63PWT","canonical_record":{"source":{"id":"2401.02360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-04T17:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"8c0dc9d971b400d02cb34135c8c13b68aa53f8647d4e69bb38d8db16b69ca227","abstract_canon_sha256":"ea9e3bc294a6d1e95930c8e5d12a446c9a49232ddd41d72ea767a2126b1bdeca"},"schema_version":"1.0"},"canonical_sha256":"58e5edbed313f7f530ec901fbaeda10de82eab67a0079e6a7d7ee2b5102e6271","source":{"kind":"arxiv","id":"2401.02360","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.02360","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"2401.02360v2","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02360","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"LDS63PWTCP37","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_16","alias_value":"LDS63PWTCP37KMHM","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_8","alias_value":"LDS63PWT","created_at":"2026-07-05T07:32:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LDS63PWTCP37KMHMSAP3V3NBBX","target":"record","payload":{"canonical_record":{"source":{"id":"2401.02360","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-04T17:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"8c0dc9d971b400d02cb34135c8c13b68aa53f8647d4e69bb38d8db16b69ca227","abstract_canon_sha256":"ea9e3bc294a6d1e95930c8e5d12a446c9a49232ddd41d72ea767a2126b1bdeca"},"schema_version":"1.0"},"canonical_sha256":"58e5edbed313f7f530ec901fbaeda10de82eab67a0079e6a7d7ee2b5102e6271","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:32:26.458148Z","signature_b64":"AjLwWkA5P05giFzzRRoVsMdATRhxJYBBwYpAEJKvKG/McsL5ixCJZqKVtFm/sN/iAdeJL2o5qtm2Wehx9hpNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58e5edbed313f7f530ec901fbaeda10de82eab67a0079e6a7d7ee2b5102e6271","last_reissued_at":"2026-07-05T07:32:26.457507Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:32:26.457507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.02360","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-07-05T07:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJQUHe7B27GrGxO6hZoYRcs8HzelVbO4z22NrxCm7g/Ui1Dru+xWLXSIjTSy9xUTamYU9T3ZYNG7mMut5gu7Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:16:27.818397Z"},"content_sha256":"17bfcfca29ab0aa7888882e3f1eee6e9e0c450c383113e594652fed6b530537b","schema_version":"1.0","event_id":"sha256:17bfcfca29ab0aa7888882e3f1eee6e9e0c450c383113e594652fed6b530537b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LDS63PWTCP37KMHMSAP3V3NBBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ordered Ramsey numbers of powers of paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Barnab\\'as Janzer, Oliver Janzer","submitted_at":"2024-01-04T17:00:01Z","abstract_excerpt":"Given two vertex-ordered graphs $G$ and $H$, the ordered Ramsey number $R_<(G,H)$ is the smallest $N$ such that whenever the edges of a vertex-ordered complete graph $K_N$ are red/blue-coloured, then there is a red (ordered) copy of $G$ or a blue (ordered) copy of $H$. Let $P_n^t$ denote the $t$-th power of a monotone path on $n$ vertices. The ordered Ramsey numbers of powers of paths have been extensively studied. We prove that there exists an absolute constant $C$ such that $R_<(K_s,P_n^t)\\leq R(K_s,K_t)^{C} \\cdot n$ holds for all $s,t,n$, which is tight up to the value of $C$. As a corollar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02360","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/2401.02360/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"},"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-07-05T07:32:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vs82kkldJlC1/jXrMr+8GpD5a3dTlAlP9Hk4as6hzprxUy770UsSbIjdIk2giXr1RXaEsUY4mRsnpPraG/uKAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T20:16:27.818944Z"},"content_sha256":"ab33d7ce0981c121e6f3e9e1ab8260e74a86aadd1e7eddcafb85bc22b01c4d64","schema_version":"1.0","event_id":"sha256:ab33d7ce0981c121e6f3e9e1ab8260e74a86aadd1e7eddcafb85bc22b01c4d64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LDS63PWTCP37KMHMSAP3V3NBBX/bundle.json","state_url":"https://pith.science/pith/LDS63PWTCP37KMHMSAP3V3NBBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LDS63PWTCP37KMHMSAP3V3NBBX/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-08-12T20:16:27Z","links":{"resolver":"https://pith.science/pith/LDS63PWTCP37KMHMSAP3V3NBBX","bundle":"https://pith.science/pith/LDS63PWTCP37KMHMSAP3V3NBBX/bundle.json","state":"https://pith.science/pith/LDS63PWTCP37KMHMSAP3V3NBBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LDS63PWTCP37KMHMSAP3V3NBBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LDS63PWTCP37KMHMSAP3V3NBBX","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":"ea9e3bc294a6d1e95930c8e5d12a446c9a49232ddd41d72ea767a2126b1bdeca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-04T17:00:01Z","title_canon_sha256":"8c0dc9d971b400d02cb34135c8c13b68aa53f8647d4e69bb38d8db16b69ca227"},"schema_version":"1.0","source":{"id":"2401.02360","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.02360","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"arxiv_version","alias_value":"2401.02360v2","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.02360","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_12","alias_value":"LDS63PWTCP37","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_16","alias_value":"LDS63PWTCP37KMHM","created_at":"2026-07-05T07:32:26Z"},{"alias_kind":"pith_short_8","alias_value":"LDS63PWT","created_at":"2026-07-05T07:32:26Z"}],"graph_snapshots":[{"event_id":"sha256:ab33d7ce0981c121e6f3e9e1ab8260e74a86aadd1e7eddcafb85bc22b01c4d64","target":"graph","created_at":"2026-07-05T07:32:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.02360/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given two vertex-ordered graphs $G$ and $H$, the ordered Ramsey number $R_<(G,H)$ is the smallest $N$ such that whenever the edges of a vertex-ordered complete graph $K_N$ are red/blue-coloured, then there is a red (ordered) copy of $G$ or a blue (ordered) copy of $H$. Let $P_n^t$ denote the $t$-th power of a monotone path on $n$ vertices. The ordered Ramsey numbers of powers of paths have been extensively studied. We prove that there exists an absolute constant $C$ such that $R_<(K_s,P_n^t)\\leq R(K_s,K_t)^{C} \\cdot n$ holds for all $s,t,n$, which is tight up to the value of $C$. As a corollar","authors_text":"Ant\\'onio Gir\\~ao, Barnab\\'as Janzer, Oliver Janzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-04T17:00:01Z","title":"Ordered Ramsey numbers of powers of paths"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.02360","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:17bfcfca29ab0aa7888882e3f1eee6e9e0c450c383113e594652fed6b530537b","target":"record","created_at":"2026-07-05T07:32:26Z","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":"ea9e3bc294a6d1e95930c8e5d12a446c9a49232ddd41d72ea767a2126b1bdeca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-01-04T17:00:01Z","title_canon_sha256":"8c0dc9d971b400d02cb34135c8c13b68aa53f8647d4e69bb38d8db16b69ca227"},"schema_version":"1.0","source":{"id":"2401.02360","kind":"arxiv","version":2}},"canonical_sha256":"58e5edbed313f7f530ec901fbaeda10de82eab67a0079e6a7d7ee2b5102e6271","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58e5edbed313f7f530ec901fbaeda10de82eab67a0079e6a7d7ee2b5102e6271","first_computed_at":"2026-07-05T07:32:26.457507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:32:26.457507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AjLwWkA5P05giFzzRRoVsMdATRhxJYBBwYpAEJKvKG/McsL5ixCJZqKVtFm/sN/iAdeJL2o5qtm2Wehx9hpNDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:32:26.458148Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.02360","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17bfcfca29ab0aa7888882e3f1eee6e9e0c450c383113e594652fed6b530537b","sha256:ab33d7ce0981c121e6f3e9e1ab8260e74a86aadd1e7eddcafb85bc22b01c4d64"],"state_sha256":"ed50b00f1a0c1a44225f3c3f1f72876b828d2b0c548a8c34b9508ba99db956d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Ae3wUd4hYMncQ4bP0b3PebWONrpsOT4e8bs/p9NIWrmKp5INBkImL1cFFrJMMgLKfW+RsXKmqYso58z9ZVfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T20:16:27.824372Z","bundle_sha256":"ff919a2ac0abb30ca80b088d8a32345665050f759b44db89bf2209a9111708e7"}}