{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ZBL46QJTMRPN6AWC24LTM3XQHZ","short_pith_number":"pith:ZBL46QJT","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"},"canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","source":{"kind":"arxiv","id":"1509.03983","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03983","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03983v3","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03983","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZBL46QJTMRPN","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZBL46QJTMRPN6AWC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZBL46QJT","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ZBL46QJTMRPN6AWC24LTM3XQHZ","target":"record","payload":{"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"},"canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","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"},"source_kind":"arxiv","source_id":"1509.03983","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"In2SS6Swh+ZX+ucdvdthDbdZC+a8HJ3Gby2wShq9SwpO/BUOWN1EygVcTSHhGQUNRLS9NRgDXskNhHv+qWWQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:35:33.747511Z"},"content_sha256":"14c18a5faa4ae2f95a4754fcefad190dc99a2c8a028473ac830a1b2477f0e233","schema_version":"1.0","event_id":"sha256:14c18a5faa4ae2f95a4754fcefad190dc99a2c8a028473ac830a1b2477f0e233"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ZBL46QJTMRPN6AWC24LTM3XQHZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:14:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t+mGyZQCoyZyG/7dU6Yjfdnr4D/DPRlueLbDFuZPsTw01U0PdG4Y+huxrwmalJTbnh19isEeuT0Ve/MQ14oaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:35:33.747863Z"},"content_sha256":"55061607dc0d1ff8bdce70e9277cfa29a9aa01c795095e702449f79103f297a4","schema_version":"1.0","event_id":"sha256:55061607dc0d1ff8bdce70e9277cfa29a9aa01c795095e702449f79103f297a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/bundle.json","state_url":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T14:35:33Z","links":{"resolver":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ","bundle":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/bundle.json","state":"https://pith.science/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBL46QJTMRPN6AWC24LTM3XQHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ZBL46QJTMRPN6AWC24LTM3XQHZ","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":"b2fb8c8305754f7938d92e155b1a7bc563234f44ee2fa234289eafe80e1fb835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-14T08:16:44Z","title_canon_sha256":"69528e06add28db13beacaa2b3e575840c65676ba621609b16608d49daf64a7d"},"schema_version":"1.0","source":{"id":"1509.03983","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03983","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03983v3","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03983","created_at":"2026-05-18T01:14:58Z"},{"alias_kind":"pith_short_12","alias_value":"ZBL46QJTMRPN","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZBL46QJTMRPN6AWC","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZBL46QJT","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:55061607dc0d1ff8bdce70e9277cfa29a9aa01c795095e702449f79103f297a4","target":"graph","created_at":"2026-05-18T01:14:58Z","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 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 ","authors_text":"Olaf Parczyk, Samuel Hetterich, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-14T08:16:44Z","title":"On universal hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03983","kind":"arxiv","version":3},"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:14c18a5faa4ae2f95a4754fcefad190dc99a2c8a028473ac830a1b2477f0e233","target":"record","created_at":"2026-05-18T01:14:58Z","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":"b2fb8c8305754f7938d92e155b1a7bc563234f44ee2fa234289eafe80e1fb835","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-14T08:16:44Z","title_canon_sha256":"69528e06add28db13beacaa2b3e575840c65676ba621609b16608d49daf64a7d"},"schema_version":"1.0","source":{"id":"1509.03983","kind":"arxiv","version":3}},"canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c857cf4133645edf02c2d717366ef03e72581606fc5585ba06a3269cb3e0a48d","first_computed_at":"2026-05-18T01:14:58.848451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:58.848451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kprw3BCiCAXQkE+EAR2dli/K0Nstwvm7dTofh6Jd2bLR5tL7GsqGSHxU+lC5M5JsPWvjjBOjv5DwR3qKc17NCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:58.849016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03983","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14c18a5faa4ae2f95a4754fcefad190dc99a2c8a028473ac830a1b2477f0e233","sha256:55061607dc0d1ff8bdce70e9277cfa29a9aa01c795095e702449f79103f297a4"],"state_sha256":"a0e1009cc2d2bdb6bffe4273b367f06b7672669649bc77680120843e4d3f4749"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7tT1x5W+V9Luyh82hg43KtoampU7Q00teLSgGPJmA8dQy2Pw7Y0Xl8Tj0XBimji8/xLdNFF8WtB7bMZmuvvwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:35:33.749828Z","bundle_sha256":"844dae75d410e52e1891d5abf4f53b6829c4461cedb1658192ce694a4ea7d5ec"}}