{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SCCZGN2DPKA2CRLC6OA2CY5MTN","short_pith_number":"pith:SCCZGN2D","schema_version":"1.0","canonical_sha256":"90859337437a81a14562f381a163ac9b6b9b2c8261681eb120403129b07f55b6","source":{"kind":"arxiv","id":"1901.05084","version":1},"attestation_state":"computed","paper":{"title":"Independent arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2019-01-15T23:12:59Z","abstract_excerpt":"We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \\log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications of this result to several questions in Ramsey theory."},"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":"1901.05084","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-15T23:12:59Z","cross_cats_sorted":[],"title_canon_sha256":"e94a2bb59e8d71a17e0ed2123f88e61297b0cb8166822cfe48fd9a6b4f35de32","abstract_canon_sha256":"cf7f8e7948b252274d24238c27b16bc3ef97dfbd804aab8be7717ed16ca6f573"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:11.981633Z","signature_b64":"pX86jUY8Ce33gWSCZ5mg7+KG8dp9Tu+OIG/rOmJW61NvUx0DmLgGCBJlg4ySjEAd3BIEy99vLKJgyh77NC82Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90859337437a81a14562f381a163ac9b6b9b2c8261681eb120403129b07f55b6","last_reissued_at":"2026-05-17T23:56:11.980930Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:11.980930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2019-01-15T23:12:59Z","abstract_excerpt":"We show that there is a positive constant $c$ such that any graph on vertex set $[n]$ with at most $c n^2/k^2 \\log k$ edges contains an independent set of order $k$ whose vertices form an arithmetic progression. We also present applications of this result to several questions in Ramsey theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.05084","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":"1901.05084","created_at":"2026-05-17T23:56:11.981048+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.05084v1","created_at":"2026-05-17T23:56:11.981048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.05084","created_at":"2026-05-17T23:56:11.981048+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCCZGN2DPKA2","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCCZGN2DPKA2CRLC","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCCZGN2D","created_at":"2026-05-18T12:33:27.125529+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/SCCZGN2DPKA2CRLC6OA2CY5MTN","json":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN.json","graph_json":"https://pith.science/api/pith-number/SCCZGN2DPKA2CRLC6OA2CY5MTN/graph.json","events_json":"https://pith.science/api/pith-number/SCCZGN2DPKA2CRLC6OA2CY5MTN/events.json","paper":"https://pith.science/paper/SCCZGN2D"},"agent_actions":{"view_html":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN","download_json":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN.json","view_paper":"https://pith.science/paper/SCCZGN2D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.05084&json=true","fetch_graph":"https://pith.science/api/pith-number/SCCZGN2DPKA2CRLC6OA2CY5MTN/graph.json","fetch_events":"https://pith.science/api/pith-number/SCCZGN2DPKA2CRLC6OA2CY5MTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN/action/storage_attestation","attest_author":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN/action/author_attestation","sign_citation":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN/action/citation_signature","submit_replication":"https://pith.science/pith/SCCZGN2DPKA2CRLC6OA2CY5MTN/action/replication_record"}},"created_at":"2026-05-17T23:56:11.981048+00:00","updated_at":"2026-05-17T23:56:11.981048+00:00"}