{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BJEVFHVDYDHABUGKB2DGNLSVDN","short_pith_number":"pith:BJEVFHVD","schema_version":"1.0","canonical_sha256":"0a49529ea3c0ce00d0ca0e8666ae551b5325eae940b300b7201ad1d2d7d6542c","source":{"kind":"arxiv","id":"2206.06942","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.06942","created_at":"2026-07-05T05:26:06.450726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.06942v2","created_at":"2026-07-05T05:26:06.450726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.06942","created_at":"2026-07-05T05:26:06.450726+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJEVFHVDYDHA","created_at":"2026-07-05T05:26:06.450726+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJEVFHVDYDHABUGK","created_at":"2026-07-05T05:26:06.450726+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJEVFHVD","created_at":"2026-07-05T05:26:06.450726+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/BJEVFHVDYDHABUGKB2DGNLSVDN","json":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN.json","graph_json":"https://pith.science/api/pith-number/BJEVFHVDYDHABUGKB2DGNLSVDN/graph.json","events_json":"https://pith.science/api/pith-number/BJEVFHVDYDHABUGKB2DGNLSVDN/events.json","paper":"https://pith.science/paper/BJEVFHVD"},"agent_actions":{"view_html":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN","download_json":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN.json","view_paper":"https://pith.science/paper/BJEVFHVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.06942&json=true","fetch_graph":"https://pith.science/api/pith-number/BJEVFHVDYDHABUGKB2DGNLSVDN/graph.json","fetch_events":"https://pith.science/api/pith-number/BJEVFHVDYDHABUGKB2DGNLSVDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/action/storage_attestation","attest_author":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/action/author_attestation","sign_citation":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/action/citation_signature","submit_replication":"https://pith.science/pith/BJEVFHVDYDHABUGKB2DGNLSVDN/action/replication_record"}},"created_at":"2026-07-05T05:26:06.450726+00:00","updated_at":"2026-07-05T05:26:06.450726+00:00"}