{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JYIFX4XTZNVMOVXFZAPKMGJC5C","short_pith_number":"pith:JYIFX4XT","schema_version":"1.0","canonical_sha256":"4e105bf2f3cb6ac756e5c81ea61922e8a43b1deed39fe67ebbc573d2e2e8362c","source":{"kind":"arxiv","id":"1502.00486","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.00486","created_at":"2026-05-18T02:28:05.919961+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00486v1","created_at":"2026-05-18T02:28:05.919961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00486","created_at":"2026-05-18T02:28:05.919961+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYIFX4XTZNVM","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYIFX4XTZNVMOVXF","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYIFX4XT","created_at":"2026-05-18T12:29:27.538025+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/JYIFX4XTZNVMOVXFZAPKMGJC5C","json":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C.json","graph_json":"https://pith.science/api/pith-number/JYIFX4XTZNVMOVXFZAPKMGJC5C/graph.json","events_json":"https://pith.science/api/pith-number/JYIFX4XTZNVMOVXFZAPKMGJC5C/events.json","paper":"https://pith.science/paper/JYIFX4XT"},"agent_actions":{"view_html":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C","download_json":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C.json","view_paper":"https://pith.science/paper/JYIFX4XT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00486&json=true","fetch_graph":"https://pith.science/api/pith-number/JYIFX4XTZNVMOVXFZAPKMGJC5C/graph.json","fetch_events":"https://pith.science/api/pith-number/JYIFX4XTZNVMOVXFZAPKMGJC5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/action/storage_attestation","attest_author":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/action/author_attestation","sign_citation":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/action/citation_signature","submit_replication":"https://pith.science/pith/JYIFX4XTZNVMOVXFZAPKMGJC5C/action/replication_record"}},"created_at":"2026-05-18T02:28:05.919961+00:00","updated_at":"2026-05-18T02:28:05.919961+00:00"}