{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:FOUNN7K7BL5CK7U3FCPK5J4W4N","short_pith_number":"pith:FOUNN7K7","schema_version":"1.0","canonical_sha256":"2ba8d6fd5f0afa257e9b289eaea796e36d5ad64599f16cf5e36707331b2bb61c","source":{"kind":"arxiv","id":"math/0509560","version":3},"attestation_state":"computed","paper":{"title":"New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries","license":"","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2005-09-23T14:59:44Z","abstract_excerpt":"Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0 and some c_F > 0, then A contains four distinct elements in arithmetic progression.\n  This is equivalent, in the usual notation of additive combinatorics, to the assertion that r_4(G) <<_F N(log N)^{-c}."},"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":"math/0509560","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2005-09-23T14:59:44Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8933eb4377a9e7fc0b4a7721d6ee3ebed9e8936aa6798e8be6c2a7d14ebb24aa","abstract_canon_sha256":"128e9021955b094e108879df986a71a84340bee2bf6dcf333852bb9025fcef2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:51.054110Z","signature_b64":"0t4gG9cTVpTu2EiXM18/p8w9K287HKBOxgKw7aHZTYjyJ5Iy+EEpjvEFcTOYKn949dxSq9ZaA1GZ7j9Ny8cqDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba8d6fd5f0afa257e9b289eaea796e36d5ad64599f16cf5e36707331b2bb61c","last_reissued_at":"2026-05-18T02:57:51.053655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:51.053655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for Szemeredi's Theorem, I: Progressions of length 4 in finite field geometries","license":"","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2005-09-23T14:59:44Z","abstract_excerpt":"Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0 and some c_F > 0, then A contains four distinct elements in arithmetic progression.\n  This is equivalent, in the usual notation of additive combinatorics, to the assertion that r_4(G) <<_F N(log N)^{-c}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0509560","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":"math/0509560","created_at":"2026-05-18T02:57:51.053722+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0509560v3","created_at":"2026-05-18T02:57:51.053722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0509560","created_at":"2026-05-18T02:57:51.053722+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOUNN7K7BL5C","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOUNN7K7BL5CK7U3","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOUNN7K7","created_at":"2026-05-18T12:25:53.335082+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/FOUNN7K7BL5CK7U3FCPK5J4W4N","json":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N.json","graph_json":"https://pith.science/api/pith-number/FOUNN7K7BL5CK7U3FCPK5J4W4N/graph.json","events_json":"https://pith.science/api/pith-number/FOUNN7K7BL5CK7U3FCPK5J4W4N/events.json","paper":"https://pith.science/paper/FOUNN7K7"},"agent_actions":{"view_html":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N","download_json":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N.json","view_paper":"https://pith.science/paper/FOUNN7K7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0509560&json=true","fetch_graph":"https://pith.science/api/pith-number/FOUNN7K7BL5CK7U3FCPK5J4W4N/graph.json","fetch_events":"https://pith.science/api/pith-number/FOUNN7K7BL5CK7U3FCPK5J4W4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N/action/storage_attestation","attest_author":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N/action/author_attestation","sign_citation":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N/action/citation_signature","submit_replication":"https://pith.science/pith/FOUNN7K7BL5CK7U3FCPK5J4W4N/action/replication_record"}},"created_at":"2026-05-18T02:57:51.053722+00:00","updated_at":"2026-05-18T02:57:51.053722+00:00"}