{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q2S3WGIKZW2YR4WPH33PHYIFCV","short_pith_number":"pith:Q2S3WGIK","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"},"canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","source":{"kind":"arxiv","id":"1705.00176","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00176","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00176v3","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00176","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"Q2S3WGIKZW2Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2S3WGIKZW2YR4WP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2S3WGIK","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q2S3WGIKZW2YR4WPH33PHYIFCV","target":"record","payload":{"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"},"canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","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"},"source_kind":"arxiv","source_id":"1705.00176","source_version":3,"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l65GeGVwzsrX+wXQjbgS4RVtS31mieFoPcwvXgbrreiySbukXakyfwA2xjfN+bXrgLhX85VahGse5DMyTb7TDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:00:15.931149Z"},"content_sha256":"97aa327b5e0a5f3b54d06fe12cb2c0e59f75df64801f1c34a7f99723c9d5a88a","schema_version":"1.0","event_id":"sha256:97aa327b5e0a5f3b54d06fe12cb2c0e59f75df64801f1c34a7f99723c9d5a88a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q2S3WGIKZW2YR4WPH33PHYIFCV","target":"graph","payload":{"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"},"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:29:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsNjtjii88AluhjZCPKQmiLNcARF0fIUFaeW3+pOsn1JgBOu1xEIv4C0NX5722JO5O5rkg8wgjKy3zsH1XRGAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:00:15.931502Z"},"content_sha256":"af9fcfcd89d1395e1434f8335c46e1306981093a448b053fdd5218883dd6cb2c","schema_version":"1.0","event_id":"sha256:af9fcfcd89d1395e1434f8335c46e1306981093a448b053fdd5218883dd6cb2c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/bundle.json","state_url":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/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-05T11:00:15Z","links":{"resolver":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV","bundle":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/bundle.json","state":"https://pith.science/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2S3WGIKZW2YR4WPH33PHYIFCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q2S3WGIKZW2YR4WPH33PHYIFCV","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":"e5932588cc035cbf29c9e8b586f196656c6dc26b9bf8e6f0516eece1afab7707","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T12:09:22Z","title_canon_sha256":"ba95b17de69872336ad719f2e6a079be94bb675e049294e58402f99bf0478018"},"schema_version":"1.0","source":{"id":"1705.00176","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00176","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00176v3","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00176","created_at":"2026-05-18T00:29:39Z"},{"alias_kind":"pith_short_12","alias_value":"Q2S3WGIKZW2Y","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2S3WGIKZW2YR4WP","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2S3WGIK","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:af9fcfcd89d1395e1434f8335c46e1306981093a448b053fdd5218883dd6cb2c","target":"graph","created_at":"2026-05-18T00:29:39Z","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":"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.","authors_text":"Adam Polak, Grzegorz Gu\\'spiel, Piotr Micek","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T12:09:22Z","title":"On an extremal problem for poset dimension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00176","kind":"arxiv","version":3},"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:97aa327b5e0a5f3b54d06fe12cb2c0e59f75df64801f1c34a7f99723c9d5a88a","target":"record","created_at":"2026-05-18T00:29:39Z","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":"e5932588cc035cbf29c9e8b586f196656c6dc26b9bf8e6f0516eece1afab7707","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-29T12:09:22Z","title_canon_sha256":"ba95b17de69872336ad719f2e6a079be94bb675e049294e58402f99bf0478018"},"schema_version":"1.0","source":{"id":"1705.00176","kind":"arxiv","version":3}},"canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86a5bb190acdb588f2cf3ef6f3e105154a1601ff459b2b41b1be5f365774c031","first_computed_at":"2026-05-18T00:29:39.106613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:39.106613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rMkvnzIGTazEAfVoS5aAS4CQBPwxSNjCVsbNWh2hCygPo/Gz0pOkE5OBgdtPkMYjR44E7l/WoafeCiX54zPuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:39.107052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00176","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97aa327b5e0a5f3b54d06fe12cb2c0e59f75df64801f1c34a7f99723c9d5a88a","sha256:af9fcfcd89d1395e1434f8335c46e1306981093a448b053fdd5218883dd6cb2c"],"state_sha256":"677f2179b15795effc2ab3f5af2d660c6fe10376cd1383b6ed29b9e1d726be3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L59DCd5rwgf20ScMR8k2YXfkKM7kIPPBld5OAX1al7UKqBOMPVH4pJA3pWsD74PMHzbQCG/6Fd38VM9TOLdNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:00:15.933422Z","bundle_sha256":"8495b03d3128466a0490972028cfbf4e85b2483ce2a20c5d98b29dfdec0195ab"}}