{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:K3FD6WY4AKKJMVWNE7Y2CERVVA","short_pith_number":"pith:K3FD6WY4","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"},"canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","source":{"kind":"arxiv","id":"1002.0374","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.0374","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1002.0374v2","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0374","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"K3FD6WY4AKKJ","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"K3FD6WY4AKKJMVWN","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"K3FD6WY4","created_at":"2026-07-04T17:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:K3FD6WY4AKKJMVWNE7Y2CERVVA","target":"record","payload":{"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"},"canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","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"},"source_kind":"arxiv","source_id":"1002.0374","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-07-04T17:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86OSGNMwXTFBt1UlLM6vt1xnIue+J0gZ2bbQ/uWxAYqwKDSwqx5Jpik7+3vAT+5HmePKnXNe6wVlhFaUza69Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:48:49.101553Z"},"content_sha256":"2c8425b66c2c1a324dfb749f0cff422b79803103bfd624ab848f2c134863d458","schema_version":"1.0","event_id":"sha256:2c8425b66c2c1a324dfb749f0cff422b79803103bfd624ab848f2c134863d458"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:K3FD6WY4AKKJMVWNE7Y2CERVVA","target":"graph","payload":{"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"},"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-07-04T17:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sMNqJs7Ox9HQpbOOZRGrPtb4WjWv3i42c4Rf9nS8ARve4CzlLFbfA3ZVpaIl8X2DmaElquqkmlIb8oVPVYeUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T01:48:49.101923Z"},"content_sha256":"f3f6a2abb3a3a6aa215296dcf212904b87dae4b7dd6dd112c7362e6e770b04a4","schema_version":"1.0","event_id":"sha256:f3f6a2abb3a3a6aa215296dcf212904b87dae4b7dd6dd112c7362e6e770b04a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/bundle.json","state_url":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/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-07-05T01:48:49Z","links":{"resolver":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA","bundle":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/bundle.json","state":"https://pith.science/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K3FD6WY4AKKJMVWNE7Y2CERVVA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:K3FD6WY4AKKJMVWNE7Y2CERVVA","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":"abcf82da96ceaa2fe9b11694ca56833ae1f827cfca3df1833db75725ca728bb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-02T00:55:11Z","title_canon_sha256":"862bcab0189d577d307c5f3285cad1320e44f82f9f920bef554afb660f48bad4"},"schema_version":"1.0","source":{"id":"1002.0374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.0374","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"1002.0374v2","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.0374","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"K3FD6WY4AKKJ","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"K3FD6WY4AKKJMVWN","created_at":"2026-07-04T17:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"K3FD6WY4","created_at":"2026-07-04T17:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:f3f6a2abb3a3a6aa215296dcf212904b87dae4b7dd6dd112c7362e6e770b04a4","target":"graph","created_at":"2026-07-04T17:27:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1002.0374/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"D.H.J. Polymath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-02T00:55:11Z","title":"Density Hales-Jewett and Moser numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.0374","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:2c8425b66c2c1a324dfb749f0cff422b79803103bfd624ab848f2c134863d458","target":"record","created_at":"2026-07-04T17:27:16Z","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":"abcf82da96ceaa2fe9b11694ca56833ae1f827cfca3df1833db75725ca728bb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-02T00:55:11Z","title_canon_sha256":"862bcab0189d577d307c5f3285cad1320e44f82f9f920bef554afb660f48bad4"},"schema_version":"1.0","source":{"id":"1002.0374","kind":"arxiv","version":2}},"canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56ca3f5b1c02949656cd27f1a11235a839126c0ed3ac6fd51b339d72f28fcbb7","first_computed_at":"2026-07-04T17:27:16.817738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:27:16.817738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vmL09c93hFVCg4VhAsn4kRxpqCvgRpIpg/oaUeOc46NpJftz4jakp9NUQmTW1fCjXTLYq7juinhKQp3XPfkzDQ==","signature_status":"signed_v1","signed_at":"2026-07-04T17:27:16.818154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.0374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c8425b66c2c1a324dfb749f0cff422b79803103bfd624ab848f2c134863d458","sha256:f3f6a2abb3a3a6aa215296dcf212904b87dae4b7dd6dd112c7362e6e770b04a4"],"state_sha256":"a3e52d1537ecf6986a15b2fa8045b6f14e73b58652e551a7961bb3e9a8d9c455"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"upN76gd/BqyUIHK6+1bIBZZ4MY3fESWClg3vcpF9b/eLm6ERaCjzPl31AnseriQRSP12Xue7GjCCTnZtS+cfBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T01:48:49.103932Z","bundle_sha256":"3ff110e71268ccb00dbff60a731891a334ae50d1cdfc59fc6b11d9d965b30b62"}}