{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XP6IGZSWDFSBUC6UAH3QMBIGXT","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":"0c0e6ecfd634270bc34fe7bc498ac12ce22829a9690fa1c0767ef3c5dd085f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T13:34:53Z","title_canon_sha256":"66731523672f19517ba7f6991c1db580fd858e5d90dbe53388249d5f5e7597c4"},"schema_version":"1.0","source":{"id":"1504.02306","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02306","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02306v2","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02306","created_at":"2026-05-18T01:20:46Z"},{"alias_kind":"pith_short_12","alias_value":"XP6IGZSWDFSB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XP6IGZSWDFSBUC6U","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XP6IGZSW","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:388f8183b641ae1a0b64c6cc2f37e0ada92f04ed6806f3e580c47e9020bc5b0c","target":"graph","created_at":"2026-05-18T01:20:46Z","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"},"paper":{"abstract_excerpt":"We show that there exists a graph $G$ with $O(n)$ nodes, where any forest of $n$ nodes is a node-induced subgraph of $G$. Furthermore, for constant arboricity $k$, the result implies the existence of a graph with $O(n^k)$ nodes that contains all $n$-node graphs as node-induced subgraphs, matching a $\\Omega(n^k)$ lower bound. The lower bound and previously best upper bounds were presented in Alstrup and Rauhe (FOCS'02). Our upper bounds are obtained through a $\\log_2 n +O(1)$ labeling scheme for adjacency queries in forests.\n  We hereby solve an open problem being raised repeatedly over decades","authors_text":"Mathias B{\\ae}k Tejs Knudsen, S{\\o}ren Dahlgaard, Stephen Alstrup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T13:34:53Z","title":"Optimal induced universal graphs and adjacency labeling for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02306","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:b25230ebabf79d47fb5dcc2ee7c381c03fd289f92e13a6ab7e61161344128d4a","target":"record","created_at":"2026-05-18T01:20:46Z","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":"0c0e6ecfd634270bc34fe7bc498ac12ce22829a9690fa1c0767ef3c5dd085f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T13:34:53Z","title_canon_sha256":"66731523672f19517ba7f6991c1db580fd858e5d90dbe53388249d5f5e7597c4"},"schema_version":"1.0","source":{"id":"1504.02306","kind":"arxiv","version":2}},"canonical_sha256":"bbfc83665619641a0bd401f7060506bce12c6c1fd78e3c256474363fa3b486d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbfc83665619641a0bd401f7060506bce12c6c1fd78e3c256474363fa3b486d7","first_computed_at":"2026-05-18T01:20:46.649165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:46.649165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UWoVc4ZKaCxomixeyckR2d6tQrEWfnMSpX1f7hkumHSTqHnm4Xz8e/7P0w/gKFQaPwhEJdfm3oOFE5VBY04rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:46.649609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02306","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b25230ebabf79d47fb5dcc2ee7c381c03fd289f92e13a6ab7e61161344128d4a","sha256:388f8183b641ae1a0b64c6cc2f37e0ada92f04ed6806f3e580c47e9020bc5b0c"],"state_sha256":"14b65d69c23086efd6f386d26e3694ff630338aeeee3fe43b1e8abfa71bcb511"}