{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Y6AZFJUMLPI2UQW7YTT5GPVM2D","short_pith_number":"pith:Y6AZFJUM","schema_version":"1.0","canonical_sha256":"c78192a68c5bd1aa42dfc4e7d33eacd0e705beeaf46d83155cfe6747d1aa394e","source":{"kind":"arxiv","id":"1304.1829","version":3},"attestation_state":"computed","paper":{"title":"On Double 3-Term Arithmetic Progressions","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Poelstra, Tom Brown, Veselin Jungi\\'c","submitted_at":"2013-04-05T22:02:39Z","abstract_excerpt":"In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$ such that $i + k = 2j$ and $x_i + x_k = 2x_j$. We consider a few variations of the problem, discuss some related properties of double arithmetic progressions, and present several results obtained by using RamseyScript, a high-level scripting language."},"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":"1304.1829","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/publicdomain/","primary_cat":"math.CO","submitted_at":"2013-04-05T22:02:39Z","cross_cats_sorted":[],"title_canon_sha256":"be11281d0524176920f66d336f6dffe98ea04199879efd61a5af407c1b4877ec","abstract_canon_sha256":"d885782516471959b77fedb3e7806caf6f09917e41012b99edbf64125462fa16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:01.905478Z","signature_b64":"3jFraSjf+0WcQRe6/hTWJHvxE8wYUJAKgCVU4YuGvF1nWQTi5ld+wfDTd9fPt0KN78/ZFg/YWUApyZuu0PD5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c78192a68c5bd1aa42dfc4e7d33eacd0e705beeaf46d83155cfe6747d1aa394e","last_reissued_at":"2026-05-18T03:07:01.904986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:01.904986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Double 3-Term Arithmetic Progressions","license":"http://creativecommons.org/licenses/publicdomain/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew Poelstra, Tom Brown, Veselin Jungi\\'c","submitted_at":"2013-04-05T22:02:39Z","abstract_excerpt":"In this note we are interested in the problem of whether or not every increasing sequence of positive integers $x_1x_2x_3...$ with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms $x_i$, $x_j$, and $x_k$ such that $i + k = 2j$ and $x_i + x_k = 2x_j$. We consider a few variations of the problem, discuss some related properties of double arithmetic progressions, and present several results obtained by using RamseyScript, a high-level scripting language."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1829","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":""},"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":"1304.1829","created_at":"2026-05-18T03:07:01.905067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.1829v3","created_at":"2026-05-18T03:07:01.905067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1829","created_at":"2026-05-18T03:07:01.905067+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y6AZFJUMLPI2","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y6AZFJUMLPI2UQW7","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y6AZFJUM","created_at":"2026-05-18T12:28:06.772260+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/Y6AZFJUMLPI2UQW7YTT5GPVM2D","json":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D.json","graph_json":"https://pith.science/api/pith-number/Y6AZFJUMLPI2UQW7YTT5GPVM2D/graph.json","events_json":"https://pith.science/api/pith-number/Y6AZFJUMLPI2UQW7YTT5GPVM2D/events.json","paper":"https://pith.science/paper/Y6AZFJUM"},"agent_actions":{"view_html":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D","download_json":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D.json","view_paper":"https://pith.science/paper/Y6AZFJUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.1829&json=true","fetch_graph":"https://pith.science/api/pith-number/Y6AZFJUMLPI2UQW7YTT5GPVM2D/graph.json","fetch_events":"https://pith.science/api/pith-number/Y6AZFJUMLPI2UQW7YTT5GPVM2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D/action/storage_attestation","attest_author":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D/action/author_attestation","sign_citation":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D/action/citation_signature","submit_replication":"https://pith.science/pith/Y6AZFJUMLPI2UQW7YTT5GPVM2D/action/replication_record"}},"created_at":"2026-05-18T03:07:01.905067+00:00","updated_at":"2026-05-18T03:07:01.905067+00:00"}