{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GZJMSQGDZVCLAUG7CIUJPDHRJJ","short_pith_number":"pith:GZJMSQGD","schema_version":"1.0","canonical_sha256":"3652c940c3cd44b050df1228978cf14a437c6b9f54d7ecd7180f986eceee758a","source":{"kind":"arxiv","id":"2606.03520","version":1},"attestation_state":"computed","paper":{"title":"Finite palette endpoints and degree-square Tur\\'an problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Chen, Jiangdong Ai, Ming Chen, Tianxiao Zhao, Zilong Yan","submitted_at":"2026-06-02T11:42:17Z","abstract_excerpt":"We study finite extremal problems for palettes, which arise from the palette framework for the uniform Tur\\'an densities of $3$-uniform hypergraphs. Recent work has developed reductions from palette colorability questions to extremal problems for digraphs. In this paper we prove an exact degree-square refinement of these reductions for a natural family of left and right tournament palettes.\n  For a tournament $T$, let $P_T^L$ and $P_T^R$ denote the left and right palettes generated by $T$. We prove that if $T$ is self-converse and has at least two vertices, then for every $m\\ge 1$ the maximum "},"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":"2606.03520","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-02T11:42:17Z","cross_cats_sorted":[],"title_canon_sha256":"dc50e217b8be7acf13af48c96d96d8c367df7f08bf3dc92ca591a4c5096c6a84","abstract_canon_sha256":"717e4cc1a92c977bde92a4c0b4cb7b3a1bc4988022966529c996f05e00b62efb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:59.881056Z","signature_b64":"XTsopmhFkbk9xqQdpFWI2ifOmvf0cIN5JlPo3UW9Q3gtIvmhAvHgC6hQ94hN4KmJCG/fhC0goVX2d6oU6a5UBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3652c940c3cd44b050df1228978cf14a437c6b9f54d7ecd7180f986eceee758a","last_reissued_at":"2026-06-03T01:05:59.880686Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:59.880686Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finite palette endpoints and degree-square Tur\\'an problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Chen, Jiangdong Ai, Ming Chen, Tianxiao Zhao, Zilong Yan","submitted_at":"2026-06-02T11:42:17Z","abstract_excerpt":"We study finite extremal problems for palettes, which arise from the palette framework for the uniform Tur\\'an densities of $3$-uniform hypergraphs. Recent work has developed reductions from palette colorability questions to extremal problems for digraphs. In this paper we prove an exact degree-square refinement of these reductions for a natural family of left and right tournament palettes.\n  For a tournament $T$, let $P_T^L$ and $P_T^R$ denote the left and right palettes generated by $T$. We prove that if $T$ is self-converse and has at least two vertices, then for every $m\\ge 1$ the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03520","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/2606.03520/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":"2606.03520","created_at":"2026-06-03T01:05:59.880749+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03520v1","created_at":"2026-06-03T01:05:59.880749+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03520","created_at":"2026-06-03T01:05:59.880749+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZJMSQGDZVCL","created_at":"2026-06-03T01:05:59.880749+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZJMSQGDZVCLAUG7","created_at":"2026-06-03T01:05:59.880749+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZJMSQGD","created_at":"2026-06-03T01:05:59.880749+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/GZJMSQGDZVCLAUG7CIUJPDHRJJ","json":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ.json","graph_json":"https://pith.science/api/pith-number/GZJMSQGDZVCLAUG7CIUJPDHRJJ/graph.json","events_json":"https://pith.science/api/pith-number/GZJMSQGDZVCLAUG7CIUJPDHRJJ/events.json","paper":"https://pith.science/paper/GZJMSQGD"},"agent_actions":{"view_html":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ","download_json":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ.json","view_paper":"https://pith.science/paper/GZJMSQGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03520&json=true","fetch_graph":"https://pith.science/api/pith-number/GZJMSQGDZVCLAUG7CIUJPDHRJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GZJMSQGDZVCLAUG7CIUJPDHRJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ/action/storage_attestation","attest_author":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ/action/author_attestation","sign_citation":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ/action/citation_signature","submit_replication":"https://pith.science/pith/GZJMSQGDZVCLAUG7CIUJPDHRJJ/action/replication_record"}},"created_at":"2026-06-03T01:05:59.880749+00:00","updated_at":"2026-06-03T01:05:59.880749+00:00"}