{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VY5AGQL7VPZ3NTVBZ2HYD63UZA","short_pith_number":"pith:VY5AGQL7","schema_version":"1.0","canonical_sha256":"ae3a03417fabf3b6cea1ce8f81fb74c82892d9f6ae6e87d3786eeb11911f012c","source":{"kind":"arxiv","id":"2608.12013","version":1},"attestation_state":"computed","paper":{"title":"Layer barriers for colour-biased tight Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Qinfei Tang, Zijian Deng","submitted_at":"2026-08-12T12:49:10Z","abstract_excerpt":"We construct a family of layer barriers for colour-biased tight Hamilton cycles in uniform hypergraphs. For every $k\\ge 3$ and every $a\\in\\{0,\\ldots,k-1\\}$, we give a red--blue coloured $k$-graph that contains a tight Hamilton cycle, while every tight Hamilton cycle in the construction is perfectly colour-balanced. The construction underlying the higher-uniformity threshold conjectured by Behague, Clemen, Hyde and Morrison corresponds to the boundary case $a=0$ of this family. We show that interior choices of $a$ can yield strictly denser barriers. In particular, for $k=17$ and $a=8$, the asym"},"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":"2608.12013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-12T12:49:10Z","cross_cats_sorted":[],"title_canon_sha256":"682f51f4e590565ca3ccb424b17b957739dae585650514d4b76abeb93f02ce19","abstract_canon_sha256":"1a93d6080889f9927c6c9f55940956bb7fd608b9190f54e4b427fa2c1aa70274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T01:29:15.446689Z","signature_b64":"lpEakZJaEPdR+DdWqMw8lctvK8BoulivQw3TNXNaBMOxzQqvrOfMfbIcSHm6MJ1F+KpJNK+EIJm12MKBvSyEBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae3a03417fabf3b6cea1ce8f81fb74c82892d9f6ae6e87d3786eeb11911f012c","last_reissued_at":"2026-08-13T01:29:15.444312Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T01:29:15.444312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Layer barriers for colour-biased tight Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Qinfei Tang, Zijian Deng","submitted_at":"2026-08-12T12:49:10Z","abstract_excerpt":"We construct a family of layer barriers for colour-biased tight Hamilton cycles in uniform hypergraphs. For every $k\\ge 3$ and every $a\\in\\{0,\\ldots,k-1\\}$, we give a red--blue coloured $k$-graph that contains a tight Hamilton cycle, while every tight Hamilton cycle in the construction is perfectly colour-balanced. The construction underlying the higher-uniformity threshold conjectured by Behague, Clemen, Hyde and Morrison corresponds to the boundary case $a=0$ of this family. We show that interior choices of $a$ can yield strictly denser barriers. In particular, for $k=17$ and $a=8$, the asym"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.12013","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/2608.12013/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":"2608.12013","created_at":"2026-08-13T01:29:15.445607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.12013v1","created_at":"2026-08-13T01:29:15.445607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.12013","created_at":"2026-08-13T01:29:15.445607+00:00"},{"alias_kind":"pith_short_12","alias_value":"VY5AGQL7VPZ3","created_at":"2026-08-13T01:29:15.445607+00:00"},{"alias_kind":"pith_short_16","alias_value":"VY5AGQL7VPZ3NTVB","created_at":"2026-08-13T01:29:15.445607+00:00"},{"alias_kind":"pith_short_8","alias_value":"VY5AGQL7","created_at":"2026-08-13T01:29:15.445607+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/VY5AGQL7VPZ3NTVBZ2HYD63UZA","json":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA.json","graph_json":"https://pith.science/api/pith-number/VY5AGQL7VPZ3NTVBZ2HYD63UZA/graph.json","events_json":"https://pith.science/api/pith-number/VY5AGQL7VPZ3NTVBZ2HYD63UZA/events.json","paper":"https://pith.science/paper/VY5AGQL7"},"agent_actions":{"view_html":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA","download_json":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA.json","view_paper":"https://pith.science/paper/VY5AGQL7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.12013&json=true","fetch_graph":"https://pith.science/api/pith-number/VY5AGQL7VPZ3NTVBZ2HYD63UZA/graph.json","fetch_events":"https://pith.science/api/pith-number/VY5AGQL7VPZ3NTVBZ2HYD63UZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA/action/storage_attestation","attest_author":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA/action/author_attestation","sign_citation":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA/action/citation_signature","submit_replication":"https://pith.science/pith/VY5AGQL7VPZ3NTVBZ2HYD63UZA/action/replication_record"}},"created_at":"2026-08-13T01:29:15.445607+00:00","updated_at":"2026-08-13T01:29:15.445607+00:00"}