{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:BJEVFHVDYDHABUGKB2DGNLSVDN","short_pith_number":"pith:BJEVFHVD","canonical_record":{"source":{"id":"2206.06942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T16:02:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"288d075678c96c4a1664423402564f15765127df2f1c503f08fdb5b29e47a631","abstract_canon_sha256":"97c51dce6860a4cd53b5ac1b05b5bc4b4c8ec9325e9e2d6637a02a6918656d61"},"schema_version":"1.0"},"canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","source":{"kind":"arxiv","id":"2206.06942","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06942","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06942v2","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06942","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"BJEVFHVDYDHA","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"BJEVFHVDYDHABUGK","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"BJEVFHVD","created_at":"2026-07-05T05:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:BJEVFHVDYDHABUGKB2DGNLSVDN","target":"record","payload":{"canonical_record":{"source":{"id":"2206.06942","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T16:02:09Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"288d075678c96c4a1664423402564f15765127df2f1c503f08fdb5b29e47a631","abstract_canon_sha256":"97c51dce6860a4cd53b5ac1b05b5bc4b4c8ec9325e9e2d6637a02a6918656d61"},"schema_version":"1.0"},"canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:26:06.451066Z","signature_b64":"gowvrlkyqRHZfttKDpnKTBtTS/cWxjMNScYXDxJqqeArW+0JQqOUsBai766TvZx2fsLx4tA/PiO1Zxks91bMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","last_reissued_at":"2026-07-05T05:26:06.450670Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:26:06.450670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.06942","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-07-05T05:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEp2tFN3886dTSTPriGeO0AX2b54ndK55FQyulYEMDKuqCv6Kv2kI8pWck9PDeZU/2bGz27C2lO2H4w7U6W0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T16:44:57.144619Z"},"content_sha256":"5b72112c2d91f497e62f66e314ea255b200065a3b5c961ebc805a6236b81cb2f","schema_version":"1.0","event_id":"sha256:5b72112c2d91f497e62f66e314ea255b200065a3b5c961ebc805a6236b81cb2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:BJEVFHVDYDHABUGKB2DGNLSVDN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean dimension and dim-boundedness: Planar cover graph with a zero","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Heather Smith Blake, Piotr Micek, William T. Trotter","submitted_at":"2022-06-14T16:02:09Z","abstract_excerpt":"In 1989, Ne\\v{s}et\\v{r}il and Pudl\\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most $13$. As a consequence, we are able to show that there is a reachability labeling scheme with labels consisting of $\\mathcal{O}(\\log n)$ bits for planar digraphs with a single source. The best known scheme for general planar digraphs uses labels with $\\mathcal{O}(\\log^2 n)$ bits [Thorup JACM 2004], and it remains open to determine whether a scheme using labe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06942","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.06942/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:26:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2u8jVF6uhtC96YxA37B9LO2Dl4R8j+jtj/wY1S749wsOFJqRFlMp7dR4Zc3Xqnx5oQe0vOQBLXg30Myv/0c+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T16:44:57.145184Z"},"content_sha256":"c03716dd57947c321377418da54703339d1bd4a9914866c3c78e551e124b3373","schema_version":"1.0","event_id":"sha256:c03716dd57947c321377418da54703339d1bd4a9914866c3c78e551e124b3373"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/bundle.json","state_url":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/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-07-10T16:44:57Z","links":{"resolver":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN","bundle":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/bundle.json","state":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:BJEVFHVDYDHABUGKB2DGNLSVDN","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":"97c51dce6860a4cd53b5ac1b05b5bc4b4c8ec9325e9e2d6637a02a6918656d61","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T16:02:09Z","title_canon_sha256":"288d075678c96c4a1664423402564f15765127df2f1c503f08fdb5b29e47a631"},"schema_version":"1.0","source":{"id":"2206.06942","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.06942","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"arxiv_version","alias_value":"2206.06942v2","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06942","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_12","alias_value":"BJEVFHVDYDHA","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"BJEVFHVDYDHABUGK","created_at":"2026-07-05T05:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"BJEVFHVD","created_at":"2026-07-05T05:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:c03716dd57947c321377418da54703339d1bd4a9914866c3c78e551e124b3373","target":"graph","created_at":"2026-07-05T05:26:06Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.06942/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 1989, Ne\\v{s}et\\v{r}il and Pudl\\'ak posed the following challenging question: Do planar posets have bounded Boolean dimension? We show that every poset with a planar cover graph and a unique minimal element has Boolean dimension at most $13$. As a consequence, we are able to show that there is a reachability labeling scheme with labels consisting of $\\mathcal{O}(\\log n)$ bits for planar digraphs with a single source. The best known scheme for general planar digraphs uses labels with $\\mathcal{O}(\\log^2 n)$ bits [Thorup JACM 2004], and it remains open to determine whether a scheme using labe","authors_text":"Heather Smith Blake, Piotr Micek, William T. Trotter","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T16:02:09Z","title":"Boolean dimension and dim-boundedness: Planar cover graph with a zero"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.06942","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:5b72112c2d91f497e62f66e314ea255b200065a3b5c961ebc805a6236b81cb2f","target":"record","created_at":"2026-07-05T05:26:06Z","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":"97c51dce6860a4cd53b5ac1b05b5bc4b4c8ec9325e9e2d6637a02a6918656d61","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-06-14T16:02:09Z","title_canon_sha256":"288d075678c96c4a1664423402564f15765127df2f1c503f08fdb5b29e47a631"},"schema_version":"1.0","source":{"id":"2206.06942","kind":"arxiv","version":2}},"canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","first_computed_at":"2026-07-05T05:26:06.450670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:26:06.450670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gowvrlkyqRHZfttKDpnKTBtTS/cWxjMNScYXDxJqqeArW+0JQqOUsBai766TvZx2fsLx4tA/PiO1Zxks91bMCA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:26:06.451066Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.06942","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b72112c2d91f497e62f66e314ea255b200065a3b5c961ebc805a6236b81cb2f","sha256:c03716dd57947c321377418da54703339d1bd4a9914866c3c78e551e124b3373"],"state_sha256":"425a2546cc88d74f858909bb22c94a4e5a5a0ee7c56b40199cfc510ff743bde2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rra8FBh091rD73mhgSUPIaDlEtSS+u/J/Ne6cKx7NhGNl5REn09Jv27M/B2AJZOJKvxYpUOvKa0bFA4PSUWjAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T16:44:57.148060Z","bundle_sha256":"e9933a36b1a1913cd34b95b7a0e85236464a97a83bd922fec764ce0acc5fda0b"}}