{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:B546OLTUPARL4LXXJZXQFVQT6A","short_pith_number":"pith:B546OLTU","schema_version":"1.0","canonical_sha256":"0f79e72e747822be2ef74e6f02d613f021caded47a67b0871a14d1173b3edc97","source":{"kind":"arxiv","id":"2605.13567","version":1},"attestation_state":"computed","paper":{"title":"The number $4/9$ is a non-jump for $3$-graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The number 4/9 is a non-jump for 3-uniform hypergraphs.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Xizhi Liu","submitted_at":"2026-05-13T14:05:39Z","abstract_excerpt":"We prove that $4/9$ is a non-jump for $3$-uniform hypergraphs. Our construction perturbs the $ABB$ pattern by inserting, inside the $B$-part, the union of a high-cogirth pair of Steiner triple systems. This goes below the barrier for non-jumps obtainable by Shaw's finite-pattern formulation of the Frankl--R\\\"odl method introduced in 1984. All results employing this approach use patterns where one of the parts has complete shadow. As the $ABB$ pattern is the smallest one with this property, the value $4/9$ is the natural barrier using this technique, and we conjecture that $4/9$ is the smallest"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.13567","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-13T14:05:39Z","cross_cats_sorted":[],"title_canon_sha256":"1a0740d54f46dc0694ee24c77316ae1808f1beb3590a17b22598dbc03a96a6f9","abstract_canon_sha256":"b0dcbb9b48e236f356d73afadc329a67f296059a009edbea30473e2c0fbb45f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:23.415430Z","signature_b64":"oIGvnsum14bC9FR0MJTmQddg0Gk0xs5jgZKR07DRNEvaknh+6E9xfBCOfPOcYJ2/XQDbRQqobGe1RkrMRLj9CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f79e72e747822be2ef74e6f02d613f021caded47a67b0871a14d1173b3edc97","last_reissued_at":"2026-05-18T02:44:23.414866Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:23.414866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number $4/9$ is a non-jump for $3$-graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The number 4/9 is a non-jump for 3-uniform hypergraphs.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dhruv Mubayi, Xizhi Liu","submitted_at":"2026-05-13T14:05:39Z","abstract_excerpt":"We prove that $4/9$ is a non-jump for $3$-uniform hypergraphs. Our construction perturbs the $ABB$ pattern by inserting, inside the $B$-part, the union of a high-cogirth pair of Steiner triple systems. This goes below the barrier for non-jumps obtainable by Shaw's finite-pattern formulation of the Frankl--R\\\"odl method introduced in 1984. All results employing this approach use patterns where one of the parts has complete shadow. As the $ABB$ pattern is the smallest one with this property, the value $4/9$ is the natural barrier using this technique, and we conjecture that $4/9$ is the smallest"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that 4/9 is a non-jump for 3-uniform hypergraphs.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That inserting the union of a high-cogirth pair of Steiner triple systems into the B-part of the ABB pattern produces a valid construction achieving the non-jump property at 4/9.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"4/9 is a non-jump for 3-graphs via a perturbed ABB construction inserting high-cogirth pairs of Steiner triple systems.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The number 4/9 is a non-jump for 3-uniform hypergraphs.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"568c421408d278550120626f082d1693f651551e0984597f862ff44c1084d1e9"},"source":{"id":"2605.13567","kind":"arxiv","version":1},"verdict":{"id":"88a06edb-b63c-42be-9160-d815158e0797","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T18:39:27.037216Z","strongest_claim":"We prove that 4/9 is a non-jump for 3-uniform hypergraphs.","one_line_summary":"4/9 is a non-jump for 3-graphs via a perturbed ABB construction inserting high-cogirth pairs of Steiner triple systems.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That inserting the union of a high-cogirth pair of Steiner triple systems into the B-part of the ABB pattern produces a valid construction achieving the non-jump property at 4/9.","pith_extraction_headline":"The number 4/9 is a non-jump for 3-uniform hypergraphs."},"references":{"count":35,"sample":[{"doi":"","year":2011,"title":"R. Baber and J. Talbot. Hypergraphs do jump.Combin. Probab. Comput., 20(2):161–171, 2011","work_id":"674a2c85-3f8d-47b7-a8de-26e729724123","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"T. Bohman and L. Warnke. Large girth approximate Steiner triple systems.J. Lond. Math. Soc. (2), 100(3):895–913, 2019","work_id":"03a9c2ec-8712-4700-bb21-481af78d55be","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1984,"title":"W. G. Brown and M. Simonovits. Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures.Discrete Math., 48(2–3):147–162, 1984","work_id":"2fd47c73-4b90-4370-9b90-e687f9949b94","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"M. Delcourt and L. Postle. Proof of the High Girth Existence Conjecture via refined absorption,","work_id":"c26a5107-8237-4fab-9777-cac4b70cdd29","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1964,"title":"P. Erdős. On extremal problems of graphs and generalized graphs.Israel J. Math., 2:183–190, 1964. 9","work_id":"8aed23f5-7048-4edf-8974-7677fa0dd660","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":35,"snapshot_sha256":"3e0a9827e01d4a2959896a7137cdc4e91c4b7adf4b817e0626e3af6741bec211","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":"2605.13567","created_at":"2026-05-18T02:44:23.414940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.13567v1","created_at":"2026-05-18T02:44:23.414940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13567","created_at":"2026-05-18T02:44:23.414940+00:00"},{"alias_kind":"pith_short_12","alias_value":"B546OLTUPARL","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"B546OLTUPARL4LXX","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"B546OLTU","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.25914","citing_title":"Intervals of hypergraph Tur\\'an densities","ref_index":25,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A","json":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A.json","graph_json":"https://pith.science/api/pith-number/B546OLTUPARL4LXXJZXQFVQT6A/graph.json","events_json":"https://pith.science/api/pith-number/B546OLTUPARL4LXXJZXQFVQT6A/events.json","paper":"https://pith.science/paper/B546OLTU"},"agent_actions":{"view_html":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A","download_json":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A.json","view_paper":"https://pith.science/paper/B546OLTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.13567&json=true","fetch_graph":"https://pith.science/api/pith-number/B546OLTUPARL4LXXJZXQFVQT6A/graph.json","fetch_events":"https://pith.science/api/pith-number/B546OLTUPARL4LXXJZXQFVQT6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A/action/storage_attestation","attest_author":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A/action/author_attestation","sign_citation":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A/action/citation_signature","submit_replication":"https://pith.science/pith/B546OLTUPARL4LXXJZXQFVQT6A/action/replication_record"}},"created_at":"2026-05-18T02:44:23.414940+00:00","updated_at":"2026-05-18T02:44:23.414940+00:00"}