{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZBL46QJTMRPN6AWC24LTM3XQHZ","short_pith_number":"pith:ZBL46QJT","schema_version":"1.0","canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","source":{"kind":"arxiv","id":"1509.03983","version":3},"attestation_state":"computed","paper":{"title":"On universal hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olaf Parczyk, Samuel Hetterich, Yury Person","submitted_at":"2015-09-14T08:16:44Z","abstract_excerpt":"A hypergraph $H$ is called universal for a family $\\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \\in \\mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\\Omega(n^{r-r/\\Delta})$ many edges. We exploit constructions of Alon and Capalbo to obtain universal $r$-uniform hypergraphs with the optimal number of edges $O(n^{r-r/\\Delta})$ when $r$ is even, $r \\mid \\Delta$ or $\\Delta=2$. Further we generalize the result of Alon and Asodi about optimal universal "},"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":"1509.03983","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-14T08:16:44Z","cross_cats_sorted":[],"title_canon_sha256":"69528e06add28db13beacaa2b3e575840c65676ba621609b16608d49daf64a7d","abstract_canon_sha256":"b2fb8c8305754f7938d92e155b1a7bc563234f44ee2fa234289eafe80e1fb835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.849016Z","signature_b64":"Kprw3BCiCAXQkE+EAR2dli/K0Nstwvm7dTofh6Jd2bLR5tL7GsqGSHxU+lC5M5JsPWvjjBOjv5DwR3qKc17NCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","last_reissued_at":"2026-05-18T01:14:58.848451Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.848451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On universal hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olaf Parczyk, Samuel Hetterich, Yury Person","submitted_at":"2015-09-14T08:16:44Z","abstract_excerpt":"A hypergraph $H$ is called universal for a family $\\mathcal{F}$ of hypergraphs, if it contains every hypergraph $F \\in \\mathcal{F}$ as a copy. For the family of $r$-uniform hypergraphs with maximum vertex degree bounded by $\\Delta$ and at most $n$ vertices any universal hypergraph has to contain $\\Omega(n^{r-r/\\Delta})$ many edges. We exploit constructions of Alon and Capalbo to obtain universal $r$-uniform hypergraphs with the optimal number of edges $O(n^{r-r/\\Delta})$ when $r$ is even, $r \\mid \\Delta$ or $\\Delta=2$. Further we generalize the result of Alon and Asodi about optimal universal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03983","kind":"arxiv","version":3},"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":"1509.03983","created_at":"2026-05-18T01:14:58.848536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03983v3","created_at":"2026-05-18T01:14:58.848536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03983","created_at":"2026-05-18T01:14:58.848536+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBL46QJTMRPN","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBL46QJTMRPN6AWC","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBL46QJT","created_at":"2026-05-18T12:29:52.810259+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/ZBL46QJTMRPN6AWC24LTM3XQHZ","json":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ.json","graph_json":"https://pith.science/api/pith-number/ZBL46QJTMRPN6AWC24LTM3XQHZ/graph.json","events_json":"https://pith.science/api/pith-number/ZBL46QJTMRPN6AWC24LTM3XQHZ/events.json","paper":"https://pith.science/paper/ZBL46QJT"},"agent_actions":{"view_html":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ","download_json":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ.json","view_paper":"https://pith.science/paper/ZBL46QJT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03983&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBL46QJTMRPN6AWC24LTM3XQHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBL46QJTMRPN6AWC24LTM3XQHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/action/replication_record"}},"created_at":"2026-05-18T01:14:58.848536+00:00","updated_at":"2026-05-18T01:14:58.848536+00:00"}