{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:V5IUKWRVLZGDG6CZVKJYEUL7QT","short_pith_number":"pith:V5IUKWRV","canonical_record":{"source":{"id":"1611.07792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T13:48:34Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8d93f6177ee6669245b938cc81ef1a1914b49b1f7ad2cad266eb9e39b19eb7f5","abstract_canon_sha256":"85a437af482192a36ba14ac4f1dd1271b368762e8a729df17ac4d561ba381bad"},"schema_version":"1.0"},"canonical_sha256":"af51455a355e4c337859aa9382517f84e7df05d4ea52a4a57236b3e39da91e65","source":{"kind":"arxiv","id":"1611.07792","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07792","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07792v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07792","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"V5IUKWRVLZGD","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V5IUKWRVLZGDG6CZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V5IUKWRV","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:V5IUKWRVLZGDG6CZVKJYEUL7QT","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07792","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T13:48:34Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"8d93f6177ee6669245b938cc81ef1a1914b49b1f7ad2cad266eb9e39b19eb7f5","abstract_canon_sha256":"85a437af482192a36ba14ac4f1dd1271b368762e8a729df17ac4d561ba381bad"},"schema_version":"1.0"},"canonical_sha256":"af51455a355e4c337859aa9382517f84e7df05d4ea52a4a57236b3e39da91e65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.441817Z","signature_b64":"lpwCCPFQfNMvr8Ka4vDdB5ag2KzSOyJWVkQNl53s4WVJ89OZPwv7C1IrV2h8eTT4Wn+S1Oz7oehqkYCQL0jbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af51455a355e4c337859aa9382517f84e7df05d4ea52a4a57236b3e39da91e65","last_reissued_at":"2026-05-18T00:56:37.441198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.441198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07792","source_version":2,"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X1COlMWw4uTS3yg6YICfmPWhTUvuPZEDCffedhKOR+qPyDQKxTjy1pi/THybmIJPM/EilMiv+9V+9sHRI0vCDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:17:06.224503Z"},"content_sha256":"f2ed9ad60edf7081aa210d4930b417632d9d53d3826fc8a4b114435d6c2206f6","schema_version":"1.0","event_id":"sha256:f2ed9ad60edf7081aa210d4930b417632d9d53d3826fc8a4b114435d6c2206f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:V5IUKWRVLZGDG6CZVKJYEUL7QT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of three-term arithmetic progressions in a dense subset of $F_q^n$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Hao Pan, Shanshan Du","submitted_at":"2016-11-23T13:48:34Z","abstract_excerpt":"Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\\subset{\\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever $|A|\\geq (c_q q)^n$ for some constant $c_q>0$.\nAfter the first version of our manuscript was uploaded in the arXiv, we learned from Professors Jacob Fox and Terence Tao that our result is a special case of a result of Fox and Lovasz [1, Theorem 3]. In fact, [1, Theorem 3] gives a much better bound than ours. For example, when $q=3$, the lower bound given by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07792","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"},"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-18T00:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLylO/DTEJd8MH8kKCsDK9TeuHRvODoK7jUYTjq2I1Wl2gAMqccStFs24uh/KzxjJtRhC1SPP+SFdWmNiOf3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:17:06.225191Z"},"content_sha256":"b5941764ec3a139735c8b0db38561a07deee93f6e816b63c6d56bd98a05c2f3b","schema_version":"1.0","event_id":"sha256:b5941764ec3a139735c8b0db38561a07deee93f6e816b63c6d56bd98a05c2f3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/bundle.json","state_url":"https://pith.science/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/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-06-09T18:17:06Z","links":{"resolver":"https://pith.science/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT","bundle":"https://pith.science/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/bundle.json","state":"https://pith.science/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5IUKWRVLZGDG6CZVKJYEUL7QT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:V5IUKWRVLZGDG6CZVKJYEUL7QT","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":"85a437af482192a36ba14ac4f1dd1271b368762e8a729df17ac4d561ba381bad","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T13:48:34Z","title_canon_sha256":"8d93f6177ee6669245b938cc81ef1a1914b49b1f7ad2cad266eb9e39b19eb7f5"},"schema_version":"1.0","source":{"id":"1611.07792","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07792","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07792v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07792","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"V5IUKWRVLZGD","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"V5IUKWRVLZGDG6CZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"V5IUKWRV","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:b5941764ec3a139735c8b0db38561a07deee93f6e816b63c6d56bd98a05c2f3b","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\\subset{\\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever $|A|\\geq (c_q q)^n$ for some constant $c_q>0$.\nAfter the first version of our manuscript was uploaded in the arXiv, we learned from Professors Jacob Fox and Terence Tao that our result is a special case of a result of Fox and Lovasz [1, Theorem 3]. In fact, [1, Theorem 3] gives a much better bound than ours. For example, when $q=3$, the lower bound given by","authors_text":"Hao Pan, Shanshan Du","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T13:48:34Z","title":"On the number of three-term arithmetic progressions in a dense subset of $F_q^n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07792","kind":"arxiv","version":2},"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:f2ed9ad60edf7081aa210d4930b417632d9d53d3826fc8a4b114435d6c2206f6","target":"record","created_at":"2026-05-18T00:56:37Z","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":"85a437af482192a36ba14ac4f1dd1271b368762e8a729df17ac4d561ba381bad","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-23T13:48:34Z","title_canon_sha256":"8d93f6177ee6669245b938cc81ef1a1914b49b1f7ad2cad266eb9e39b19eb7f5"},"schema_version":"1.0","source":{"id":"1611.07792","kind":"arxiv","version":2}},"canonical_sha256":"af51455a355e4c337859aa9382517f84e7df05d4ea52a4a57236b3e39da91e65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af51455a355e4c337859aa9382517f84e7df05d4ea52a4a57236b3e39da91e65","first_computed_at":"2026-05-18T00:56:37.441198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.441198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lpwCCPFQfNMvr8Ka4vDdB5ag2KzSOyJWVkQNl53s4WVJ89OZPwv7C1IrV2h8eTT4Wn+S1Oz7oehqkYCQL0jbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.441817Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07792","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2ed9ad60edf7081aa210d4930b417632d9d53d3826fc8a4b114435d6c2206f6","sha256:b5941764ec3a139735c8b0db38561a07deee93f6e816b63c6d56bd98a05c2f3b"],"state_sha256":"879affb5b3bb3a8af2b639bae23fbc1abed53a1c8dc5b93e5642375e381b9a22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZ7SYOPs4E6yFnOvT40g8MCYjQd8MTxBv0ZVwwYLNJfJ1IGd5E4GOOseXsJ1A6h3otjGxAUfk+86lMfLvfLiCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:17:06.229037Z","bundle_sha256":"38ec31a3c347bb58ee7d3378a74c931695bb210e4ac238061b1511770a47114e"}}