{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:MPIW6HV7OI4O7T5YHW6YOMFIY4","short_pith_number":"pith:MPIW6HV7","schema_version":"1.0","canonical_sha256":"63d16f1ebf7238efcfb83dbd8730a8c73c6b166c739ab98ddcd30db4cebe3f34","source":{"kind":"arxiv","id":"0709.4432","version":1},"attestation_state":"computed","paper":{"title":"On the maximal number of three-term arithmetic progressions in subsets of Z/pZ","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ben Green, Olof Sisask","submitted_at":"2007-09-27T15:34:21Z","abstract_excerpt":"Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \\max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through primes. Writing c(a) for this limit, we show that c(a) = a^2/2 provided that a is smaller than some absolute constant. In fact we prove rather more, establishing a structure theorem for sets having the maximal number of 3-term progressions amongst all subsets of Z/pZ of cardinality m, provided that m < c*p."},"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":"0709.4432","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2007-09-27T15:34:21Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"14114a077e2f372377d9164eb42741d73a9608a67f96882e0d79f36d0a29bb9a","abstract_canon_sha256":"882c21f7bfbc6d306ce2f44a81799d0885cb7d10588cf7c2eb5fee3e5c5d5f90"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:12.267997Z","signature_b64":"5YMR+ydkCpISA3xZB/7URI4STjWD0ddvfRH8bmwzXQuMbm+waSaW/5ptZAs1anz10kp2XuhLpKET97johkE1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63d16f1ebf7238efcfb83dbd8730a8c73c6b166c739ab98ddcd30db4cebe3f34","last_reissued_at":"2026-05-18T02:58:12.267276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:12.267276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximal number of three-term arithmetic progressions in subsets of Z/pZ","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Ben Green, Olof Sisask","submitted_at":"2007-09-27T15:34:21Z","abstract_excerpt":"Let a be a real number between 0 and 1. Ernie Croot showed that the quantity \\max_A #(3-term arithmetic progressions in A)/p^2, where A ranges over all subsets of Z/pZ of size at most a*p, tends to a limit as p tends to infinity through primes. Writing c(a) for this limit, we show that c(a) = a^2/2 provided that a is smaller than some absolute constant. In fact we prove rather more, establishing a structure theorem for sets having the maximal number of 3-term progressions amongst all subsets of Z/pZ of cardinality m, provided that m < c*p."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.4432","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":""},"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":"0709.4432","created_at":"2026-05-18T02:58:12.267407+00:00"},{"alias_kind":"arxiv_version","alias_value":"0709.4432v1","created_at":"2026-05-18T02:58:12.267407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.4432","created_at":"2026-05-18T02:58:12.267407+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPIW6HV7OI4O","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPIW6HV7OI4O7T5Y","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPIW6HV7","created_at":"2026-05-18T12:25:55.427421+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/MPIW6HV7OI4O7T5YHW6YOMFIY4","json":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4.json","graph_json":"https://pith.science/api/pith-number/MPIW6HV7OI4O7T5YHW6YOMFIY4/graph.json","events_json":"https://pith.science/api/pith-number/MPIW6HV7OI4O7T5YHW6YOMFIY4/events.json","paper":"https://pith.science/paper/MPIW6HV7"},"agent_actions":{"view_html":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4","download_json":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4.json","view_paper":"https://pith.science/paper/MPIW6HV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0709.4432&json=true","fetch_graph":"https://pith.science/api/pith-number/MPIW6HV7OI4O7T5YHW6YOMFIY4/graph.json","fetch_events":"https://pith.science/api/pith-number/MPIW6HV7OI4O7T5YHW6YOMFIY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4/action/storage_attestation","attest_author":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4/action/author_attestation","sign_citation":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4/action/citation_signature","submit_replication":"https://pith.science/pith/MPIW6HV7OI4O7T5YHW6YOMFIY4/action/replication_record"}},"created_at":"2026-05-18T02:58:12.267407+00:00","updated_at":"2026-05-18T02:58:12.267407+00:00"}