{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:762BOSMGTNJ4GU5YYOMTZ6W6WC","short_pith_number":"pith:762BOSMG","schema_version":"1.0","canonical_sha256":"ffb41749869b53c353b8c3993cfadeb0aaaaadbc289f7bbf22326b7c70b13d3e","source":{"kind":"arxiv","id":"2507.05231","version":1},"attestation_state":"computed","paper":{"title":"An improved construction for the triangle removal lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zach Hunter","submitted_at":"2025-07-07T17:40:44Z","abstract_excerpt":"We construct $n$-vertex graphs $G$ where $\\epsilon n^2$ edges must be deleted to become triangle-free, which contain less than $\\epsilon^{(C_{\\text{new}}-o(1))\\log_2 1/\\epsilon}n^3$ triangles for $C_{\\text{new}}= \\frac{1}{4\\log_2(4/3)} \\approx 1.6601$. Previously, a bound of the same shape was known, but with $C_{\\text{new}}$ replaced by $C_{\\text{old}} := C_{\\text{new}}/2$. Our construction uses ideas from additive combinatorics, drawing especially from the corners problem, but does not yield new bounds for those problems."},"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":"2507.05231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-07T17:40:44Z","cross_cats_sorted":[],"title_canon_sha256":"c784b970d0af0ce585e35e65adaec3694d4d48236124e409ffd325e061d7df5c","abstract_canon_sha256":"e23422b6712c036af88eb7e3fd0a97eaea53919287e19b4a770b8aa475d81aec"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:10.949791Z","signature_b64":"liXvhmvCmnziJY9pI3IMzEYWJBiWFSg/KcrBWlG0XlMCXXle0IydWzBxXjakiq+syNllNNw9dmMaWX2VcqdqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffb41749869b53c353b8c3993cfadeb0aaaaadbc289f7bbf22326b7c70b13d3e","last_reissued_at":"2026-07-05T11:33:10.949374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:10.949374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An improved construction for the triangle removal lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Zach Hunter","submitted_at":"2025-07-07T17:40:44Z","abstract_excerpt":"We construct $n$-vertex graphs $G$ where $\\epsilon n^2$ edges must be deleted to become triangle-free, which contain less than $\\epsilon^{(C_{\\text{new}}-o(1))\\log_2 1/\\epsilon}n^3$ triangles for $C_{\\text{new}}= \\frac{1}{4\\log_2(4/3)} \\approx 1.6601$. Previously, a bound of the same shape was known, but with $C_{\\text{new}}$ replaced by $C_{\\text{old}} := C_{\\text{new}}/2$. Our construction uses ideas from additive combinatorics, drawing especially from the corners problem, but does not yield new bounds for those problems."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.05231","kind":"arxiv","version":1},"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.05231/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":"2507.05231","created_at":"2026-07-05T11:33:10.949427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.05231v1","created_at":"2026-07-05T11:33:10.949427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.05231","created_at":"2026-07-05T11:33:10.949427+00:00"},{"alias_kind":"pith_short_12","alias_value":"762BOSMGTNJ4","created_at":"2026-07-05T11:33:10.949427+00:00"},{"alias_kind":"pith_short_16","alias_value":"762BOSMGTNJ4GU5Y","created_at":"2026-07-05T11:33:10.949427+00:00"},{"alias_kind":"pith_short_8","alias_value":"762BOSMG","created_at":"2026-07-05T11:33:10.949427+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/762BOSMGTNJ4GU5YYOMTZ6W6WC","json":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC.json","graph_json":"https://pith.science/api/pith-number/762BOSMGTNJ4GU5YYOMTZ6W6WC/graph.json","events_json":"https://pith.science/api/pith-number/762BOSMGTNJ4GU5YYOMTZ6W6WC/events.json","paper":"https://pith.science/paper/762BOSMG"},"agent_actions":{"view_html":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC","download_json":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC.json","view_paper":"https://pith.science/paper/762BOSMG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.05231&json=true","fetch_graph":"https://pith.science/api/pith-number/762BOSMGTNJ4GU5YYOMTZ6W6WC/graph.json","fetch_events":"https://pith.science/api/pith-number/762BOSMGTNJ4GU5YYOMTZ6W6WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC/action/storage_attestation","attest_author":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC/action/author_attestation","sign_citation":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC/action/citation_signature","submit_replication":"https://pith.science/pith/762BOSMGTNJ4GU5YYOMTZ6W6WC/action/replication_record"}},"created_at":"2026-07-05T11:33:10.949427+00:00","updated_at":"2026-07-05T11:33:10.949427+00:00"}