{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FPQ5RGVSP64ALFAAEWWH2E62HN","short_pith_number":"pith:FPQ5RGVS","schema_version":"1.0","canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","source":{"kind":"arxiv","id":"1807.05038","version":1},"attestation_state":"computed","paper":{"title":"On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas B. West, Pawel Pralat, Xavier Perez-Gimenez","submitted_at":"2018-07-13T12:37:09Z","abstract_excerpt":"An ordered hypergraph is a hypergraph $H$ with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph $G$ in $H$ must respect the specified order on $V(G)$. In on-line Ramsey theory, Builder iteratively presents edges that Painter must immediately color. The $t$-color on-line size Ramsey number $\\tilde R_t (G)$ of an ordered hypergraph $G$ is the minimum number of edges Builder needs to play (on a large ordered set of vertices) to force Painter using $t$ colors to produce a monochromatic copy of $G$. The monotone tight path $P_r^{(k)}$ is the ordered hypergrap"},"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":"1807.05038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:37:09Z","cross_cats_sorted":[],"title_canon_sha256":"8ad81982ee89e33f687587fe54bc56ed09754f546820a3714194835e26e2027b","abstract_canon_sha256":"586b7366ba9486cbc081c77c6b7bfd574d8cb72accb248c3c8822ea651ddb821"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:49.186626Z","signature_b64":"d89koJKvO2/8zdn/nPWLe+akarxeGhNJRkrXkGFLCydT6kPZ8ghGlf3xj9EGR2Iy+pyMM/zhQ0EFSMsm4dOSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","last_reissued_at":"2026-05-18T00:10:49.185786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:49.185786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Douglas B. West, Pawel Pralat, Xavier Perez-Gimenez","submitted_at":"2018-07-13T12:37:09Z","abstract_excerpt":"An ordered hypergraph is a hypergraph $H$ with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph $G$ in $H$ must respect the specified order on $V(G)$. In on-line Ramsey theory, Builder iteratively presents edges that Painter must immediately color. The $t$-color on-line size Ramsey number $\\tilde R_t (G)$ of an ordered hypergraph $G$ is the minimum number of edges Builder needs to play (on a large ordered set of vertices) to force Painter using $t$ colors to produce a monochromatic copy of $G$. The monotone tight path $P_r^{(k)}$ is the ordered hypergrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05038","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.05038","created_at":"2026-05-18T00:10:49.185928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05038v1","created_at":"2026-05-18T00:10:49.185928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05038","created_at":"2026-05-18T00:10:49.185928+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPQ5RGVSP64A","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPQ5RGVSP64ALFAA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPQ5RGVS","created_at":"2026-05-18T12:32:25.280505+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/FPQ5RGVSP64ALFAAEWWH2E62HN","json":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN.json","graph_json":"https://pith.science/api/pith-number/FPQ5RGVSP64ALFAAEWWH2E62HN/graph.json","events_json":"https://pith.science/api/pith-number/FPQ5RGVSP64ALFAAEWWH2E62HN/events.json","paper":"https://pith.science/paper/FPQ5RGVS"},"agent_actions":{"view_html":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN","download_json":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN.json","view_paper":"https://pith.science/paper/FPQ5RGVS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05038&json=true","fetch_graph":"https://pith.science/api/pith-number/FPQ5RGVSP64ALFAAEWWH2E62HN/graph.json","fetch_events":"https://pith.science/api/pith-number/FPQ5RGVSP64ALFAAEWWH2E62HN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/action/storage_attestation","attest_author":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/action/author_attestation","sign_citation":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/action/citation_signature","submit_replication":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/action/replication_record"}},"created_at":"2026-05-18T00:10:49.185928+00:00","updated_at":"2026-05-18T00:10:49.185928+00:00"}