{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HFQJM7JM72MIMUM2ZOTCACDJSA","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":"b560127dc9e8622c472917017614acdfdca24a46eed960069d75bf677837be23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T16:14:56Z","title_canon_sha256":"c9b9e255ecdefe3983177f62976e823288282f809dee5bf9a046cabdf0b1115f"},"schema_version":"1.0","source":{"id":"1108.4647","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4647","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4647v1","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4647","created_at":"2026-05-18T04:14:54Z"},{"alias_kind":"pith_short_12","alias_value":"HFQJM7JM72MI","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HFQJM7JM72MIMUM2","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HFQJM7JM","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:5e4798a4060a461043584c180eab5deb51029f451bc1cb12c228ba58e0892d8e","target":"graph","created_at":"2026-05-18T04:14:54Z","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":"Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs for various families F has received a considerable amount of attention. One is particularly interested in tight F-universal graphs, i.e., graphs whose number of vertices is equal to the largest number of vertices in a graph from F. Arguably, the most studied case is that when F is some class of trees.\n  Given integers n and \\Delta, we denote by T(n,\\Delta) the class of all n-vertex trees with maximum degree at most \\De","authors_text":"Daniel Johannsen, Michael Krivelevich, Wojciech Samotij","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T16:14:56Z","title":"Expanders Are Universal for the Class of All Spanning Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4647","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:7447396af84d233d96968928d921168a668bc68044cb274629e0335f509b7f99","target":"record","created_at":"2026-05-18T04:14:54Z","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":"b560127dc9e8622c472917017614acdfdca24a46eed960069d75bf677837be23","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T16:14:56Z","title_canon_sha256":"c9b9e255ecdefe3983177f62976e823288282f809dee5bf9a046cabdf0b1115f"},"schema_version":"1.0","source":{"id":"1108.4647","kind":"arxiv","version":1}},"canonical_sha256":"3960967d2cfe9886519acba62008699021597696a2b5af5af4607743fa48402b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3960967d2cfe9886519acba62008699021597696a2b5af5af4607743fa48402b","first_computed_at":"2026-05-18T04:14:54.029714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:54.029714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xil16kvL3ylvLJxt/mYh3p3uKhkN0aVirJDkl6eptps4QghSLWQqg0Srz4OXY4Gjj2SlK16Yj7HL+4p/7/pfCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:54.030135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4647","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7447396af84d233d96968928d921168a668bc68044cb274629e0335f509b7f99","sha256:5e4798a4060a461043584c180eab5deb51029f451bc1cb12c228ba58e0892d8e"],"state_sha256":"d56b79fbe26687366f0e92688de43c4863f8b61fec891e980517274069f1e4e0"}