{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Q2S3WGIKZW2YR4WPH33PHYIFCV","short_pith_number":"pith:Q2S3WGIK","schema_version":"1.0","canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","source":{"kind":"arxiv","id":"1705.00176","version":3},"attestation_state":"computed","paper":{"title":"On an extremal problem for poset dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adam Polak, Grzegorz Gu\\'spiel, Piotr Micek","submitted_at":"2017-04-29T12:09:22Z","abstract_excerpt":"Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\\geqslant n^{1/2}$. We improve the best known upper bound and show $f(n)=\\mathcal{O}(n^{2/3})$. For higher dimensions, we show $f_d(n)=\\mathcal{O}\\left(n^\\frac{d}{d+1}\\right)$, where $f_d(n)$ is the largest integer such that every poset on $n$ elements has a $d$-dimensional subposet on $f_d(n)$ elements."},"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":"1705.00176","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T12:09:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ba95b17de69872336ad719f2e6a079be94bb675e049294e58402f99bf0478018","abstract_canon_sha256":"e5932588cc035cbf29c9e8b586f196656c6dc26b9bf8e6f0516eece1afab7707"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:39.107052Z","signature_b64":"rMkvnzIGTazEAfVoS5aAS4CQBPwxSNjCVsbNWh2hCygPo/Gz0pOkE5OBgdtPkMYjR44E7l/WoafeCiX54zPuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","last_reissued_at":"2026-05-18T00:29:39.106613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:39.106613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On an extremal problem for poset dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adam Polak, Grzegorz Gu\\'spiel, Piotr Micek","submitted_at":"2017-04-29T12:09:22Z","abstract_excerpt":"Let $f(n)$ be the largest integer such that every poset on $n$ elements has a $2$-dimensional subposet on $f(n)$ elements. What is the asymptotics of $f(n)$? It is easy to see that $f(n)\\geqslant n^{1/2}$. We improve the best known upper bound and show $f(n)=\\mathcal{O}(n^{2/3})$. For higher dimensions, we show $f_d(n)=\\mathcal{O}\\left(n^\\frac{d}{d+1}\\right)$, where $f_d(n)$ is the largest integer such that every poset on $n$ elements has a $d$-dimensional subposet on $f_d(n)$ elements."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00176","kind":"arxiv","version":3},"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":"1705.00176","created_at":"2026-05-18T00:29:39.106684+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00176v3","created_at":"2026-05-18T00:29:39.106684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00176","created_at":"2026-05-18T00:29:39.106684+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2S3WGIKZW2Y","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2S3WGIKZW2YR4WP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2S3WGIK","created_at":"2026-05-18T12:31:37.085036+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/Q2S3WGIKZW2YR4WPH33PHYIFCV","json":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV.json","graph_json":"https://pith.science/api/pith-number/Q2S3WGIKZW2YR4WPH33PHYIFCV/graph.json","events_json":"https://pith.science/api/pith-number/Q2S3WGIKZW2YR4WPH33PHYIFCV/events.json","paper":"https://pith.science/paper/Q2S3WGIK"},"agent_actions":{"view_html":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV","download_json":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV.json","view_paper":"https://pith.science/paper/Q2S3WGIK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00176&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2S3WGIKZW2YR4WPH33PHYIFCV/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2S3WGIKZW2YR4WPH33PHYIFCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/action/storage_attestation","attest_author":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/action/author_attestation","sign_citation":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/action/citation_signature","submit_replication":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/action/replication_record"}},"created_at":"2026-05-18T00:29:39.106684+00:00","updated_at":"2026-05-18T00:29:39.106684+00:00"}