{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ICRIHHPUH6YPPU5PJEEN7ZRKD2","short_pith_number":"pith:ICRIHHPU","schema_version":"1.0","canonical_sha256":"40a2839df43fb0f7d3af4908dfe62a1eb6bd6ba4715e1144f5e96171256f1371","source":{"kind":"arxiv","id":"2603.05490","version":2},"attestation_state":"computed","paper":{"title":"Chromatic thresholds for linear equations and recurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Ningyuan Yang, Shengtong Zhang, Zhuo Wu","submitted_at":"2026-03-05T18:56:15Z","abstract_excerpt":"Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\\mathbb F_p$. Given a homogeneous equation $\\mathcal L:\\sum_{i=1}^k c_i x_i=0$ with $k\\ge 3$, we study $\\mathcal L$-solution-free sets $A\\subseteq \\mathbb F_p$ through the chromatic number of the Cayley graph $\\mathsf{Cay}(\\mathbb F_p,A)$. We introduce the \\emph{chromatic threshold} $\\delta_\\chi(\\mathcal L)$, the minimum density that guarantees bounded chromatic number of $\\mathsf{Cay}(\\mathbb F_p,A)$ among all $\\mathcal L$-solution-free sets $A$, and determ"},"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":"2603.05490","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-03-05T18:56:15Z","cross_cats_sorted":[],"title_canon_sha256":"c06533c167569794df77ca1baa972eaec8ff70ec02dbfafc90b9b99cf99a3e64","abstract_canon_sha256":"c0fadeef1b00575a3f48556f9b09da0744f7395c733a8454f17fd26139588940"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T00:17:10.656131Z","signature_b64":"BB3Z40wb7TyC4U1dJRNpAJGgUyTZuX7LEVMyiGCU+QvIDFvWHrCDNuGyZak5OccsYpTZGuvArMXgjFmF59BmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40a2839df43fb0f7d3af4908dfe62a1eb6bd6ba4715e1144f5e96171256f1371","last_reissued_at":"2026-07-01T00:17:10.655262Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T00:17:10.655262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic thresholds for linear equations and recurrence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hong Liu, Ningyuan Yang, Shengtong Zhang, Zhuo Wu","submitted_at":"2026-03-05T18:56:15Z","abstract_excerpt":"Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\\mathbb F_p$. Given a homogeneous equation $\\mathcal L:\\sum_{i=1}^k c_i x_i=0$ with $k\\ge 3$, we study $\\mathcal L$-solution-free sets $A\\subseteq \\mathbb F_p$ through the chromatic number of the Cayley graph $\\mathsf{Cay}(\\mathbb F_p,A)$. We introduce the \\emph{chromatic threshold} $\\delta_\\chi(\\mathcal L)$, the minimum density that guarantees bounded chromatic number of $\\mathsf{Cay}(\\mathbb F_p,A)$ among all $\\mathcal L$-solution-free sets $A$, and determ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.05490","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/2603.05490/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":"2603.05490","created_at":"2026-07-01T00:17:10.655375+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.05490v2","created_at":"2026-07-01T00:17:10.655375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.05490","created_at":"2026-07-01T00:17:10.655375+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICRIHHPUH6YP","created_at":"2026-07-01T00:17:10.655375+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICRIHHPUH6YPPU5P","created_at":"2026-07-01T00:17:10.655375+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICRIHHPU","created_at":"2026-07-01T00:17:10.655375+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2606.30767","citing_title":"Linear equations and chromatic thresholds in $B_h$ sets","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30767","citing_title":"Linear equations and chromatic thresholds in $B_h$ sets","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10897","citing_title":"Chromatic thresholds for pairs of graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2","json":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2.json","graph_json":"https://pith.science/api/pith-number/ICRIHHPUH6YPPU5PJEEN7ZRKD2/graph.json","events_json":"https://pith.science/api/pith-number/ICRIHHPUH6YPPU5PJEEN7ZRKD2/events.json","paper":"https://pith.science/paper/ICRIHHPU"},"agent_actions":{"view_html":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2","download_json":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2.json","view_paper":"https://pith.science/paper/ICRIHHPU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.05490&json=true","fetch_graph":"https://pith.science/api/pith-number/ICRIHHPUH6YPPU5PJEEN7ZRKD2/graph.json","fetch_events":"https://pith.science/api/pith-number/ICRIHHPUH6YPPU5PJEEN7ZRKD2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2/action/storage_attestation","attest_author":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2/action/author_attestation","sign_citation":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2/action/citation_signature","submit_replication":"https://pith.science/pith/ICRIHHPUH6YPPU5PJEEN7ZRKD2/action/replication_record"}},"created_at":"2026-07-01T00:17:10.655375+00:00","updated_at":"2026-07-01T00:17:10.655375+00:00"}