{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IH6B33DUSUDWXBY67ZGNG5SUWL","short_pith_number":"pith:IH6B33DU","schema_version":"1.0","canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","source":{"kind":"arxiv","id":"2507.04579","version":2},"attestation_state":"computed","paper":{"title":"Hypergraph Tur\\'an problem of the generalized triangle with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Weihua Yang, Wenbin Wang","submitted_at":"2025-07-06T23:51:05Z","abstract_excerpt":"Let $\\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $\\nu(\\mathcal{H})$ is defined as the maximum number of disjoint edges in $\\mathcal{H}$. The generalized triangle $F_5$ is a 3-graph on the vertex set $\\{a,b,c,d,e\\}$ with the edge set $\\{abc, abd,cde\\}$. In this paper, we showed that an $F_5$-free 3-graph $\\mathcal{H}$ with matching number at most $s$ has at most $s\\lfloor (n-s)^2/4\\rfloor$ edges for $n\\geq 30(s+1)$ and $s\\geq 3$. For the proof, we establish a 2-colored version of Mantel's theorem, which may be of independent interests."},"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":"2507.04579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-06T23:51:05Z","cross_cats_sorted":[],"title_canon_sha256":"243b9d804ab76312f3320241ccf05af9009ee44083033dff5390d940dce6d162","abstract_canon_sha256":"830a353e6c96fba464ac04134956a8c307d04719d30751c194b357faaf7a1094"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:41:43.941185Z","signature_b64":"PLY0tEkpWz+dpVQB20lJ1ZaMPLljSNxZU3fkfPjl34yZivgTCsG8+tzlG1rZsJfVQNsXCv2JFGKXvXbcDrDuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","last_reissued_at":"2026-07-05T11:41:43.940711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:41:43.940711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Tur\\'an problem of the generalized triangle with bounded matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Weihua Yang, Wenbin Wang","submitted_at":"2025-07-06T23:51:05Z","abstract_excerpt":"Let $\\mathcal{H}$ be a 3-graph on $n$ vertices. The matching number $\\nu(\\mathcal{H})$ is defined as the maximum number of disjoint edges in $\\mathcal{H}$. The generalized triangle $F_5$ is a 3-graph on the vertex set $\\{a,b,c,d,e\\}$ with the edge set $\\{abc, abd,cde\\}$. In this paper, we showed that an $F_5$-free 3-graph $\\mathcal{H}$ with matching number at most $s$ has at most $s\\lfloor (n-s)^2/4\\rfloor$ edges for $n\\geq 30(s+1)$ and $s\\geq 3$. For the proof, we establish a 2-colored version of Mantel's theorem, which may be of independent interests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04579","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.04579/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.04579","created_at":"2026-07-05T11:41:43.940768+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04579v2","created_at":"2026-07-05T11:41:43.940768+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04579","created_at":"2026-07-05T11:41:43.940768+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH6B33DUSUDW","created_at":"2026-07-05T11:41:43.940768+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH6B33DUSUDWXBY6","created_at":"2026-07-05T11:41:43.940768+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH6B33DU","created_at":"2026-07-05T11:41:43.940768+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/IH6B33DUSUDWXBY67ZGNG5SUWL","json":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL.json","graph_json":"https://pith.science/api/pith-number/IH6B33DUSUDWXBY67ZGNG5SUWL/graph.json","events_json":"https://pith.science/api/pith-number/IH6B33DUSUDWXBY67ZGNG5SUWL/events.json","paper":"https://pith.science/paper/IH6B33DU"},"agent_actions":{"view_html":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL","download_json":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL.json","view_paper":"https://pith.science/paper/IH6B33DU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04579&json=true","fetch_graph":"https://pith.science/api/pith-number/IH6B33DUSUDWXBY67ZGNG5SUWL/graph.json","fetch_events":"https://pith.science/api/pith-number/IH6B33DUSUDWXBY67ZGNG5SUWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/action/storage_attestation","attest_author":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/action/author_attestation","sign_citation":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/action/citation_signature","submit_replication":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/action/replication_record"}},"created_at":"2026-07-05T11:41:43.940768+00:00","updated_at":"2026-07-05T11:41:43.940768+00:00"}