{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:23CTWRJSFBKBREY2K5YE7GPRJC","short_pith_number":"pith:23CTWRJS","schema_version":"1.0","canonical_sha256":"d6c53b4532285418931a57704f99f148a41c1948396dc1330978390d070a5f20","source":{"kind":"arxiv","id":"1906.08234","version":2},"attestation_state":"computed","paper":{"title":"On edge-ordered Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Ray Li","submitted_at":"2019-06-19T17:34:10Z","abstract_excerpt":"An edge-ordered graph is a graph with a linear ordering of its edges. Two edge-ordered graphs are equivalent if their is an isomorphism between them preserving the ordering of the edges. The edge-ordered Ramsey number $r_{edge}(H; q)$ of an edge-ordered graph $H$ is the smallest $N$ such that there exists an edge-ordered graph $G$ on $N$ vertices such that, for every $q$-coloring of the edges of $G$, there is a monochromatic subgraph of $G$ equivalent to $H$. Recently, Balko and Vizer announced that $r_{edge}(H;q)$ exists. However, their proof uses the Graham-Rothschild theorem and consequentl"},"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":"1906.08234","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-19T17:34:10Z","cross_cats_sorted":[],"title_canon_sha256":"a37ae02522992434bfda8a97409f5cb9b02b6d012d2d47e6d278284deda41eaf","abstract_canon_sha256":"8a9f63c8b9c8b0cd1c0c84f195bf21f28fa1451e438da4928421447b5421c3a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:57.908175Z","signature_b64":"2RwjXQXnMbyaNmzNSBnc/YZv9GXKW+ChrKntAoGuXeyWUevnXwjP7wXh2N6H8o68XmKWi8ID362trpFii30aDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6c53b4532285418931a57704f99f148a41c1948396dc1330978390d070a5f20","last_reissued_at":"2026-07-04T23:58:57.907770Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:57.907770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On edge-ordered Ramsey numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jacob Fox, Ray Li","submitted_at":"2019-06-19T17:34:10Z","abstract_excerpt":"An edge-ordered graph is a graph with a linear ordering of its edges. Two edge-ordered graphs are equivalent if their is an isomorphism between them preserving the ordering of the edges. The edge-ordered Ramsey number $r_{edge}(H; q)$ of an edge-ordered graph $H$ is the smallest $N$ such that there exists an edge-ordered graph $G$ on $N$ vertices such that, for every $q$-coloring of the edges of $G$, there is a monochromatic subgraph of $G$ equivalent to $H$. Recently, Balko and Vizer announced that $r_{edge}(H;q)$ exists. However, their proof uses the Graham-Rothschild theorem and consequentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08234","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/1906.08234/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":"1906.08234","created_at":"2026-07-04T23:58:57.907827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.08234v2","created_at":"2026-07-04T23:58:57.907827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08234","created_at":"2026-07-04T23:58:57.907827+00:00"},{"alias_kind":"pith_short_12","alias_value":"23CTWRJSFBKB","created_at":"2026-07-04T23:58:57.907827+00:00"},{"alias_kind":"pith_short_16","alias_value":"23CTWRJSFBKBREY2","created_at":"2026-07-04T23:58:57.907827+00:00"},{"alias_kind":"pith_short_8","alias_value":"23CTWRJS","created_at":"2026-07-04T23:58:57.907827+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/23CTWRJSFBKBREY2K5YE7GPRJC","json":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC.json","graph_json":"https://pith.science/api/pith-number/23CTWRJSFBKBREY2K5YE7GPRJC/graph.json","events_json":"https://pith.science/api/pith-number/23CTWRJSFBKBREY2K5YE7GPRJC/events.json","paper":"https://pith.science/paper/23CTWRJS"},"agent_actions":{"view_html":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC","download_json":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC.json","view_paper":"https://pith.science/paper/23CTWRJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.08234&json=true","fetch_graph":"https://pith.science/api/pith-number/23CTWRJSFBKBREY2K5YE7GPRJC/graph.json","fetch_events":"https://pith.science/api/pith-number/23CTWRJSFBKBREY2K5YE7GPRJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC/action/storage_attestation","attest_author":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC/action/author_attestation","sign_citation":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC/action/citation_signature","submit_replication":"https://pith.science/pith/23CTWRJSFBKBREY2K5YE7GPRJC/action/replication_record"}},"created_at":"2026-07-04T23:58:57.907827+00:00","updated_at":"2026-07-04T23:58:57.907827+00:00"}