{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T5HHMGFZ4TZ7DIQBNMDM32TPYQ","short_pith_number":"pith:T5HHMGFZ","schema_version":"1.0","canonical_sha256":"9f4e7618b9e4f3f1a2016b06cdea6fc41adddfe05616035ff9eda097b99a2db2","source":{"kind":"arxiv","id":"2106.06846","version":3},"attestation_state":"computed","paper":{"title":"Linear configurations containing 4-term arithmetic progressions are uncommon","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Leo Versteegen","submitted_at":"2021-06-12T19:59:40Z","abstract_excerpt":"A linear configuration is said to be common in $G$ if every 2-coloring of $G$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf asked whether, analogously to a result by Thomason in graph theory, every configuration containing a 4-term arithmetic progression is uncommon. We prove this in $\\mathbb{F}_p^n$ for $p\\geq 5$ and large $n$ and in $\\mathbb{Z}_p$ for large primes $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":"2106.06846","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2021-06-12T19:59:40Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"329442234ef3690d7da98fca5389e600844d134cf98727fd635362fa8de20b49","abstract_canon_sha256":"eb0767d873c9a8c404771a705743aac537c435903ebf1bea69de3cc4dc071319"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:13:04.782744Z","signature_b64":"Xd1Yxsh5B/Oz8dcvQJQZ9WSBFONH8+xqp+FtgISL3IcZjv7awXwxhJMSkOYpgCQSpfMBdqpj42JJcfzToAVQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f4e7618b9e4f3f1a2016b06cdea6fc41adddfe05616035ff9eda097b99a2db2","last_reissued_at":"2026-07-05T03:13:04.782250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:13:04.782250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear configurations containing 4-term arithmetic progressions are uncommon","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Leo Versteegen","submitted_at":"2021-06-12T19:59:40Z","abstract_excerpt":"A linear configuration is said to be common in $G$ if every 2-coloring of $G$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf asked whether, analogously to a result by Thomason in graph theory, every configuration containing a 4-term arithmetic progression is uncommon. We prove this in $\\mathbb{F}_p^n$ for $p\\geq 5$ and large $n$ and in $\\mathbb{Z}_p$ for large primes $p$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.06846","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2106.06846/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2106.06846","created_at":"2026-07-05T03:13:04.782309+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.06846v3","created_at":"2026-07-05T03:13:04.782309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.06846","created_at":"2026-07-05T03:13:04.782309+00:00"},{"alias_kind":"pith_short_12","alias_value":"T5HHMGFZ4TZ7","created_at":"2026-07-05T03:13:04.782309+00:00"},{"alias_kind":"pith_short_16","alias_value":"T5HHMGFZ4TZ7DIQB","created_at":"2026-07-05T03:13:04.782309+00:00"},{"alias_kind":"pith_short_8","alias_value":"T5HHMGFZ","created_at":"2026-07-05T03:13:04.782309+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/T5HHMGFZ4TZ7DIQBNMDM32TPYQ","json":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ.json","graph_json":"https://pith.science/api/pith-number/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/graph.json","events_json":"https://pith.science/api/pith-number/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/events.json","paper":"https://pith.science/paper/T5HHMGFZ"},"agent_actions":{"view_html":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ","download_json":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ.json","view_paper":"https://pith.science/paper/T5HHMGFZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.06846&json=true","fetch_graph":"https://pith.science/api/pith-number/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/graph.json","fetch_events":"https://pith.science/api/pith-number/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/action/storage_attestation","attest_author":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/action/author_attestation","sign_citation":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/action/citation_signature","submit_replication":"https://pith.science/pith/T5HHMGFZ4TZ7DIQBNMDM32TPYQ/action/replication_record"}},"created_at":"2026-07-05T03:13:04.782309+00:00","updated_at":"2026-07-05T03:13:04.782309+00:00"}