{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:W3CUPJTNTCQGKANSVDD5EOTO3T","short_pith_number":"pith:W3CUPJTN","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"},"canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","source":{"kind":"arxiv","id":"1908.03341","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03341","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03341v2","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03341","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"W3CUPJTNTCQG","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_16","alias_value":"W3CUPJTNTCQGKANS","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_8","alias_value":"W3CUPJTN","created_at":"2026-07-05T00:55:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:W3CUPJTNTCQGKANSVDD5EOTO3T","target":"record","payload":{"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"},"canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","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"},"source_kind":"arxiv","source_id":"1908.03341","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-05T00:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lFl0UbMTNM+5WWf6p7HETuBSa3FAoqhDa4i2iIyCp6OtdEVFC6iY4BykI2cnYkpMngPa1pS1sYRLZTG+TaijCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:33:21.474491Z"},"content_sha256":"6927f5acbd0ce91772e3b5bb0f658661750ced21d36e4cd7d3ef2d5253296f3f","schema_version":"1.0","event_id":"sha256:6927f5acbd0ce91772e3b5bb0f658661750ced21d36e4cd7d3ef2d5253296f3f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:W3CUPJTNTCQGKANSVDD5EOTO3T","target":"graph","payload":{"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"},"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-05T00:55:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jiuvYIc+2lc2A1d3hyvsqLWprk/Lyqh7TNHIq4/gfcWBSvlpXu0sr3+iGxltISuVg2VmTDoTMuUhbvIW+1nQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:33:21.475709Z"},"content_sha256":"06730df3fa962102b4b887a9794cb6cc4a04960ae9b47a37265ac394b27bf69f","schema_version":"1.0","event_id":"sha256:06730df3fa962102b4b887a9794cb6cc4a04960ae9b47a37265ac394b27bf69f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/bundle.json","state_url":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/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-08-16T06:33:21Z","links":{"resolver":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T","bundle":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/bundle.json","state":"https://pith.science/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3CUPJTNTCQGKANSVDD5EOTO3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:W3CUPJTNTCQGKANSVDD5EOTO3T","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":"8a2cd0b1c0558140d1bd336f7fd6177a0e7182b32fa69703d77b003be53f107a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T07:08:23Z","title_canon_sha256":"32ffc439ae43f0d756a53675916bd71031fba3c51069af508dcd5f3ba4b7dbc2"},"schema_version":"1.0","source":{"id":"1908.03341","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03341","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03341v2","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03341","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_12","alias_value":"W3CUPJTNTCQG","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_16","alias_value":"W3CUPJTNTCQGKANS","created_at":"2026-07-05T00:55:45Z"},{"alias_kind":"pith_short_8","alias_value":"W3CUPJTN","created_at":"2026-07-05T00:55:45Z"}],"graph_snapshots":[{"event_id":"sha256:06730df3fa962102b4b887a9794cb6cc4a04960ae9b47a37265ac394b27bf69f","target":"graph","created_at":"2026-07-05T00:55:45Z","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/1908.03341/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cyril Gavoille (LaBRI), Marthe Bonamy (LaBRI), Michal Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T07:08:23Z","title":"Shorter Labeling Schemes for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03341","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:6927f5acbd0ce91772e3b5bb0f658661750ced21d36e4cd7d3ef2d5253296f3f","target":"record","created_at":"2026-07-05T00:55:45Z","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":"8a2cd0b1c0558140d1bd336f7fd6177a0e7182b32fa69703d77b003be53f107a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-09T07:08:23Z","title_canon_sha256":"32ffc439ae43f0d756a53675916bd71031fba3c51069af508dcd5f3ba4b7dbc2"},"schema_version":"1.0","source":{"id":"1908.03341","kind":"arxiv","version":2}},"canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c547a66d98a06501b2a8c7d23a6edcd3f403b51abd81aea60cc839b3bc23a0","first_computed_at":"2026-07-05T00:55:45.355457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:55:45.355457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0Fm+CKPuNLmsfYw4TCUQvXBw1alLkEKSn8jbwUAIlrQ33Vvt/lPXs8M7KX7JrLMpU9qCGgl7BgNKP5l/EBtDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:55:45.355941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03341","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6927f5acbd0ce91772e3b5bb0f658661750ced21d36e4cd7d3ef2d5253296f3f","sha256:06730df3fa962102b4b887a9794cb6cc4a04960ae9b47a37265ac394b27bf69f"],"state_sha256":"b37015c919f1ada204819b98cf872953a4bb3995bd875ffddbbc287d5bcab195"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GkMEAqJmA2TvGTXPUZ3Gg06/C3p7KwxNj8MdwRHFL6S9HDoCroORti1PbXKPywEsgAKGRPXUAryEDKhi2BMvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:33:21.489018Z","bundle_sha256":"f6aa19d7c7d2a136edfdf7d6d65921687f6637c2fa9133962eebf1a241d8f2dc"}}