{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6P3KRVMNQHS25NIA3POAIHE5FQ","short_pith_number":"pith:6P3KRVMN","schema_version":"1.0","canonical_sha256":"f3f6a8d58d81e5aeb500dbdc041c9d2c0f466e058680f271b9077cd9eb654cfd","source":{"kind":"arxiv","id":"2112.13689","version":2},"attestation_state":"computed","paper":{"title":"On extremal numbers of the triangle plus the four-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2021-12-27T13:57:05Z","abstract_excerpt":"For a family $\\mathcal{F}$ of graphs, let $ex(n,\\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks to determine the function $ex(n,\\{C_3,C_4\\})$. Here we give a new construction for dense graphs of girth at least five with arbitrary number of vertices, providing the first improvement on the lower bound of $ex(n,\\{C_3,C_4\\})$ since 1976. As a corollary, this yields a negative answer to a problem in Chung-Graham [3]."},"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":"2112.13689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-12-27T13:57:05Z","cross_cats_sorted":[],"title_canon_sha256":"15afda1f8d63dda5be275f286c8ce404006ce4e375f73597f0a962300cdb5e3c","abstract_canon_sha256":"95d8d1d5fc9d8cd748d971ee248fbb7fc68021a66ea401287a860e648503ade2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:05.601449Z","signature_b64":"xYawYLx2gWxGfDWWL+Z6/fmS2y0XUi9roPwhjNZycsnhX814re9MNmnVqRX2WlKQKq+jwoSP5xYn1yqIky9zCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3f6a8d58d81e5aeb500dbdc041c9d2c0f466e058680f271b9077cd9eb654cfd","last_reissued_at":"2026-07-05T05:22:05.601002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:05.601002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On extremal numbers of the triangle plus the four-cycle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Tianchi Yang","submitted_at":"2021-12-27T13:57:05Z","abstract_excerpt":"For a family $\\mathcal{F}$ of graphs, let $ex(n,\\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks to determine the function $ex(n,\\{C_3,C_4\\})$. Here we give a new construction for dense graphs of girth at least five with arbitrary number of vertices, providing the first improvement on the lower bound of $ex(n,\\{C_3,C_4\\})$ since 1976. As a corollary, this yields a negative answer to a problem in Chung-Graham [3]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.13689","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/2112.13689/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":"2112.13689","created_at":"2026-07-05T05:22:05.601060+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.13689v2","created_at":"2026-07-05T05:22:05.601060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.13689","created_at":"2026-07-05T05:22:05.601060+00:00"},{"alias_kind":"pith_short_12","alias_value":"6P3KRVMNQHS2","created_at":"2026-07-05T05:22:05.601060+00:00"},{"alias_kind":"pith_short_16","alias_value":"6P3KRVMNQHS25NIA","created_at":"2026-07-05T05:22:05.601060+00:00"},{"alias_kind":"pith_short_8","alias_value":"6P3KRVMN","created_at":"2026-07-05T05:22:05.601060+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/6P3KRVMNQHS25NIA3POAIHE5FQ","json":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ.json","graph_json":"https://pith.science/api/pith-number/6P3KRVMNQHS25NIA3POAIHE5FQ/graph.json","events_json":"https://pith.science/api/pith-number/6P3KRVMNQHS25NIA3POAIHE5FQ/events.json","paper":"https://pith.science/paper/6P3KRVMN"},"agent_actions":{"view_html":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ","download_json":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ.json","view_paper":"https://pith.science/paper/6P3KRVMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.13689&json=true","fetch_graph":"https://pith.science/api/pith-number/6P3KRVMNQHS25NIA3POAIHE5FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6P3KRVMNQHS25NIA3POAIHE5FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ/action/storage_attestation","attest_author":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ/action/author_attestation","sign_citation":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ/action/citation_signature","submit_replication":"https://pith.science/pith/6P3KRVMNQHS25NIA3POAIHE5FQ/action/replication_record"}},"created_at":"2026-07-05T05:22:05.601060+00:00","updated_at":"2026-07-05T05:22:05.601060+00:00"}