{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IH6B33DUSUDWXBY67ZGNG5SUWL","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":"830a353e6c96fba464ac04134956a8c307d04719d30751c194b357faaf7a1094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-06T23:51:05Z","title_canon_sha256":"243b9d804ab76312f3320241ccf05af9009ee44083033dff5390d940dce6d162"},"schema_version":"1.0","source":{"id":"2507.04579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.04579","created_at":"2026-07-05T11:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"2507.04579v2","created_at":"2026-07-05T11:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04579","created_at":"2026-07-05T11:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"IH6B33DUSUDW","created_at":"2026-07-05T11:41:43Z"},{"alias_kind":"pith_short_16","alias_value":"IH6B33DUSUDWXBY6","created_at":"2026-07-05T11:41:43Z"},{"alias_kind":"pith_short_8","alias_value":"IH6B33DU","created_at":"2026-07-05T11:41:43Z"}],"graph_snapshots":[{"event_id":"sha256:7cd98bf76eb5860c29982c9e68e1e1723447883a2516ecefb098f58f2f7bf66e","target":"graph","created_at":"2026-07-05T11:41:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.04579/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Jian Wang, Weihua Yang, Wenbin Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-06T23:51:05Z","title":"Hypergraph Tur\\'an problem of the generalized triangle with bounded matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04579","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:8fe980852aba30a424fc82cf973fc9bc34631bbaf96471fc1ee4ca2de08b0c6f","target":"record","created_at":"2026-07-05T11:41:43Z","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":"830a353e6c96fba464ac04134956a8c307d04719d30751c194b357faaf7a1094","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-06T23:51:05Z","title_canon_sha256":"243b9d804ab76312f3320241ccf05af9009ee44083033dff5390d940dce6d162"},"schema_version":"1.0","source":{"id":"2507.04579","kind":"arxiv","version":2}},"canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","first_computed_at":"2026-07-05T11:41:43.940711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:41:43.940711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PLY0tEkpWz+dpVQB20lJ1ZaMPLljSNxZU3fkfPjl34yZivgTCsG8+tzlG1rZsJfVQNsXCv2JFGKXvXbcDrDuCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:41:43.941185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.04579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fe980852aba30a424fc82cf973fc9bc34631bbaf96471fc1ee4ca2de08b0c6f","sha256:7cd98bf76eb5860c29982c9e68e1e1723447883a2516ecefb098f58f2f7bf66e"],"state_sha256":"3aee6a86fa9e5a1bd5daca3821549cf5e9ab47d83a87c72fa858d11e5eed5eae"}