{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MTLGSKE6P24UODQ7DR64QPREAZ","short_pith_number":"pith:MTLGSKE6","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"},"canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","source":{"kind":"arxiv","id":"1304.4921","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4921","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4921v3","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4921","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"MTLGSKE6P24U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MTLGSKE6P24UODQ7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MTLGSKE6","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MTLGSKE6P24UODQ7DR64QPREAZ","target":"record","payload":{"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"},"canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","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"},"source_kind":"arxiv","source_id":"1304.4921","source_version":3,"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-05-18T01:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yr4k29rZPg15FHVw5T/LVAesFMS4tEexvTyBKDOoOggrjl6h+K5ZP8DM+HE7Cu942EVKU4kbSdnZGRzkJiIGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:49:58.402629Z"},"content_sha256":"0818d0cb6bddd6e1fa9e464fa00491c164d09d33303c39853607f22cdcc8c791","schema_version":"1.0","event_id":"sha256:0818d0cb6bddd6e1fa9e464fa00491c164d09d33303c39853607f22cdcc8c791"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MTLGSKE6P24UODQ7DR64QPREAZ","target":"graph","payload":{"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"},"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-05-18T01:21:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XVMiBTZezriqojkVZ+oEQsmgpo5xOr+UXI9zojRwW/P1A2fus+fdQ+mycGDFy48kJG/FcGmEdi6LadNWyyDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:49:58.403276Z"},"content_sha256":"6622f253f25b1ef93da2211502294ea108f6613048f48c2dadd4331961edf936","schema_version":"1.0","event_id":"sha256:6622f253f25b1ef93da2211502294ea108f6613048f48c2dadd4331961edf936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/bundle.json","state_url":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MTLGSKE6P24UODQ7DR64QPREAZ/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-05-26T14:49:58Z","links":{"resolver":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ","bundle":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/bundle.json","state":"https://pith.science/pith/MTLGSKE6P24UODQ7DR64QPREAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MTLGSKE6P24UODQ7DR64QPREAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MTLGSKE6P24UODQ7DR64QPREAZ","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":"2096d9d2a524ed2cb6028ccbb4e6916f130c5f18ca1ef51fbc3fffefbb2f4d18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T19:11:52Z","title_canon_sha256":"9a41d64aaac110b315049c82360a4d4fca077f3a17b1af0e15bc6c2f3acee0a6"},"schema_version":"1.0","source":{"id":"1304.4921","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4921","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4921v3","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4921","created_at":"2026-05-18T01:21:38Z"},{"alias_kind":"pith_short_12","alias_value":"MTLGSKE6P24U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MTLGSKE6P24UODQ7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MTLGSKE6","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:6622f253f25b1ef93da2211502294ea108f6613048f48c2dadd4331961edf936","target":"graph","created_at":"2026-05-18T01:21:38Z","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"},"paper":{"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","authors_text":"Madhur Tulsiani, Pooya Hatami, Sushant Sachdeva","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T19:11:52Z","title":"An Arithmetic Analogue of Fox's Triangle Removal Argument"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4921","kind":"arxiv","version":3},"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:0818d0cb6bddd6e1fa9e464fa00491c164d09d33303c39853607f22cdcc8c791","target":"record","created_at":"2026-05-18T01:21:38Z","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":"2096d9d2a524ed2cb6028ccbb4e6916f130c5f18ca1ef51fbc3fffefbb2f4d18","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-17T19:11:52Z","title_canon_sha256":"9a41d64aaac110b315049c82360a4d4fca077f3a17b1af0e15bc6c2f3acee0a6"},"schema_version":"1.0","source":{"id":"1304.4921","kind":"arxiv","version":3}},"canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64d669289e7eb9470e1f1c7dc83e24064c538e973f2980f14b6562c04981624b","first_computed_at":"2026-05-18T01:21:38.321403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:38.321403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qPs2uSMrtwrG27MnIls1r87v3ECBaGDMCGIDFmSbvkmvRVe1upOFu2h0/E61RHy7rdtDol6UKDC2FddCPtehCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:38.322069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4921","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0818d0cb6bddd6e1fa9e464fa00491c164d09d33303c39853607f22cdcc8c791","sha256:6622f253f25b1ef93da2211502294ea108f6613048f48c2dadd4331961edf936"],"state_sha256":"ae79631d9cc23ba49242e72ed04fbc056d15a0d15eebe1f3ffe218d7c549e018"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qn8H3Zbj1KMJc9y0AGtXe+j76JLhKZYtW1dEih42A9wtZ9gF2d1L3PK2jILQwZMH7j8lg7/ArymAjWlKzjetAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:49:58.407026Z","bundle_sha256":"49796c56290d4df935421f4fdf2c3b653003c058efa0c75dba8a7eee55a35b1d"}}