{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LTTCXDF3PQ6RFE4X2EIBMRLG5S","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":"48c488c41be9d723b0f15d9f079cbbf9eae4189df976678f483f39a1623e92ee","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-09T17:39:55Z","title_canon_sha256":"4be5aa26e595ccacf7d830f667322c803c47d6dd23cecd6e64f71aaf1ab83800"},"schema_version":"1.0","source":{"id":"2003.04280","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.04280","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"2003.04280v4","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04280","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"LTTCXDF3PQ6R","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_16","alias_value":"LTTCXDF3PQ6RFE4X","created_at":"2026-07-05T03:36:51Z"},{"alias_kind":"pith_short_8","alias_value":"LTTCXDF3","created_at":"2026-07-05T03:36:51Z"}],"graph_snapshots":[{"event_id":"sha256:aab75c40966940644893082d94a80d3af0b47b69c11659fcb7557143838070bf","target":"graph","created_at":"2026-07-05T03:36:51Z","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/2003.04280/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Cyril Gavoille, Gwena\\\"el Joret, Louis Esperet, Pat Morin, Piotr Micek, Vida Dujmovi\\'c","cross_cats":["cs.DC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-09T17:39:55Z","title":"Adjacency Labelling for Planar Graphs (and Beyond)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04280","kind":"arxiv","version":4},"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:47a11111bafeb563b48cdaa5d4b72905bece5dfd0e54be3f7bce42935fed4f95","target":"record","created_at":"2026-07-05T03:36:51Z","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":"48c488c41be9d723b0f15d9f079cbbf9eae4189df976678f483f39a1623e92ee","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-03-09T17:39:55Z","title_canon_sha256":"4be5aa26e595ccacf7d830f667322c803c47d6dd23cecd6e64f71aaf1ab83800"},"schema_version":"1.0","source":{"id":"2003.04280","kind":"arxiv","version":4}},"canonical_sha256":"5ce62b8cbb7c3d129397d110164566ec92a785f928b6c1a5d20e44bb34061776","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5ce62b8cbb7c3d129397d110164566ec92a785f928b6c1a5d20e44bb34061776","first_computed_at":"2026-07-05T03:36:51.103870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:36:51.103870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wA6RNvCqwuNPla/Uk10xOOUX+Yn57NeiZ3nvyGGhy/aoQ8HXcVhRVylRLH8XkRuFcut5pT2NaCVpg/MatAoRDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:36:51.104284Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.04280","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47a11111bafeb563b48cdaa5d4b72905bece5dfd0e54be3f7bce42935fed4f95","sha256:aab75c40966940644893082d94a80d3af0b47b69c11659fcb7557143838070bf"],"state_sha256":"cdad28703726563fc4b69058ece827385d4ad2991c9c0dd57116be735bd28152"}