{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:RTEMA6O2L7JBPUQEZPE5N67PQH","short_pith_number":"pith:RTEMA6O2","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"},"canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","source":{"kind":"arxiv","id":"1501.01147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01147","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01147v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01147","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"RTEMA6O2L7JB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTEMA6O2L7JBPUQE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTEMA6O2","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:RTEMA6O2L7JBPUQEZPE5N67PQH","target":"record","payload":{"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"},"canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","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"},"source_kind":"arxiv","source_id":"1501.01147","source_version":2,"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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YSe82dViKCD2Thah9is27nK/YWLJyiEM6R3wRiGUg/Ma7FD+jWr71lNDqWsIsg6d1M7rUyhSSZY640yxKNFjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:39:58.555704Z"},"content_sha256":"68faf46b118b71f2914c813c5daec181e4a1e3889ff3a4ad3cb6aff5fd1e243c","schema_version":"1.0","event_id":"sha256:68faf46b118b71f2914c813c5daec181e4a1e3889ff3a4ad3cb6aff5fd1e243c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:RTEMA6O2L7JBPUQEZPE5N67PQH","target":"graph","payload":{"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"},"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-18T01:16:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sCBzAcccQM4N3dkej50hiUHZliSyvZigVUzimagsYUteJ0FeNjJV7snchA7PIx+fdZVwtsLwJzmpjKozdo+nCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T02:39:58.556097Z"},"content_sha256":"275dd3723012ce0d72735234b5b960e6a103f4a9342f7ecea64e14084a388f7f","schema_version":"1.0","event_id":"sha256:275dd3723012ce0d72735234b5b960e6a103f4a9342f7ecea64e14084a388f7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/bundle.json","state_url":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/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-07T02:39:58Z","links":{"resolver":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH","bundle":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/bundle.json","state":"https://pith.science/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RTEMA6O2L7JBPUQEZPE5N67PQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RTEMA6O2L7JBPUQEZPE5N67PQH","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":"875295d788d6727ebf49d3da2773c9efde63e6180ebc6f2d2f1079ba17630608","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T11:11:49Z","title_canon_sha256":"6f3b7519ca9f751e73f205019ac60e455ed714464b1f1da77e88b485f3df01d2"},"schema_version":"1.0","source":{"id":"1501.01147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01147","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01147v2","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01147","created_at":"2026-05-18T01:16:26Z"},{"alias_kind":"pith_short_12","alias_value":"RTEMA6O2L7JB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RTEMA6O2L7JBPUQE","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RTEMA6O2","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:275dd3723012ce0d72735234b5b960e6a103f4a9342f7ecea64e14084a388f7f","target":"graph","created_at":"2026-05-18T01:16:26Z","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":"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","authors_text":"Irina Mustata, Martin Pergel, Stefan Felsner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T11:11:49Z","title":"The Complexity of the Partial Order Dimension Problem - Closing the Gap"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01147","kind":"arxiv","version":2},"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:68faf46b118b71f2914c813c5daec181e4a1e3889ff3a4ad3cb6aff5fd1e243c","target":"record","created_at":"2026-05-18T01:16:26Z","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":"875295d788d6727ebf49d3da2773c9efde63e6180ebc6f2d2f1079ba17630608","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-06T11:11:49Z","title_canon_sha256":"6f3b7519ca9f751e73f205019ac60e455ed714464b1f1da77e88b485f3df01d2"},"schema_version":"1.0","source":{"id":"1501.01147","kind":"arxiv","version":2}},"canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8cc8c079da5fd217d204cbc9d6fbef81efdb9ffb2c1dea5caf53f3dede7a8d5d","first_computed_at":"2026-05-18T01:16:26.619854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:26.619854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LjKHUTtMlrdKL+iozn1RmE35kHBThSrWAQwSWX72UMoPIl58my3otBBWLZiUNVLXFP4IRr4BjMlhvzEyleC8Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:26.620324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:68faf46b118b71f2914c813c5daec181e4a1e3889ff3a4ad3cb6aff5fd1e243c","sha256:275dd3723012ce0d72735234b5b960e6a103f4a9342f7ecea64e14084a388f7f"],"state_sha256":"53707ec98358ea58d16af33aaba6753f6afb1bb4a933d66a954c24b129d1991c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6efUKHsgQqD2vscO85flXPqyNjkF6zjUh1sxhs39Q1kcpA8nD0ImBi5KNCQF/Tag7uFUUnX6M3V81aNCad22BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T02:39:58.559435Z","bundle_sha256":"93acb54791b76f127d33bc444f36c6945f0fe44a64be0e55408639dcac058316"}}