{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IYUI2VTXSAHDD2YI6Y6IGKYIEX","short_pith_number":"pith:IYUI2VTX","schema_version":"1.0","canonical_sha256":"46288d5677900e31eb08f63c832b0825f9edd76d936aea1ce6ac7c66a88e1f5f","source":{"kind":"arxiv","id":"1607.04911","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Jacob Holm, Mathias B{\\ae}k Tejs Knudsen, Mikkel Abrahamsen, Morten St\\\"ockel, Stephen Alstrup","submitted_at":"2016-07-17T19:45:01Z","abstract_excerpt":"A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an induced universal graph with $O\\!\\left(2^{n/2}\\right)$ vertices, matching a lower bound by Moon [Proc. Glasgow Math. Assoc. 1965].\n  Let $k= \\lceil D/2 \\rceil$. Improving asymptotically on previous results by Butler [Graphs and Combinatorics 2009] and Esperet, Arnaud and Ochem [IPL 2008], we give an induced universal graph with $O\\!\\left(\\frac{k2^k}{k!}n^k \\r"},"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":"1607.04911","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T19:45:01Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f0704ae31ecb87287a00e48fed459d6bff50b93a11f3f2da30b7a156912e04d9","abstract_canon_sha256":"44f0a4b0d83ffb0c0d002388c7476ca3c33bde069d7d50fafeb6b16441892ffc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:41.691225Z","signature_b64":"2jCh+hRgywLtBvMM3uDToIRupxxNLMRcMPhf09MsLP06mvOfoz4A7K5BG7UZEHeu+KwJkbw4kCJmD+CShG0RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46288d5677900e31eb08f63c832b0825f9edd76d936aea1ce6ac7c66a88e1f5f","last_reissued_at":"2026-05-18T01:10:41.690641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:41.690641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Jacob Holm, Mathias B{\\ae}k Tejs Knudsen, Mikkel Abrahamsen, Morten St\\\"ockel, Stephen Alstrup","submitted_at":"2016-07-17T19:45:01Z","abstract_excerpt":"A graph $U$ is an induced universal graph for a family $F$ of graphs if every graph in $F$ is a vertex-induced subgraph of $U$. For the family of all undirected graphs on $n$ vertices Alstrup, Kaplan, Thorup, and Zwick [STOC 2015] give an induced universal graph with $O\\!\\left(2^{n/2}\\right)$ vertices, matching a lower bound by Moon [Proc. Glasgow Math. Assoc. 1965].\n  Let $k= \\lceil D/2 \\rceil$. Improving asymptotically on previous results by Butler [Graphs and Combinatorics 2009] and Esperet, Arnaud and Ochem [IPL 2008], we give an induced universal graph with $O\\!\\left(\\frac{k2^k}{k!}n^k \\r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04911","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":""},"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":"1607.04911","created_at":"2026-05-18T01:10:41.690719+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.04911v2","created_at":"2026-05-18T01:10:41.690719+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04911","created_at":"2026-05-18T01:10:41.690719+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYUI2VTXSAHD","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYUI2VTXSAHDD2YI","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYUI2VTX","created_at":"2026-05-18T12:30:22.444734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX","json":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX.json","graph_json":"https://pith.science/api/pith-number/IYUI2VTXSAHDD2YI6Y6IGKYIEX/graph.json","events_json":"https://pith.science/api/pith-number/IYUI2VTXSAHDD2YI6Y6IGKYIEX/events.json","paper":"https://pith.science/paper/IYUI2VTX"},"agent_actions":{"view_html":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX","download_json":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX.json","view_paper":"https://pith.science/paper/IYUI2VTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.04911&json=true","fetch_graph":"https://pith.science/api/pith-number/IYUI2VTXSAHDD2YI6Y6IGKYIEX/graph.json","fetch_events":"https://pith.science/api/pith-number/IYUI2VTXSAHDD2YI6Y6IGKYIEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX/action/storage_attestation","attest_author":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX/action/author_attestation","sign_citation":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX/action/citation_signature","submit_replication":"https://pith.science/pith/IYUI2VTXSAHDD2YI6Y6IGKYIEX/action/replication_record"}},"created_at":"2026-05-18T01:10:41.690719+00:00","updated_at":"2026-05-18T01:10:41.690719+00:00"}