{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:RTEMA6O2L7JBPUQEZPE5N67PQH","short_pith_number":"pith:RTEMA6O2","schema_version":"1.0","canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","source":{"kind":"arxiv","id":"1501.01147","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of the Partial Order Dimension Problem - Closing the Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irina Mustata, Martin Pergel, Stefan Felsner","submitted_at":"2015-01-06T11:11:49Z","abstract_excerpt":"The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\\geq 3$ to test if a partial order has dimension $\\leq k$ is NP-complete. The height of a partial order $P$ is the maximum size of a chain in $P$. Yannakakis also showed that for $k\\geq 4$ to test if a partial order of height $2$ has dimension $\\leq k$ is NP-complete. The complexity of deciding whether an order of height $2$ has dimension $3$ was left open. This question b"},"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":"1501.01147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T11:11:49Z","cross_cats_sorted":[],"title_canon_sha256":"6f3b7519ca9f751e73f205019ac60e455ed714464b1f1da77e88b485f3df01d2","abstract_canon_sha256":"875295d788d6727ebf49d3da2773c9efde63e6180ebc6f2d2f1079ba17630608"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:26.620324Z","signature_b64":"LjKHUTtMlrdKL+iozn1RmE35kHBThSrWAQwSWX72UMoPIl58my3otBBWLZiUNVLXFP4IRr4BjMlhvzEyleC8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","last_reissued_at":"2026-05-18T01:16:26.619854Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:26.619854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Partial Order Dimension Problem - Closing the Gap","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Irina Mustata, Martin Pergel, Stefan Felsner","submitted_at":"2015-01-06T11:11:49Z","abstract_excerpt":"The dimension of a partial order $P$ is the minimum number of linear orders whose intersection is $P$. There are efficient algorithms to test if a partial order has dimension at most $2$. In 1982 Yannakakis showed that for $k\\geq 3$ to test if a partial order has dimension $\\leq k$ is NP-complete. The height of a partial order $P$ is the maximum size of a chain in $P$. Yannakakis also showed that for $k\\geq 4$ to test if a partial order of height $2$ has dimension $\\leq k$ is NP-complete. The complexity of deciding whether an order of height $2$ has dimension $3$ was left open. This question b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01147","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":"1501.01147","created_at":"2026-05-18T01:16:26.619933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01147v2","created_at":"2026-05-18T01:16:26.619933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01147","created_at":"2026-05-18T01:16:26.619933+00:00"},{"alias_kind":"pith_short_12","alias_value":"RTEMA6O2L7JB","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"RTEMA6O2L7JBPUQE","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"RTEMA6O2","created_at":"2026-05-18T12:29:39.896362+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/RTEMA6O2L7JBPUQEZPE5N67PQH","json":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH.json","graph_json":"https://pith.science/api/pith-number/RTEMA6O2L7JBPUQEZPE5N67PQH/graph.json","events_json":"https://pith.science/api/pith-number/RTEMA6O2L7JBPUQEZPE5N67PQH/events.json","paper":"https://pith.science/paper/RTEMA6O2"},"agent_actions":{"view_html":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH","download_json":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH.json","view_paper":"https://pith.science/paper/RTEMA6O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01147&json=true","fetch_graph":"https://pith.science/api/pith-number/RTEMA6O2L7JBPUQEZPE5N67PQH/graph.json","fetch_events":"https://pith.science/api/pith-number/RTEMA6O2L7JBPUQEZPE5N67PQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/action/storage_attestation","attest_author":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/action/author_attestation","sign_citation":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/action/citation_signature","submit_replication":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/action/replication_record"}},"created_at":"2026-05-18T01:16:26.619933+00:00","updated_at":"2026-05-18T01:16:26.619933+00:00"}