{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HFQJM7JM72MIMUM2ZOTCACDJSA","short_pith_number":"pith:HFQJM7JM","schema_version":"1.0","canonical_sha256":"3960967d2cfe9886519acba62008699021597696a2b5af5af4607743fa48402b","source":{"kind":"arxiv","id":"1108.4647","version":1},"attestation_state":"computed","paper":{"title":"Expanders Are Universal for the Class of All Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Johannsen, Michael Krivelevich, Wojciech Samotij","submitted_at":"2011-08-23T16:14:56Z","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"},"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":"1108.4647","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-08-23T16:14:56Z","cross_cats_sorted":[],"title_canon_sha256":"c9b9e255ecdefe3983177f62976e823288282f809dee5bf9a046cabdf0b1115f","abstract_canon_sha256":"b560127dc9e8622c472917017614acdfdca24a46eed960069d75bf677837be23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:54.030135Z","signature_b64":"xil16kvL3ylvLJxt/mYh3p3uKhkN0aVirJDkl6eptps4QghSLWQqg0Srz4OXY4Gjj2SlK16Yj7HL+4p/7/pfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3960967d2cfe9886519acba62008699021597696a2b5af5af4607743fa48402b","last_reissued_at":"2026-05-18T04:14:54.029714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:54.029714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expanders Are Universal for the Class of All Spanning Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel Johannsen, Michael Krivelevich, Wojciech Samotij","submitted_at":"2011-08-23T16:14:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4647","kind":"arxiv","version":1},"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":"1108.4647","created_at":"2026-05-18T04:14:54.029783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.4647v1","created_at":"2026-05-18T04:14:54.029783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4647","created_at":"2026-05-18T04:14:54.029783+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFQJM7JM72MI","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFQJM7JM72MIMUM2","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFQJM7JM","created_at":"2026-05-18T12:26:30.835961+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/HFQJM7JM72MIMUM2ZOTCACDJSA","json":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA.json","graph_json":"https://pith.science/api/pith-number/HFQJM7JM72MIMUM2ZOTCACDJSA/graph.json","events_json":"https://pith.science/api/pith-number/HFQJM7JM72MIMUM2ZOTCACDJSA/events.json","paper":"https://pith.science/paper/HFQJM7JM"},"agent_actions":{"view_html":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA","download_json":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA.json","view_paper":"https://pith.science/paper/HFQJM7JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.4647&json=true","fetch_graph":"https://pith.science/api/pith-number/HFQJM7JM72MIMUM2ZOTCACDJSA/graph.json","fetch_events":"https://pith.science/api/pith-number/HFQJM7JM72MIMUM2ZOTCACDJSA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA/action/storage_attestation","attest_author":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA/action/author_attestation","sign_citation":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA/action/citation_signature","submit_replication":"https://pith.science/pith/HFQJM7JM72MIMUM2ZOTCACDJSA/action/replication_record"}},"created_at":"2026-05-18T04:14:54.029783+00:00","updated_at":"2026-05-18T04:14:54.029783+00:00"}