{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6GUDTM3M52GNNEJR4YYF23WFKJ","short_pith_number":"pith:6GUDTM3M","schema_version":"1.0","canonical_sha256":"f1a839b36cee8cd69131e6305d6ec55275279baf6a4b40cededb82513ff58653","source":{"kind":"arxiv","id":"2411.15137","version":1},"attestation_state":"computed","paper":{"title":"Reasonable Bounds for Combinatorial Lines of Length Three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Amey Bhangale, Dor Minzer, Subhash Khot, Yang P. Liu","submitted_at":"2024-11-22T18:58:32Z","abstract_excerpt":"We prove that any subset $A \\subseteq [3]^n$ with $3^{-n}|A| \\ge (\\log\\log\\log\\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \\in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2, \\dots, n$. This improves on the previous best bound of $3^{-n}|A| \\ge \\Omega((\\log^* n)^{-1/2})$ of [D.H.J. Polymath, Ann. of Math. 2012]."},"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":"2411.15137","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-22T18:58:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"07a3bb8323fb0d493568c9549f1c0f0049bec2447183476e1af08a53386f87ca","abstract_canon_sha256":"5bfbcecd4299c4e6ecc3a45457ba91468a8a48c717af09f0d1722ab9658cf7d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:16.768030Z","signature_b64":"YRT1T1bP49BNpaLbD6haCmJkCL9Nt/qodrD+0mkBdUf4PUIxlEIdSmxpEPhrpkyUouZ4DWGmgviVa2JsN7jCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a839b36cee8cd69131e6305d6ec55275279baf6a4b40cededb82513ff58653","last_reissued_at":"2026-07-05T09:39:16.767572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:16.767572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reasonable Bounds for Combinatorial Lines of Length Three","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Amey Bhangale, Dor Minzer, Subhash Khot, Yang P. Liu","submitted_at":"2024-11-22T18:58:32Z","abstract_excerpt":"We prove that any subset $A \\subseteq [3]^n$ with $3^{-n}|A| \\ge (\\log\\log\\log\\log n)^{-c}$ contains a combinatorial line of length $3$, i.e., $x, y, z \\in A$, not all equal, with $x_i=y_i=z_i$ or $(x_i,y_i,z_i)=(0,1,2)$ for all $i = 1, 2, \\dots, n$. This improves on the previous best bound of $3^{-n}|A| \\ge \\Omega((\\log^* n)^{-1/2})$ of [D.H.J. Polymath, Ann. of Math. 2012]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15137","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.15137/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":"2411.15137","created_at":"2026-07-05T09:39:16.767629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15137v1","created_at":"2026-07-05T09:39:16.767629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15137","created_at":"2026-07-05T09:39:16.767629+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GUDTM3M52GN","created_at":"2026-07-05T09:39:16.767629+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GUDTM3M52GNNEJR","created_at":"2026-07-05T09:39:16.767629+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GUDTM3M","created_at":"2026-07-05T09:39:16.767629+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/6GUDTM3M52GNNEJR4YYF23WFKJ","json":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ.json","graph_json":"https://pith.science/api/pith-number/6GUDTM3M52GNNEJR4YYF23WFKJ/graph.json","events_json":"https://pith.science/api/pith-number/6GUDTM3M52GNNEJR4YYF23WFKJ/events.json","paper":"https://pith.science/paper/6GUDTM3M"},"agent_actions":{"view_html":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ","download_json":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ.json","view_paper":"https://pith.science/paper/6GUDTM3M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15137&json=true","fetch_graph":"https://pith.science/api/pith-number/6GUDTM3M52GNNEJR4YYF23WFKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6GUDTM3M52GNNEJR4YYF23WFKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ/action/storage_attestation","attest_author":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ/action/author_attestation","sign_citation":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ/action/citation_signature","submit_replication":"https://pith.science/pith/6GUDTM3M52GNNEJR4YYF23WFKJ/action/replication_record"}},"created_at":"2026-07-05T09:39:16.767629+00:00","updated_at":"2026-07-05T09:39:16.767629+00:00"}