{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OSIP2M5MD6GOUW3DHCK3FKZPKZ","short_pith_number":"pith:OSIP2M5M","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"},"canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","source":{"kind":"arxiv","id":"2309.02993","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02993","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02993v2","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02993","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_12","alias_value":"OSIP2M5MD6GO","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_16","alias_value":"OSIP2M5MD6GOUW3D","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_8","alias_value":"OSIP2M5M","created_at":"2026-07-05T07:34:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OSIP2M5MD6GOUW3DHCK3FKZPKZ","target":"record","payload":{"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"},"canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","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"},"source_kind":"arxiv","source_id":"2309.02993","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-05T07:34:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZJ7vAKkXTr8G9/0nLsQ34ElOlL+61ZVuj3GzqURIpt4yoUXZ765KlHBeP1A3bIGCioYfXV3y/2UvPnij/cHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:31:08.801778Z"},"content_sha256":"c6b586a67dc9e0ff8fd41f7c77d61a5b37fd9e8ac4e5c410cfcb127048aa45db","schema_version":"1.0","event_id":"sha256:c6b586a67dc9e0ff8fd41f7c77d61a5b37fd9e8ac4e5c410cfcb127048aa45db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OSIP2M5MD6GOUW3DHCK3FKZPKZ","target":"graph","payload":{"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"},"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-05T07:34:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eD5gQnCzy2V732Va6/w2a4MPn3a43SyOUoUrVlf/LKrCqiWt3EfoPO2d2SO0MbQOE+xCIuhiUYQnimhi9GjFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T11:31:08.802683Z"},"content_sha256":"82b05045cac200ec236658d815a368bc3d614fc2b285edbb4e3d9af68d76fed9","schema_version":"1.0","event_id":"sha256:82b05045cac200ec236658d815a368bc3d614fc2b285edbb4e3d9af68d76fed9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/bundle.json","state_url":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/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-01T11:31:08Z","links":{"resolver":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ","bundle":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/bundle.json","state":"https://pith.science/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSIP2M5MD6GOUW3DHCK3FKZPKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OSIP2M5MD6GOUW3DHCK3FKZPKZ","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":"9c3b890a5dc7c79002d231046f6f027e0a27a08ed4d82648c104b19a4ca9b96b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-06T13:36:39Z","title_canon_sha256":"cc572ffc387cb0d7f7af51f8f5284fed486160e913d76c2eda4b829175dc88f8"},"schema_version":"1.0","source":{"id":"2309.02993","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02993","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02993v2","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02993","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_12","alias_value":"OSIP2M5MD6GO","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_16","alias_value":"OSIP2M5MD6GOUW3D","created_at":"2026-07-05T07:34:50Z"},{"alias_kind":"pith_short_8","alias_value":"OSIP2M5M","created_at":"2026-07-05T07:34:50Z"}],"graph_snapshots":[{"event_id":"sha256:82b05045cac200ec236658d815a368bc3d614fc2b285edbb4e3d9af68d76fed9","target":"graph","created_at":"2026-07-05T07:34:50Z","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/2309.02993/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Jialin He, Jie Ma, Tianying Xie, Xinmin Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-06T13:36:39Z","title":"Counting triangles in regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02993","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:c6b586a67dc9e0ff8fd41f7c77d61a5b37fd9e8ac4e5c410cfcb127048aa45db","target":"record","created_at":"2026-07-05T07:34:50Z","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":"9c3b890a5dc7c79002d231046f6f027e0a27a08ed4d82648c104b19a4ca9b96b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-09-06T13:36:39Z","title_canon_sha256":"cc572ffc387cb0d7f7af51f8f5284fed486160e913d76c2eda4b829175dc88f8"},"schema_version":"1.0","source":{"id":"2309.02993","kind":"arxiv","version":2}},"canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7490fd33ac1f8cea5b633895b2ab2f5669e43d6873e4de632c9dab9ab3271b16","first_computed_at":"2026-07-05T07:34:50.273494Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:34:50.273494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ASCAU0zvij2yiSy0GQISMEAVT+bkrC5Tep+62l2r88NwVDCvFi87RUQxghrHoLnFS067iysLSaYG0qjsApRhAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:34:50.273895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.02993","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6b586a67dc9e0ff8fd41f7c77d61a5b37fd9e8ac4e5c410cfcb127048aa45db","sha256:82b05045cac200ec236658d815a368bc3d614fc2b285edbb4e3d9af68d76fed9"],"state_sha256":"814d7c57ad02d8fdbfb06b100a398e5ade750025b0aa23dae082dd0a45f781d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ln57vlGXPS88OPJ1gjbeN/Hnk6T3/tRJAFmt/DYZ07d1iw6AfDsW38xifG7P4iC4ZjvYEoWOis3mUMpvwEFWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T11:31:08.811405Z","bundle_sha256":"f3965f5d2b6962d9d3397eb7a498b88d003158580f3cac5aca45ae5b59eb97c1"}}