{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JYIFX4XTZNVMOVXFZAPKMGJC5C","short_pith_number":"pith:JYIFX4XT","canonical_record":{"source":{"id":"1502.00486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T14:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"71174e44ac7fcf46f49bf8657d9589aab387640eb35fe4a2dc7dff8aa6f11f5a","abstract_canon_sha256":"768ba5ce399d5298930ddca130bf5ef2ed45f92a434c7811c2f32a7adabceeb8"},"schema_version":"1.0"},"canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","source":{"kind":"arxiv","id":"1502.00486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00486","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00486v1","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00486","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"JYIFX4XTZNVM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JYIFX4XTZNVMOVXF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JYIFX4XT","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JYIFX4XTZNVMOVXFZAPKMGJC5C","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T14:14:45Z","cross_cats_sorted":[],"title_canon_sha256":"71174e44ac7fcf46f49bf8657d9589aab387640eb35fe4a2dc7dff8aa6f11f5a","abstract_canon_sha256":"768ba5ce399d5298930ddca130bf5ef2ed45f92a434c7811c2f32a7adabceeb8"},"schema_version":"1.0"},"canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:05.920262Z","signature_b64":"SMqZ+zHd3LlgllDoK46xibveXwX/eIWJr+ruQ4R+OUTGt7KGDlWGKV91l6wOkelt0ZHXE3TA3dYnr1KXvL0/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","last_reissued_at":"2026-05-18T02:28:05.919907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:05.919907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00486","source_version":1,"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:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IX2jKrkNVyu2rNaJ2v2fgxsAnGBl4n3eKxg8hT0nPbMzhxcFrrKKL/uxh2zyLVbc2NT7HkiFsKxJbKEpGuhMCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:33:29.171351Z"},"content_sha256":"05065220b16af698a7d583a6ef589b793905bde896fa01128fbf1fbd958055ae","schema_version":"1.0","event_id":"sha256:05065220b16af698a7d583a6ef589b793905bde896fa01128fbf1fbd958055ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JYIFX4XTZNVMOVXFZAPKMGJC5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the random greedy F-free hypergraph process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amelia Taylor, Daniela K\\\"uhn, Deryk Osthus","submitted_at":"2015-02-02T14:14:45Z","abstract_excerpt":"Let $F$ be a strictly $k$-balanced $k$-uniform hypergraph with $e(F)\\geq |F|-k+1$ and maximum co-degree at least two. The random greedy $F$-free process constructs a maximal $F$-free hypergraph as follows. Consider a random ordering of the hyperedges of the complete $k$-uniform hypergraph $K_n^k$ on $n$ vertices. Start with the empty hypergraph on $n$ vertices. Successively consider the hyperedges $e$ of $K_n^k$ in the given ordering, and add $e$ to the existing hypergraph provided that $e$ does not create a copy of $F$. We show that asymptotically almost surely this process terminates at a hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00486","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"},"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:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KpIHq6bttLJXFgf69Jbjk0wbUOSRKZLPcsTWQsf2Oh2JfOzkUwJTkk/80BON5RSPPOtL/ByZLF727W6WHYOBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:33:29.171711Z"},"content_sha256":"20a25117607197f368fafb5a6fc32d42d276bb7074d58de140244a8cc43d83b1","schema_version":"1.0","event_id":"sha256:20a25117607197f368fafb5a6fc32d42d276bb7074d58de140244a8cc43d83b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/bundle.json","state_url":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/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-24T04:33:29Z","links":{"resolver":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C","bundle":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/bundle.json","state":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JYIFX4XTZNVMOVXFZAPKMGJC5C","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":"768ba5ce399d5298930ddca130bf5ef2ed45f92a434c7811c2f32a7adabceeb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T14:14:45Z","title_canon_sha256":"71174e44ac7fcf46f49bf8657d9589aab387640eb35fe4a2dc7dff8aa6f11f5a"},"schema_version":"1.0","source":{"id":"1502.00486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00486","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00486v1","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00486","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"JYIFX4XTZNVM","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JYIFX4XTZNVMOVXF","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JYIFX4XT","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:20a25117607197f368fafb5a6fc32d42d276bb7074d58de140244a8cc43d83b1","target":"graph","created_at":"2026-05-18T02:28:05Z","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":"Let $F$ be a strictly $k$-balanced $k$-uniform hypergraph with $e(F)\\geq |F|-k+1$ and maximum co-degree at least two. The random greedy $F$-free process constructs a maximal $F$-free hypergraph as follows. Consider a random ordering of the hyperedges of the complete $k$-uniform hypergraph $K_n^k$ on $n$ vertices. Start with the empty hypergraph on $n$ vertices. Successively consider the hyperedges $e$ of $K_n^k$ in the given ordering, and add $e$ to the existing hypergraph provided that $e$ does not create a copy of $F$. We show that asymptotically almost surely this process terminates at a hy","authors_text":"Amelia Taylor, Daniela K\\\"uhn, Deryk Osthus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T14:14:45Z","title":"On the random greedy F-free hypergraph process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00486","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:05065220b16af698a7d583a6ef589b793905bde896fa01128fbf1fbd958055ae","target":"record","created_at":"2026-05-18T02:28:05Z","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":"768ba5ce399d5298930ddca130bf5ef2ed45f92a434c7811c2f32a7adabceeb8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-02T14:14:45Z","title_canon_sha256":"71174e44ac7fcf46f49bf8657d9589aab387640eb35fe4a2dc7dff8aa6f11f5a"},"schema_version":"1.0","source":{"id":"1502.00486","kind":"arxiv","version":1}},"canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","first_computed_at":"2026-05-18T02:28:05.919907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:05.919907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SMqZ+zHd3LlgllDoK46xibveXwX/eIWJr+ruQ4R+OUTGt7KGDlWGKV91l6wOkelt0ZHXE3TA3dYnr1KXvL0/Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:05.920262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:05065220b16af698a7d583a6ef589b793905bde896fa01128fbf1fbd958055ae","sha256:20a25117607197f368fafb5a6fc32d42d276bb7074d58de140244a8cc43d83b1"],"state_sha256":"bad57fe7e3c59cb1f2b15c4dd98ab4490809aa2eee01825efdb7b465b78621bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwtCa86S7aFvt6f+7bQc6X2DzQqMaes3mAsG8eQ06yKj4KMBrQI7LCfkvu8Bh66dHsD11n5mpLfPs56NXgiFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:33:29.174030Z","bundle_sha256":"531af6cf9516145468a613e175765f0d1265630aa47e0d512600ed9873609582"}}