{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JAX3PFN6D2WWEO74IMW5K7XRXH","short_pith_number":"pith:JAX3PFN6","canonical_record":{"source":{"id":"1712.09034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T07:57:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cdcc47b5f25abf84154526ecfe066e5ce2f80a8f4681d025d4c8d4f73994c3a9","abstract_canon_sha256":"1a1de4d62d6181e9fbbf5e72b86f81c84fac2c0a2d1a4c015112f5e5746b9b9b"},"schema_version":"1.0"},"canonical_sha256":"482fb795be1ead623bfc432dd57ef1b9dc1ff8a6587a90526a713e12d382a008","source":{"kind":"arxiv","id":"1712.09034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09034","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09034v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09034","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"JAX3PFN6D2WW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAX3PFN6D2WWEO74","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAX3PFN6","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JAX3PFN6D2WWEO74IMW5K7XRXH","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T07:57:34Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"cdcc47b5f25abf84154526ecfe066e5ce2f80a8f4681d025d4c8d4f73994c3a9","abstract_canon_sha256":"1a1de4d62d6181e9fbbf5e72b86f81c84fac2c0a2d1a4c015112f5e5746b9b9b"},"schema_version":"1.0"},"canonical_sha256":"482fb795be1ead623bfc432dd57ef1b9dc1ff8a6587a90526a713e12d382a008","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:14.577105Z","signature_b64":"p1chyml5BmMRegVngyV/SBI6l4hWgS7aVpo0y1MNFKSybNIMAESFN3qReizANGgjGGxSADvM5IBIhLAAqvwDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"482fb795be1ead623bfc432dd57ef1b9dc1ff8a6587a90526a713e12d382a008","last_reissued_at":"2026-05-18T00:27:14.576638Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:14.576638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09034","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:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MgGNfgTsRXMoZnqMp39GsjOalwzBbznYSuZPdmMw6UIGQ/7EcHZm3zpXHZOq2pUj69kE17KrAvqEw1YuHrYqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:08:12.344699Z"},"content_sha256":"61114998aa1ece4e277010842d481b9153915e6882e613890b67493395bb8e24","schema_version":"1.0","event_id":"sha256:61114998aa1ece4e277010842d481b9153915e6882e613890b67493395bb8e24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JAX3PFN6D2WWEO74IMW5K7XRXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Ordered Ramsey Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jonathan Rollin","submitted_at":"2017-12-25T07:57:34Z","abstract_excerpt":"An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H') of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all edges colored red or a copy of H' with all edges colored blue. Such an ordered Ramsey graph is minimal if neither of its proper subgraphs is an ordered Ramsey graph of (H,H'). If H=H' then H itself is call"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09034","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:27:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXoS8ihEHUmneNWeuOpRSCl3YopaxBHnXO1ogv9tRJYuotSAdSQDnWAivm8g0asYuNTjpvhyaoAmgDcL1f00CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T20:08:12.345541Z"},"content_sha256":"ff90bc3ab501a59c66d0f3d3e15a170f17dd7ea2826f7ae33986669a87b40ae1","schema_version":"1.0","event_id":"sha256:ff90bc3ab501a59c66d0f3d3e15a170f17dd7ea2826f7ae33986669a87b40ae1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/bundle.json","state_url":"https://pith.science/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/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-05T20:08:12Z","links":{"resolver":"https://pith.science/pith/JAX3PFN6D2WWEO74IMW5K7XRXH","bundle":"https://pith.science/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/bundle.json","state":"https://pith.science/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JAX3PFN6D2WWEO74IMW5K7XRXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JAX3PFN6D2WWEO74IMW5K7XRXH","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":"1a1de4d62d6181e9fbbf5e72b86f81c84fac2c0a2d1a4c015112f5e5746b9b9b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T07:57:34Z","title_canon_sha256":"cdcc47b5f25abf84154526ecfe066e5ce2f80a8f4681d025d4c8d4f73994c3a9"},"schema_version":"1.0","source":{"id":"1712.09034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09034","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09034v1","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09034","created_at":"2026-05-18T00:27:14Z"},{"alias_kind":"pith_short_12","alias_value":"JAX3PFN6D2WW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"JAX3PFN6D2WWEO74","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"JAX3PFN6","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:ff90bc3ab501a59c66d0f3d3e15a170f17dd7ea2826f7ae33986669a87b40ae1","target":"graph","created_at":"2026-05-18T00:27:14Z","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 graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H') of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all edges colored red or a copy of H' with all edges colored blue. Such an ordered Ramsey graph is minimal if neither of its proper subgraphs is an ordered Ramsey graph of (H,H'). If H=H' then H itself is call","authors_text":"Jonathan Rollin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T07:57:34Z","title":"Minimal Ordered Ramsey Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09034","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:61114998aa1ece4e277010842d481b9153915e6882e613890b67493395bb8e24","target":"record","created_at":"2026-05-18T00:27:14Z","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":"1a1de4d62d6181e9fbbf5e72b86f81c84fac2c0a2d1a4c015112f5e5746b9b9b","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-25T07:57:34Z","title_canon_sha256":"cdcc47b5f25abf84154526ecfe066e5ce2f80a8f4681d025d4c8d4f73994c3a9"},"schema_version":"1.0","source":{"id":"1712.09034","kind":"arxiv","version":1}},"canonical_sha256":"482fb795be1ead623bfc432dd57ef1b9dc1ff8a6587a90526a713e12d382a008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"482fb795be1ead623bfc432dd57ef1b9dc1ff8a6587a90526a713e12d382a008","first_computed_at":"2026-05-18T00:27:14.576638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:14.576638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p1chyml5BmMRegVngyV/SBI6l4hWgS7aVpo0y1MNFKSybNIMAESFN3qReizANGgjGGxSADvM5IBIhLAAqvwDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:14.577105Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61114998aa1ece4e277010842d481b9153915e6882e613890b67493395bb8e24","sha256:ff90bc3ab501a59c66d0f3d3e15a170f17dd7ea2826f7ae33986669a87b40ae1"],"state_sha256":"8bd62377b9f8f76a13bff81a9efff5fe08bc5ef5e1a813bedc34f8cb9005830c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GW4BsVw0mbM/d5AZ1cmIZ3WgS9Q82PgXmR77MFHPMEeWTfzrfyIXzDzVGrG7d4skhGGqu9y9LWoWkOFcX0iiAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T20:08:12.350214Z","bundle_sha256":"506bfe97e1a77fbe86b31c75465824ddc04db9d3eaf8c7870e4fd681e1611dc8"}}