{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2CD3ITZ4INTEJ6C4BIFHN4LUB3","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":"40f3caf2c0767abf182522b8cc5cf182cc2937216ab1e96508d69e4b1d225b97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T07:42:58Z","title_canon_sha256":"99adf4bb436bc9e6136113c978f6c818ffbb070b5db8df99a4bb79ad0a729987"},"schema_version":"1.0","source":{"id":"2409.01678","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01678","created_at":"2026-07-05T09:02:32Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01678v1","created_at":"2026-07-05T09:02:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01678","created_at":"2026-07-05T09:02:32Z"},{"alias_kind":"pith_short_12","alias_value":"2CD3ITZ4INTE","created_at":"2026-07-05T09:02:32Z"},{"alias_kind":"pith_short_16","alias_value":"2CD3ITZ4INTEJ6C4","created_at":"2026-07-05T09:02:32Z"},{"alias_kind":"pith_short_8","alias_value":"2CD3ITZ4","created_at":"2026-07-05T09:02:32Z"}],"graph_snapshots":[{"event_id":"sha256:b72721fa6d81613275d29af56b200bb4a7863f5b7d72f3fea48f600981b1e790","target":"graph","created_at":"2026-07-05T09:02:32Z","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/2409.01678/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that there exists an outerplanar graph on $O(n^{c})$ vertices for $c = \\log_2(3+\\sqrt{10}) \\approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This extends a result of Chung and Graham from 1983 who showed that there exist (non-planar) $n$-vertex graphs with $O(n \\log n)$ edges that contain all trees on $n$ vertices as subgraphs and a result from Gol'dberg and Livshits from 1968 who showed that there exists a universal tree for $n$-vertex trees on $n^{O(\\log(n))}$ vertices.\n  Furthermore, we determine the number of vertices needed in the worst case for a planar graph","authors_text":"Alexandra Wesolek, Helena Bergold, Joachim Orthaber, Manfred Scheucher, Robert Lauff, Vesna Ir\\v{s}i\\v{c}","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T07:42:58Z","title":"Subgraph-universal planar graphs for trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01678","kind":"arxiv","version":1},"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:3b60f087ae2075d6be4531acc0f459030c7c4fae519155c26bdb222cc0e6b45f","target":"record","created_at":"2026-07-05T09:02:32Z","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":"40f3caf2c0767abf182522b8cc5cf182cc2937216ab1e96508d69e4b1d225b97","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-09-03T07:42:58Z","title_canon_sha256":"99adf4bb436bc9e6136113c978f6c818ffbb070b5db8df99a4bb79ad0a729987"},"schema_version":"1.0","source":{"id":"2409.01678","kind":"arxiv","version":1}},"canonical_sha256":"d087b44f3c436644f85c0a0a76f1740ef30acb3f80f527f6ae7bb7468929b905","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d087b44f3c436644f85c0a0a76f1740ef30acb3f80f527f6ae7bb7468929b905","first_computed_at":"2026-07-05T09:02:32.640330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:02:32.640330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q1Ths63/gG0Yc4WfpHqiFtiHVjsbbzOcAoLl+TrATphdmFoZvx4Hf6/TgDgReANfMDubqNAZ9n4Vte21skqbCA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:02:32.640826Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.01678","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b60f087ae2075d6be4531acc0f459030c7c4fae519155c26bdb222cc0e6b45f","sha256:b72721fa6d81613275d29af56b200bb4a7863f5b7d72f3fea48f600981b1e790"],"state_sha256":"0badedf46aa65175754f4e43c5ed3eef8047beb3e19304aa3ec2c569a054bb2c"}