{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UCBYAEVN42LR2UEQ3WWEYOVHJS","short_pith_number":"pith:UCBYAEVN","canonical_record":{"source":{"id":"1504.02243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T10:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"c19145af08e679d7b62d4e3defd20eb8759e56864d210f4bce8f741ae5807ff5","abstract_canon_sha256":"100592987b7dd019d329b2557620ad336926c5a9d95b2f3af743ed2a84d5e71b"},"schema_version":"1.0"},"canonical_sha256":"a0838012ade6971d5090ddac4c3aa74c8b3e442b8a8b41209615a28b54713779","source":{"kind":"arxiv","id":"1504.02243","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02243","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02243v2","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02243","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"UCBYAEVN42LR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCBYAEVN42LR2UEQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCBYAEVN","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UCBYAEVN42LR2UEQ3WWEYOVHJS","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02243","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T10:23:50Z","cross_cats_sorted":[],"title_canon_sha256":"c19145af08e679d7b62d4e3defd20eb8759e56864d210f4bce8f741ae5807ff5","abstract_canon_sha256":"100592987b7dd019d329b2557620ad336926c5a9d95b2f3af743ed2a84d5e71b"},"schema_version":"1.0"},"canonical_sha256":"a0838012ade6971d5090ddac4c3aa74c8b3e442b8a8b41209615a28b54713779","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:07.585368Z","signature_b64":"dVYvh6+4eQGZaIFYD+VEkvVAD7GgY6OgvHBPuKQ4YIfAzcKcib1fkuqIICrDnCsIhCZqN7QngZuG8UxMY39uBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0838012ade6971d5090ddac4c3aa74c8b3e442b8a8b41209615a28b54713779","last_reissued_at":"2026-05-18T02:19:07.584885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:07.584885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02243","source_version":2,"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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5SDA9uXdFWD2ldpE2ESda8plNBk3ftHsk6hkuzH9IeF/eAEoyjY7y6q2LpRAWgL+ppuPYpN6tW1cJ4wMYm4qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:07:50.541980Z"},"content_sha256":"f010bb205cd0973af2067151df5cba7942cc0e4275e7271497b99fc39c0c161d","schema_version":"1.0","event_id":"sha256:f010bb205cd0973af2067151df5cba7942cc0e4275e7271497b99fc39c0c161d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UCBYAEVN42LR2UEQ3WWEYOVHJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spanning structures and universality in sparse hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Olaf Parczyk, Yury Person","submitted_at":"2015-04-09T10:23:50Z","abstract_excerpt":"In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2, 125-148] can be adapted from random graphs to random $r$-uniform hypergaphs and provide sufficient conditions when a random $r$-uniform hypergraph $\\mathcal{H}^{(r)}(n,p)$ contains a given spanning structure a.a.s. We also discuss several spanning structures such as cube-hypergraphs, lattices, spheres and Hamilton cycles in hypergraphs.\n  Moreover, we study univ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02243","kind":"arxiv","version":2},"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-18T02:19:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPhMzXMBAErO0rQsrwCnVCspLmYZbwGO/VhbaZY00DAEKViJFuIwZHRIN9xIJXb7WyoZ1XB4RYZImHUM32/NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T21:07:50.542713Z"},"content_sha256":"917de3b1491aa7883a9666b3b140a7c7b7bc7d5963e0cfeb8cc3fc3bb797408d","schema_version":"1.0","event_id":"sha256:917de3b1491aa7883a9666b3b140a7c7b7bc7d5963e0cfeb8cc3fc3bb797408d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/bundle.json","state_url":"https://pith.science/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/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-09T21:07:50Z","links":{"resolver":"https://pith.science/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS","bundle":"https://pith.science/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/bundle.json","state":"https://pith.science/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UCBYAEVN42LR2UEQ3WWEYOVHJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UCBYAEVN42LR2UEQ3WWEYOVHJS","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":"100592987b7dd019d329b2557620ad336926c5a9d95b2f3af743ed2a84d5e71b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T10:23:50Z","title_canon_sha256":"c19145af08e679d7b62d4e3defd20eb8759e56864d210f4bce8f741ae5807ff5"},"schema_version":"1.0","source":{"id":"1504.02243","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02243","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02243v2","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02243","created_at":"2026-05-18T02:19:07Z"},{"alias_kind":"pith_short_12","alias_value":"UCBYAEVN42LR","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UCBYAEVN42LR2UEQ","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UCBYAEVN","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:917de3b1491aa7883a9666b3b140a7c7b7bc7d5963e0cfeb8cc3fc3bb797408d","target":"graph","created_at":"2026-05-18T02:19:07Z","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":"In this paper the problem of finding various spanning structures in random hypergraphs is studied. We notice that a general result of Riordan [Spanning subgraphs of random graphs, Combinatorics, Probability & Computing 9 (2000), no. 2, 125-148] can be adapted from random graphs to random $r$-uniform hypergaphs and provide sufficient conditions when a random $r$-uniform hypergraph $\\mathcal{H}^{(r)}(n,p)$ contains a given spanning structure a.a.s. We also discuss several spanning structures such as cube-hypergraphs, lattices, spheres and Hamilton cycles in hypergraphs.\n  Moreover, we study univ","authors_text":"Olaf Parczyk, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T10:23:50Z","title":"Spanning structures and universality in sparse hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02243","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:f010bb205cd0973af2067151df5cba7942cc0e4275e7271497b99fc39c0c161d","target":"record","created_at":"2026-05-18T02:19:07Z","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":"100592987b7dd019d329b2557620ad336926c5a9d95b2f3af743ed2a84d5e71b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-09T10:23:50Z","title_canon_sha256":"c19145af08e679d7b62d4e3defd20eb8759e56864d210f4bce8f741ae5807ff5"},"schema_version":"1.0","source":{"id":"1504.02243","kind":"arxiv","version":2}},"canonical_sha256":"a0838012ade6971d5090ddac4c3aa74c8b3e442b8a8b41209615a28b54713779","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0838012ade6971d5090ddac4c3aa74c8b3e442b8a8b41209615a28b54713779","first_computed_at":"2026-05-18T02:19:07.584885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:07.584885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVYvh6+4eQGZaIFYD+VEkvVAD7GgY6OgvHBPuKQ4YIfAzcKcib1fkuqIICrDnCsIhCZqN7QngZuG8UxMY39uBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:07.585368Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02243","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f010bb205cd0973af2067151df5cba7942cc0e4275e7271497b99fc39c0c161d","sha256:917de3b1491aa7883a9666b3b140a7c7b7bc7d5963e0cfeb8cc3fc3bb797408d"],"state_sha256":"890478b40fb16092f556236557c130636466162b0f43e02dc5d2a3ac022f88a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cJ5F/GT5JJ+wyFrcsDeQ+U3e71bFUp/fxlKgVazXQgfsjY+1Rs2vjz9lcAvitzI3EfeeMJiZZvRvg+pWYVjlCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T21:07:50.546784Z","bundle_sha256":"c98100655adc055a90957a73b9d65a1b2795c17c0e3b86dc718174366bca407d"}}