{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OSIP2M5MD6GOUW3DHCK3FKZPKZ","short_pith_number":"pith:OSIP2M5M","schema_version":"1.0","canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","source":{"kind":"arxiv","id":"2309.02993","version":2},"attestation_state":"computed","paper":{"title":"Counting triangles in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, Jie Ma, Tianying Xie, Xinmin Hou","submitted_at":"2023-09-06T13:36:39Z","abstract_excerpt":"In this paper, we investigate the minimum number of triangles, denoted by $t(n,k)$, in $n$-vertex $k$-regular graphs, where $n$ is an odd integer and $k$ is an even integer. The well-known Andr\\'asfai-Erd\\H{o}s-S\\'os Theorem has established that $t(n,k)>0$ if $k>\\frac{2n}{5}$. In a striking work, Lo has provided the exact value of $t(n,k)$ for sufficiently large $n$, given that $\\frac{2n}{5}+\\frac{12\\sqrt{n}}{5}<k<\\frac{n}{2}$. Here, we bridge the gap between the aforementioned results by determining the precise value of $t(n,k)$ in the entire range $\\frac{2n}{5}<k<\\frac{n}{2}$. This confirms "},"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":"2309.02993","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-06T13:36:39Z","cross_cats_sorted":[],"title_canon_sha256":"cc572ffc387cb0d7f7af51f8f5284fed486160e913d76c2eda4b829175dc88f8","abstract_canon_sha256":"9c3b890a5dc7c79002d231046f6f027e0a27a08ed4d82648c104b19a4ca9b96b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:50.273895Z","signature_b64":"ASCAU0zvij2yiSy0GQISMEAVT+bkrC5Tep+62l2r88NwVDCvFi87RUQxghrHoLnFS067iysLSaYG0qjsApRhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","last_reissued_at":"2026-07-05T07:34:50.273494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:50.273494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting triangles in regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jialin He, Jie Ma, Tianying Xie, Xinmin Hou","submitted_at":"2023-09-06T13:36:39Z","abstract_excerpt":"In this paper, we investigate the minimum number of triangles, denoted by $t(n,k)$, in $n$-vertex $k$-regular graphs, where $n$ is an odd integer and $k$ is an even integer. The well-known Andr\\'asfai-Erd\\H{o}s-S\\'os Theorem has established that $t(n,k)>0$ if $k>\\frac{2n}{5}$. In a striking work, Lo has provided the exact value of $t(n,k)$ for sufficiently large $n$, given that $\\frac{2n}{5}+\\frac{12\\sqrt{n}}{5}<k<\\frac{n}{2}$. Here, we bridge the gap between the aforementioned results by determining the precise value of $t(n,k)$ in the entire range $\\frac{2n}{5}<k<\\frac{n}{2}$. This confirms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02993","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/2309.02993/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":"2309.02993","created_at":"2026-07-05T07:34:50.273550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.02993v2","created_at":"2026-07-05T07:34:50.273550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02993","created_at":"2026-07-05T07:34:50.273550+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSIP2M5MD6GO","created_at":"2026-07-05T07:34:50.273550+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSIP2M5MD6GOUW3D","created_at":"2026-07-05T07:34:50.273550+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSIP2M5M","created_at":"2026-07-05T07:34:50.273550+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/OSIP2M5MD6GOUW3DHCK3FKZPKZ","json":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ.json","graph_json":"https://pith.science/api/pith-number/OSIP2M5MD6GOUW3DHCK3FKZPKZ/graph.json","events_json":"https://pith.science/api/pith-number/OSIP2M5MD6GOUW3DHCK3FKZPKZ/events.json","paper":"https://pith.science/paper/OSIP2M5M"},"agent_actions":{"view_html":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ","download_json":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ.json","view_paper":"https://pith.science/paper/OSIP2M5M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.02993&json=true","fetch_graph":"https://pith.science/api/pith-number/OSIP2M5MD6GOUW3DHCK3FKZPKZ/graph.json","fetch_events":"https://pith.science/api/pith-number/OSIP2M5MD6GOUW3DHCK3FKZPKZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/action/storage_attestation","attest_author":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/action/author_attestation","sign_citation":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/action/citation_signature","submit_replication":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/action/replication_record"}},"created_at":"2026-07-05T07:34:50.273550+00:00","updated_at":"2026-07-05T07:34:50.273550+00:00"}