{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:54HO7U5EZL4VO7VQE7NCDDMGE4","short_pith_number":"pith:54HO7U5E","schema_version":"1.0","canonical_sha256":"ef0eefd3a4caf9577eb027da218d862712650acb3a90c3a8f856aa9a6830c8cf","source":{"kind":"arxiv","id":"1101.5851","version":2},"attestation_state":"computed","paper":{"title":"New Bounds on cap sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"math.CA","authors_text":"Michael Bateman, Nets Hawk Katz","submitted_at":"2011-01-31T05:23:55Z","abstract_excerpt":"We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \\over N^{1+\\epsilon}}$. We do this by obtaining quite strong information about the additive combinatorial properties of the large spectrum."},"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":"1101.5851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CA","submitted_at":"2011-01-31T05:23:55Z","cross_cats_sorted":["math.CO","math.NT"],"title_canon_sha256":"f5d681faa3ca9b8a066f73efbdd13c8b902213fe33bb95f22f414b6baf1cb7cb","abstract_canon_sha256":"512a905f5a9d48c8cb57dd83d328b1b8c309374b2483eae1975f2c1246ac52d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:10.882678Z","signature_b64":"Z6QMkTul2QH9bZGb9lA+D38ecZoUfDYZl/Tdfezr/hFnSYivlHIIQ+obnjktqEt4nP5rGYGrHzmHRgfOs9OPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef0eefd3a4caf9577eb027da218d862712650acb3a90c3a8f856aa9a6830c8cf","last_reissued_at":"2026-05-18T04:25:10.882220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:10.882220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New Bounds on cap sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.NT"],"primary_cat":"math.CA","authors_text":"Michael Bateman, Nets Hawk Katz","submitted_at":"2011-01-31T05:23:55Z","abstract_excerpt":"We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \\over N^{1+\\epsilon}}$. We do this by obtaining quite strong information about the additive combinatorial properties of the large spectrum."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5851","kind":"arxiv","version":2},"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":"1101.5851","created_at":"2026-05-18T04:25:10.882284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.5851v2","created_at":"2026-05-18T04:25:10.882284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5851","created_at":"2026-05-18T04:25:10.882284+00:00"},{"alias_kind":"pith_short_12","alias_value":"54HO7U5EZL4V","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"54HO7U5EZL4VO7VQ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"54HO7U5E","created_at":"2026-05-18T12:26:20.644004+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/54HO7U5EZL4VO7VQE7NCDDMGE4","json":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4.json","graph_json":"https://pith.science/api/pith-number/54HO7U5EZL4VO7VQE7NCDDMGE4/graph.json","events_json":"https://pith.science/api/pith-number/54HO7U5EZL4VO7VQE7NCDDMGE4/events.json","paper":"https://pith.science/paper/54HO7U5E"},"agent_actions":{"view_html":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4","download_json":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4.json","view_paper":"https://pith.science/paper/54HO7U5E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.5851&json=true","fetch_graph":"https://pith.science/api/pith-number/54HO7U5EZL4VO7VQE7NCDDMGE4/graph.json","fetch_events":"https://pith.science/api/pith-number/54HO7U5EZL4VO7VQE7NCDDMGE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4/action/storage_attestation","attest_author":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4/action/author_attestation","sign_citation":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4/action/citation_signature","submit_replication":"https://pith.science/pith/54HO7U5EZL4VO7VQE7NCDDMGE4/action/replication_record"}},"created_at":"2026-05-18T04:25:10.882284+00:00","updated_at":"2026-05-18T04:25:10.882284+00:00"}