{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:K3FD6WY4AKKJMVWNE7Y2CERVVA","short_pith_number":"pith:K3FD6WY4","schema_version":"1.0","canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","source":{"kind":"arxiv","id":"1002.0374","version":2},"attestation_state":"computed","paper":{"title":"Density Hales-Jewett and Moser numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D.H.J. Polymath","submitted_at":"2010-02-02T00:55:11Z","abstract_excerpt":"For any $n \\geq 0$ and $k \\geq 1$, the \\emph{density Hales-Jewett number} $c_{n,k}$ is defined as the size of the largest subset of the cube $[k]^n$ := $\\{1,...,k\\}^n$ which contains no combinatorial line; similarly, the Moser number $c'_{n,k}$ is the largest subset of the cube $[k]^n$ which contains no geometric line. A deep theorem of Furstenberg and Katznelson shows that $c_{n,k}$ = $o(k^n)$ as $n \\to \\infty$ (which implies a similar claim for $c'_{n,k}$); this is already non-trivial for $k = 3$. Several new proofs of this result have also been recently established.\n  Using both human and c"},"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":"1002.0374","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-02T00:55:11Z","cross_cats_sorted":[],"title_canon_sha256":"862bcab0189d577d307c5f3285cad1320e44f82f9f920bef554afb660f48bad4","abstract_canon_sha256":"abcf82da96ceaa2fe9b11694ca56833ae1f827cfca3df1833db75725ca728bb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:27:16.818154Z","signature_b64":"vmL09c93hFVCg4VhAsn4kRxpqCvgRpIpg/oaUeOc46NpJftz4jakp9NUQmTW1fCjXTLYq7juinhKQp3XPfkzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","last_reissued_at":"2026-07-04T17:27:16.817738Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:27:16.817738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Hales-Jewett and Moser numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D.H.J. Polymath","submitted_at":"2010-02-02T00:55:11Z","abstract_excerpt":"For any $n \\geq 0$ and $k \\geq 1$, the \\emph{density Hales-Jewett number} $c_{n,k}$ is defined as the size of the largest subset of the cube $[k]^n$ := $\\{1,...,k\\}^n$ which contains no combinatorial line; similarly, the Moser number $c'_{n,k}$ is the largest subset of the cube $[k]^n$ which contains no geometric line. A deep theorem of Furstenberg and Katznelson shows that $c_{n,k}$ = $o(k^n)$ as $n \\to \\infty$ (which implies a similar claim for $c'_{n,k}$); this is already non-trivial for $k = 3$. Several new proofs of this result have also been recently established.\n  Using both human and c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0374","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1002.0374/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":"1002.0374","created_at":"2026-07-04T17:27:16.817795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.0374v2","created_at":"2026-07-04T17:27:16.817795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0374","created_at":"2026-07-04T17:27:16.817795+00:00"},{"alias_kind":"pith_short_12","alias_value":"K3FD6WY4AKKJ","created_at":"2026-07-04T17:27:16.817795+00:00"},{"alias_kind":"pith_short_16","alias_value":"K3FD6WY4AKKJMVWN","created_at":"2026-07-04T17:27:16.817795+00:00"},{"alias_kind":"pith_short_8","alias_value":"K3FD6WY4","created_at":"2026-07-04T17:27:16.817795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.22155","citing_title":"Improved Lower Bounds for the Hales-Jewett Numbers via Symmetric Colorings","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2607.02226","citing_title":"One-Weight Colorings, the Symmetric Class, and Lower Bounds for Hales--Jewett Numbers","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA","json":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA.json","graph_json":"https://pith.science/api/pith-number/K3FD6WY4AKKJMVWNE7Y2CERVVA/graph.json","events_json":"https://pith.science/api/pith-number/K3FD6WY4AKKJMVWNE7Y2CERVVA/events.json","paper":"https://pith.science/paper/K3FD6WY4"},"agent_actions":{"view_html":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA","download_json":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA.json","view_paper":"https://pith.science/paper/K3FD6WY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.0374&json=true","fetch_graph":"https://pith.science/api/pith-number/K3FD6WY4AKKJMVWNE7Y2CERVVA/graph.json","fetch_events":"https://pith.science/api/pith-number/K3FD6WY4AKKJMVWNE7Y2CERVVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/action/storage_attestation","attest_author":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/action/author_attestation","sign_citation":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/action/citation_signature","submit_replication":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/action/replication_record"}},"created_at":"2026-07-04T17:27:16.817795+00:00","updated_at":"2026-07-04T17:27:16.817795+00:00"}