{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:LTTCXDF3PQ6RFE4X2EIBMRLG5S","short_pith_number":"pith:LTTCXDF3","schema_version":"1.0","canonical_sha256":"5ce62b8cbb7c3d129397d110164566ec92a785f928b6c1a5d20e44bb34061776","source":{"kind":"arxiv","id":"2003.04280","version":4},"attestation_state":"computed","paper":{"title":"Adjacency Labelling for Planar Graphs (and Beyond)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DS","authors_text":"Cyril Gavoille, Gwena\\\"el Joret, Louis Esperet, Pat Morin, Piotr Micek, Vida Dujmovi\\'c","submitted_at":"2020-03-09T17:39:55Z","abstract_excerpt":"We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an $n$-vertex planar graph $G$ is assigned a $(1+o(1))\\log_2 n$-bit label and the labels of two vertices $u$ and $v$ are sufficient to determine if $uv$ is an edge of $G$. This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every $n$, there exists a graph $U_n$ with $n^{1+o(1)}$ vertices such that every $n$-vertex planar graph is an induced subgraph of $U_n$. These results generalize"},"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":"2003.04280","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-09T17:39:55Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"4be5aa26e595ccacf7d830f667322c803c47d6dd23cecd6e64f71aaf1ab83800","abstract_canon_sha256":"48c488c41be9d723b0f15d9f079cbbf9eae4189df976678f483f39a1623e92ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:36:51.104284Z","signature_b64":"wA6RNvCqwuNPla/Uk10xOOUX+Yn57NeiZ3nvyGGhy/aoQ8HXcVhRVylRLH8XkRuFcut5pT2NaCVpg/MatAoRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ce62b8cbb7c3d129397d110164566ec92a785f928b6c1a5d20e44bb34061776","last_reissued_at":"2026-07-05T03:36:51.103870Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:36:51.103870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adjacency Labelling for Planar Graphs (and Beyond)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DS","authors_text":"Cyril Gavoille, Gwena\\\"el Joret, Louis Esperet, Pat Morin, Piotr Micek, Vida Dujmovi\\'c","submitted_at":"2020-03-09T17:39:55Z","abstract_excerpt":"We show that there exists an adjacency labelling scheme for planar graphs where each vertex of an $n$-vertex planar graph $G$ is assigned a $(1+o(1))\\log_2 n$-bit label and the labels of two vertices $u$ and $v$ are sufficient to determine if $uv$ is an edge of $G$. This is optimal up to the lower order term and is the first such asymptotically optimal result. An alternative, but equivalent, interpretation of this result is that, for every $n$, there exists a graph $U_n$ with $n^{1+o(1)}$ vertices such that every $n$-vertex planar graph is an induced subgraph of $U_n$. These results generalize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04280","kind":"arxiv","version":4},"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/2003.04280/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":"2003.04280","created_at":"2026-07-05T03:36:51.103926+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.04280v4","created_at":"2026-07-05T03:36:51.103926+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04280","created_at":"2026-07-05T03:36:51.103926+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTTCXDF3PQ6R","created_at":"2026-07-05T03:36:51.103926+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTTCXDF3PQ6RFE4X","created_at":"2026-07-05T03:36:51.103926+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTTCXDF3","created_at":"2026-07-05T03:36:51.103926+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.03341","citing_title":"Shorter Labeling Schemes for Planar Graphs","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S","json":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S.json","graph_json":"https://pith.science/api/pith-number/LTTCXDF3PQ6RFE4X2EIBMRLG5S/graph.json","events_json":"https://pith.science/api/pith-number/LTTCXDF3PQ6RFE4X2EIBMRLG5S/events.json","paper":"https://pith.science/paper/LTTCXDF3"},"agent_actions":{"view_html":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S","download_json":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S.json","view_paper":"https://pith.science/paper/LTTCXDF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.04280&json=true","fetch_graph":"https://pith.science/api/pith-number/LTTCXDF3PQ6RFE4X2EIBMRLG5S/graph.json","fetch_events":"https://pith.science/api/pith-number/LTTCXDF3PQ6RFE4X2EIBMRLG5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S/action/storage_attestation","attest_author":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S/action/author_attestation","sign_citation":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S/action/citation_signature","submit_replication":"https://pith.science/pith/LTTCXDF3PQ6RFE4X2EIBMRLG5S/action/replication_record"}},"created_at":"2026-07-05T03:36:51.103926+00:00","updated_at":"2026-07-05T03:36:51.103926+00:00"}