{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FPQ5RGVSP64ALFAAEWWH2E62HN","short_pith_number":"pith:FPQ5RGVS","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"},"canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","source":{"kind":"arxiv","id":"1807.05038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05038","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05038v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05038","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"FPQ5RGVSP64A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPQ5RGVSP64ALFAA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPQ5RGVS","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FPQ5RGVSP64ALFAAEWWH2E62HN","target":"record","payload":{"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"},"canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","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"},"source_kind":"arxiv","source_id":"1807.05038","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:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUQbeiebIFZtY/6t5ftJqQNWYham6I0+khdYeWMQYPBClJ8tyNw443AIoxGsWKMFkkcTqv/gsxAZwuQBjZewCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:28.574581Z"},"content_sha256":"cc3fb4760071485d33db682e45c3715e699db95f37e0095c2ade7070ec7b4434","schema_version":"1.0","event_id":"sha256:cc3fb4760071485d33db682e45c3715e699db95f37e0095c2ade7070ec7b4434"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FPQ5RGVSP64ALFAAEWWH2E62HN","target":"graph","payload":{"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"},"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:10:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MN8z0FKACfTHsvbWjRfYu2C3D7jwPIhdoKezk6VkGQgcyCq+kby29BSl0hnQMvVEYV8e9i8C5TnbtqOFCwI4AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:28.574935Z"},"content_sha256":"8f0a5a46b0d346e07f0f70c7d851c97d6562cfd0a303e391580e4e9d8dd3dead","schema_version":"1.0","event_id":"sha256:8f0a5a46b0d346e07f0f70c7d851c97d6562cfd0a303e391580e4e9d8dd3dead"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/bundle.json","state_url":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/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-05T21:09:28Z","links":{"resolver":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN","bundle":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/bundle.json","state":"https://pith.science/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPQ5RGVSP64ALFAAEWWH2E62HN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FPQ5RGVSP64ALFAAEWWH2E62HN","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":"586b7366ba9486cbc081c77c6b7bfd574d8cb72accb248c3c8822ea651ddb821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:37:09Z","title_canon_sha256":"8ad81982ee89e33f687587fe54bc56ed09754f546820a3714194835e26e2027b"},"schema_version":"1.0","source":{"id":"1807.05038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05038","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05038v1","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05038","created_at":"2026-05-18T00:10:49Z"},{"alias_kind":"pith_short_12","alias_value":"FPQ5RGVSP64A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FPQ5RGVSP64ALFAA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FPQ5RGVS","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:8f0a5a46b0d346e07f0f70c7d851c97d6562cfd0a303e391580e4e9d8dd3dead","target":"graph","created_at":"2026-05-18T00:10:49Z","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 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","authors_text":"Douglas B. West, Pawel Pralat, Xavier Perez-Gimenez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:37:09Z","title":"On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05038","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:cc3fb4760071485d33db682e45c3715e699db95f37e0095c2ade7070ec7b4434","target":"record","created_at":"2026-05-18T00:10:49Z","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":"586b7366ba9486cbc081c77c6b7bfd574d8cb72accb248c3c8822ea651ddb821","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-13T12:37:09Z","title_canon_sha256":"8ad81982ee89e33f687587fe54bc56ed09754f546820a3714194835e26e2027b"},"schema_version":"1.0","source":{"id":"1807.05038","kind":"arxiv","version":1}},"canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2be1d89ab27fb805940025ac7d13da3b5d7f7121a27d44f606bebea1292ebd46","first_computed_at":"2026-05-18T00:10:49.185786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:49.185786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d89koJKvO2/8zdn/nPWLe+akarxeGhNJRkrXkGFLCydT6kPZ8ghGlf3xj9EGR2Iy+pyMM/zhQ0EFSMsm4dOSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:49.186626Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc3fb4760071485d33db682e45c3715e699db95f37e0095c2ade7070ec7b4434","sha256:8f0a5a46b0d346e07f0f70c7d851c97d6562cfd0a303e391580e4e9d8dd3dead"],"state_sha256":"ffe40dbc323ec5f19d43afbe08f76c428b996357375323848bd86df1feb89382"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uOvLDudYVwPk4krOfa7YPUA7B3LcvqFhDeaNacNfEmrmgshRZ4LQ+SuE4mQT4nG0QK9tzJ1zJ65ZVBNnEHcpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:09:28.577435Z","bundle_sha256":"40902df4794d83204e6972f2a6e9f9f0cc636a20c059a9470a1308d454a04b2d"}}