{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IH6B33DUSUDWXBY67ZGNG5SUWL","short_pith_number":"pith:IH6B33DU","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"},"canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","source":{"kind":"arxiv","id":"2507.04579","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IH6B33DUSUDWXBY67ZGNG5SUWL","target":"record","payload":{"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"},"canonical_sha256":"41fc1dec7495076b871efe4cd37654b2f3cc0558b44f88c0870322a0aa39de1f","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"},"source_kind":"arxiv","source_id":"2507.04579","source_version":2,"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-07-05T11:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZTFUlJvpFF6ouFutQgXCfnNhwxputT0udT8fOyKcFzfpjKS067XEK5tvcGQz2pOZuR/MCT5M8O5OIrgfwEpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:52:58.822282Z"},"content_sha256":"8fe980852aba30a424fc82cf973fc9bc34631bbaf96471fc1ee4ca2de08b0c6f","schema_version":"1.0","event_id":"sha256:8fe980852aba30a424fc82cf973fc9bc34631bbaf96471fc1ee4ca2de08b0c6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IH6B33DUSUDWXBY67ZGNG5SUWL","target":"graph","payload":{"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"},"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-07-05T11:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eovaz9fkpzFpjUAM+f6zUL3mQXjeDyrF01J4tVcQjp7M/W2JNeOUaFpNi9gg1ZUSnJHvghJZBMl28oMU9clpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T13:52:58.822783Z"},"content_sha256":"7cd98bf76eb5860c29982c9e68e1e1723447883a2516ecefb098f58f2f7bf66e","schema_version":"1.0","event_id":"sha256:7cd98bf76eb5860c29982c9e68e1e1723447883a2516ecefb098f58f2f7bf66e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/bundle.json","state_url":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/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-08-05T13:52:58Z","links":{"resolver":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL","bundle":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/bundle.json","state":"https://pith.science/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IH6B33DUSUDWXBY67ZGNG5SUWL/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1ywxb5r8S9KUZ8uOel63DX3+Du2jRVWEWp7EWNSjL6AfQNqZenqAuq69b1OIp5zOteobPrYkBQzzuvxGR+1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T13:52:58.826574Z","bundle_sha256":"f382788cc59be909913ee5e7425cb67a4c3c465a7bf05f659eb4b8b4a24dee9f"}}