{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:W3CUPJTNTCQGKANSVDD5EOTO3T","short_pith_number":"pith:W3CUPJTN","schema_version":"1.0","canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","source":{"kind":"arxiv","id":"1908.03341","version":2},"attestation_state":"computed","paper":{"title":"Shorter Labeling Schemes for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyril Gavoille (LaBRI), Marthe Bonamy (LaBRI), Michal Pilipczuk","submitted_at":"2019-08-09T07:08:23Z","abstract_excerpt":"An \\emph{adjacency labeling scheme} for a given class of graphs is  an algorithm that for every graph $G$ from the class, assigns bit  strings (labels) to vertices of $G$ so that for any two vertices  $u,v$, whether $u$ and $v$ are adjacent can be determined by a fixed  procedure that examines only their labels. It is known that planar  graphs with $n$ vertices admit a labeling scheme with labels of bit length  $(2+o(1))\\log{n}$.  In this work we improve this bound by designing a labeling scheme  with labels of bit length $(\\frac{4}{3}+o(1))\\log{n}$.      In graph-theoretical terms, this impli"},"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":"1908.03341","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T07:08:23Z","cross_cats_sorted":[],"title_canon_sha256":"32ffc439ae43f0d756a53675916bd71031fba3c51069af508dcd5f3ba4b7dbc2","abstract_canon_sha256":"8a2cd0b1c0558140d1bd336f7fd6177a0e7182b32fa69703d77b003be53f107a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:45.355941Z","signature_b64":"D0Fm+CKPuNLmsfYw4TCUQvXBw1alLkEKSn8jbwUAIlrQ33Vvt/lPXs8M7KX7JrLMpU9qCGgl7BgNKP5l/EBtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","last_reissued_at":"2026-07-05T00:55:45.355457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:45.355457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shorter Labeling Schemes for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cyril Gavoille (LaBRI), Marthe Bonamy (LaBRI), Michal Pilipczuk","submitted_at":"2019-08-09T07:08:23Z","abstract_excerpt":"An \\emph{adjacency labeling scheme} for a given class of graphs is  an algorithm that for every graph $G$ from the class, assigns bit  strings (labels) to vertices of $G$ so that for any two vertices  $u,v$, whether $u$ and $v$ are adjacent can be determined by a fixed  procedure that examines only their labels. It is known that planar  graphs with $n$ vertices admit a labeling scheme with labels of bit length  $(2+o(1))\\log{n}$.  In this work we improve this bound by designing a labeling scheme  with labels of bit length $(\\frac{4}{3}+o(1))\\log{n}$.      In graph-theoretical terms, this impli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03341","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/1908.03341/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":"1908.03341","created_at":"2026-07-05T00:55:45.355550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03341v2","created_at":"2026-07-05T00:55:45.355550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03341","created_at":"2026-07-05T00:55:45.355550+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3CUPJTNTCQG","created_at":"2026-07-05T00:55:45.355550+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3CUPJTNTCQGKANS","created_at":"2026-07-05T00:55:45.355550+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3CUPJTN","created_at":"2026-07-05T00:55:45.355550+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/W3CUPJTNTCQGKANSVDD5EOTO3T","json":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T.json","graph_json":"https://pith.science/api/pith-number/W3CUPJTNTCQGKANSVDD5EOTO3T/graph.json","events_json":"https://pith.science/api/pith-number/W3CUPJTNTCQGKANSVDD5EOTO3T/events.json","paper":"https://pith.science/paper/W3CUPJTN"},"agent_actions":{"view_html":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T","download_json":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T.json","view_paper":"https://pith.science/paper/W3CUPJTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03341&json=true","fetch_graph":"https://pith.science/api/pith-number/W3CUPJTNTCQGKANSVDD5EOTO3T/graph.json","fetch_events":"https://pith.science/api/pith-number/W3CUPJTNTCQGKANSVDD5EOTO3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/action/storage_attestation","attest_author":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/action/author_attestation","sign_citation":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/action/citation_signature","submit_replication":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/action/replication_record"}},"created_at":"2026-07-05T00:55:45.355550+00:00","updated_at":"2026-07-05T00:55:45.355550+00:00"}