{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IYUI2VTXSAHDD2YI6Y6IGKYIEX","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":"44f0a4b0d83ffb0c0d002388c7476ca3c33bde069d7d50fafeb6b16441892ffc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T19:45:01Z","title_canon_sha256":"f0704ae31ecb87287a00e48fed459d6bff50b93a11f3f2da30b7a156912e04d9"},"schema_version":"1.0","source":{"id":"1607.04911","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.04911","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.04911v2","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.04911","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"IYUI2VTXSAHD","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IYUI2VTXSAHDD2YI","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IYUI2VTX","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:b9f862f8dcd3d5b868454475f3b4ee3b40673eb7659be81d39cc5d415a745911","target":"graph","created_at":"2026-05-18T01:10:41Z","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":"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","authors_text":"Jacob Holm, Mathias B{\\ae}k Tejs Knudsen, Mikkel Abrahamsen, Morten St\\\"ockel, Stephen Alstrup","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T19:45:01Z","title":"Near-Optimal Induced Universal Graphs for Bounded Degree Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.04911","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:c62638e5bd476d399add46ce48c4845b7322a012dad26a92e523334fa8735566","target":"record","created_at":"2026-05-18T01:10:41Z","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":"44f0a4b0d83ffb0c0d002388c7476ca3c33bde069d7d50fafeb6b16441892ffc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-17T19:45:01Z","title_canon_sha256":"f0704ae31ecb87287a00e48fed459d6bff50b93a11f3f2da30b7a156912e04d9"},"schema_version":"1.0","source":{"id":"1607.04911","kind":"arxiv","version":2}},"canonical_sha256":"46288d5677900e31eb08f63c832b0825f9edd76d936aea1ce6ac7c66a88e1f5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46288d5677900e31eb08f63c832b0825f9edd76d936aea1ce6ac7c66a88e1f5f","first_computed_at":"2026-05-18T01:10:41.690641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:41.690641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2jCh+hRgywLtBvMM3uDToIRupxxNLMRcMPhf09MsLP06mvOfoz4A7K5BG7UZEHeu+KwJkbw4kCJmD+CShG0RCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:41.691225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.04911","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62638e5bd476d399add46ce48c4845b7322a012dad26a92e523334fa8735566","sha256:b9f862f8dcd3d5b868454475f3b4ee3b40673eb7659be81d39cc5d415a745911"],"state_sha256":"27c71eecd77fef4a484ebc1b45d6d72a934d2dcc10b51c8b82ae53a9312e3356"}