{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MTLGSKE6P24UODQ7DR64QPREAZ","short_pith_number":"pith:MTLGSKE6","schema_version":"1.0","canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","source":{"kind":"arxiv","id":"1304.4921","version":3},"attestation_state":"computed","paper":{"title":"An Arithmetic Analogue of Fox's Triangle Removal Argument","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Madhur Tulsiani, Pooya Hatami, Sushant Sachdeva","submitted_at":"2013-04-17T19:11:52Z","abstract_excerpt":"We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group $\\mathbb{F}_2^n$.\n  A triangle in $\\mathbb{F}_2^n$ is a triple $(x,y,z)$ such that $x+y+z = 0$. The triangle removal lemma for $\\mathbb{F}_2^n$ states that for every $\\epsilon > 0$ there is a $\\delta > 0$, such that if a subset $A$ of $\\mathbb{F}_2^n$ requires the removal of at least $\\epsilon \\cdot 2^n$ elements to make it triangle-free, then it must contain at least $\\delta \\cdot 2^{2n}$ triangles. This problem was first studied by Green [Gre05] who proved a lower bound on $\\delta$ u"},"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":"1304.4921","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T19:11:52Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9a41d64aaac110b315049c82360a4d4fca077f3a17b1af0e15bc6c2f3acee0a6","abstract_canon_sha256":"2096d9d2a524ed2cb6028ccbb4e6916f130c5f18ca1ef51fbc3fffefbb2f4d18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:38.322069Z","signature_b64":"qPs2uSMrtwrG27MnIls1r87v3ECBaGDMCGIDFmSbvkmvRVe1upOFu2h0/E61RHy7rdtDol6UKDC2FddCPtehCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","last_reissued_at":"2026-05-18T01:21:38.321403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:38.321403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Arithmetic Analogue of Fox's Triangle Removal Argument","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Madhur Tulsiani, Pooya Hatami, Sushant Sachdeva","submitted_at":"2013-04-17T19:11:52Z","abstract_excerpt":"We give an arithmetic version of the recent proof of the triangle removal lemma by Fox [Fox11], for the group $\\mathbb{F}_2^n$.\n  A triangle in $\\mathbb{F}_2^n$ is a triple $(x,y,z)$ such that $x+y+z = 0$. The triangle removal lemma for $\\mathbb{F}_2^n$ states that for every $\\epsilon > 0$ there is a $\\delta > 0$, such that if a subset $A$ of $\\mathbb{F}_2^n$ requires the removal of at least $\\epsilon \\cdot 2^n$ elements to make it triangle-free, then it must contain at least $\\delta \\cdot 2^{2n}$ triangles. This problem was first studied by Green [Gre05] who proved a lower bound on $\\delta$ u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4921","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1304.4921","created_at":"2026-05-18T01:21:38.321510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4921v3","created_at":"2026-05-18T01:21:38.321510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4921","created_at":"2026-05-18T01:21:38.321510+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTLGSKE6P24U","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTLGSKE6P24UODQ7","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTLGSKE6","created_at":"2026-05-18T12:27:52.871228+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/MTLGSKE6P24UODQ7DR64QPREAZ","json":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ.json","graph_json":"https://pith.science/api/pith-number/MTLGSKE6P24UODQ7DR64QPREAZ/graph.json","events_json":"https://pith.science/api/pith-number/MTLGSKE6P24UODQ7DR64QPREAZ/events.json","paper":"https://pith.science/paper/MTLGSKE6"},"agent_actions":{"view_html":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ","download_json":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ.json","view_paper":"https://pith.science/paper/MTLGSKE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4921&json=true","fetch_graph":"https://pith.science/api/pith-number/MTLGSKE6P24UODQ7DR64QPREAZ/graph.json","fetch_events":"https://pith.science/api/pith-number/MTLGSKE6P24UODQ7DR64QPREAZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/action/storage_attestation","attest_author":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/action/author_attestation","sign_citation":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/action/citation_signature","submit_replication":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/action/replication_record"}},"created_at":"2026-05-18T01:21:38.321510+00:00","updated_at":"2026-05-18T01:21:38.321510+00:00"}