{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2OUDTYNCONVYW7DLDSWMYCZLDZ","short_pith_number":"pith:2OUDTYNC","schema_version":"1.0","canonical_sha256":"d3a839e1a2736b8b7c6b1caccc0b2b1e6da5d44149edca0245a994f26fe9752f","source":{"kind":"arxiv","id":"1804.05952","version":2},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s-Szekeres On-Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elizabeth Reiland, Florian Pfender, Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen, Ryan Solava","submitted_at":"2018-04-16T21:45:01Z","abstract_excerpt":"In 1935, Erd\\H{o}s and Szekeres proved that $(m-1)(k-1)+1$ is the minimum number of points in the plane which definitely contain an increasing subset of $m$ points or a decreasing subset of $k$ points (as ordered by their $x$-coordinates). We consider their result from an on-line game perspective: Let points be determined one by one by player A first determining the $x$-coordinate and then player B determining the $y$-coordinate. What is the minimum number of points such that player A can force an increasing subset of $m$ points or a decreasing subset of $k$ points? We introduce this as the Er"},"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":"1804.05952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-16T21:45:01Z","cross_cats_sorted":[],"title_canon_sha256":"9c975584338ec1e82d6ef4a0950fa4d324c5e105ce8a840fdfa296a8a340ad6e","abstract_canon_sha256":"75bb9514dc994f3750143dc25e9c6bd6741c2bf385f86de694e881b2cdd2a1bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:08.802727Z","signature_b64":"/LoghVA0aR8a0pfzR3Z4YOk+aQGt7aU7sbRTktO32hocfIFZKOhcI+jSwYIw0P9M67A5dZ5M8eAIQ1ncQDFzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3a839e1a2736b8b7c6b1caccc0b2b1e6da5d44149edca0245a994f26fe9752f","last_reissued_at":"2026-05-18T00:18:08.802191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:08.802191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s-Szekeres On-Line","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Elizabeth Reiland, Florian Pfender, Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen, Ryan Solava","submitted_at":"2018-04-16T21:45:01Z","abstract_excerpt":"In 1935, Erd\\H{o}s and Szekeres proved that $(m-1)(k-1)+1$ is the minimum number of points in the plane which definitely contain an increasing subset of $m$ points or a decreasing subset of $k$ points (as ordered by their $x$-coordinates). We consider their result from an on-line game perspective: Let points be determined one by one by player A first determining the $x$-coordinate and then player B determining the $y$-coordinate. What is the minimum number of points such that player A can force an increasing subset of $m$ points or a decreasing subset of $k$ points? We introduce this as the Er"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05952","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":""},"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":"1804.05952","created_at":"2026-05-18T00:18:08.802263+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05952v2","created_at":"2026-05-18T00:18:08.802263+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05952","created_at":"2026-05-18T00:18:08.802263+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OUDTYNCONVY","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OUDTYNCONVYW7DL","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OUDTYNC","created_at":"2026-05-18T12:32:02.567920+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/2OUDTYNCONVYW7DLDSWMYCZLDZ","json":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ.json","graph_json":"https://pith.science/api/pith-number/2OUDTYNCONVYW7DLDSWMYCZLDZ/graph.json","events_json":"https://pith.science/api/pith-number/2OUDTYNCONVYW7DLDSWMYCZLDZ/events.json","paper":"https://pith.science/paper/2OUDTYNC"},"agent_actions":{"view_html":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ","download_json":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ.json","view_paper":"https://pith.science/paper/2OUDTYNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05952&json=true","fetch_graph":"https://pith.science/api/pith-number/2OUDTYNCONVYW7DLDSWMYCZLDZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2OUDTYNCONVYW7DLDSWMYCZLDZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ/action/storage_attestation","attest_author":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ/action/author_attestation","sign_citation":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ/action/citation_signature","submit_replication":"https://pith.science/pith/2OUDTYNCONVYW7DLDSWMYCZLDZ/action/replication_record"}},"created_at":"2026-05-18T00:18:08.802263+00:00","updated_at":"2026-05-18T00:18:08.802263+00:00"}