{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FGJ25ZACL2M6BDOCBXS2TUVP4P","short_pith_number":"pith:FGJ25ZAC","schema_version":"1.0","canonical_sha256":"2993aee4025e99e08dc20de5a9d2afe3c67b0566cf8392464a89447e0b25d80c","source":{"kind":"arxiv","id":"2506.04189","version":1},"attestation_state":"computed","paper":{"title":"Colour-biased Hamilton cycles in randomly perturbed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenchong Chen, Xinbu Cheng, Zhifei Yan","submitted_at":"2025-06-04T17:36:49Z","abstract_excerpt":"Given a graph $G$ and an $r$-edge-colouring $\\chi$ on $E(G)$, a Hamilton cycle $H\\subset G$ is said to have $t$ colour-bias if $H$ contains $n/r+t$ edges of the same colour in $\\chi$. Freschi, Hyde, Lada and Treglown showed every $r$-coloured graph $G$ on $n$ vertices with $\\delta(G)\\geq(r+1)n/2r+t$ contains a Hamilton cycle $H$ with $\\Omega(t)$ colour-bias, generalizing a result of Balogh, Csaba, Jing and Pluh\\'{a}r. In 2022, Gishboliner, Krivelevich and Michaeli proved that the random graph $G(n,m)$ with $m\\geq(1/2+\\varepsilon)n\\log n$ typically admits an $\\Omega(n)$ colour biased Hamilton c"},"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":"2506.04189","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-04T17:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"1f2cc50666bdd9e9f0fe4977c0965dbd1b039c61bdb451de2dbe542bda66cc30","abstract_canon_sha256":"34541e60bf7c7f025851765337345f1e4157de9d4f1fbb235036e6888ed6c4e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:58.636125Z","signature_b64":"V4GfQYQ7KdMjQqD5JhqiKF3RkV8Avhoc2NK7RaaChp20cqTbvBs4Fs0VgZDbJ1qkGjUM7aqtCDgBFUJQX/owCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2993aee4025e99e08dc20de5a9d2afe3c67b0566cf8392464a89447e0b25d80c","last_reissued_at":"2026-07-05T11:15:58.635116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:58.635116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colour-biased Hamilton cycles in randomly perturbed graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenchong Chen, Xinbu Cheng, Zhifei Yan","submitted_at":"2025-06-04T17:36:49Z","abstract_excerpt":"Given a graph $G$ and an $r$-edge-colouring $\\chi$ on $E(G)$, a Hamilton cycle $H\\subset G$ is said to have $t$ colour-bias if $H$ contains $n/r+t$ edges of the same colour in $\\chi$. Freschi, Hyde, Lada and Treglown showed every $r$-coloured graph $G$ on $n$ vertices with $\\delta(G)\\geq(r+1)n/2r+t$ contains a Hamilton cycle $H$ with $\\Omega(t)$ colour-bias, generalizing a result of Balogh, Csaba, Jing and Pluh\\'{a}r. In 2022, Gishboliner, Krivelevich and Michaeli proved that the random graph $G(n,m)$ with $m\\geq(1/2+\\varepsilon)n\\log n$ typically admits an $\\Omega(n)$ colour biased Hamilton c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04189","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/2506.04189/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":"2506.04189","created_at":"2026-07-05T11:15:58.635178+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04189v1","created_at":"2026-07-05T11:15:58.635178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04189","created_at":"2026-07-05T11:15:58.635178+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGJ25ZACL2M6","created_at":"2026-07-05T11:15:58.635178+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGJ25ZACL2M6BDOC","created_at":"2026-07-05T11:15:58.635178+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGJ25ZAC","created_at":"2026-07-05T11:15:58.635178+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/FGJ25ZACL2M6BDOCBXS2TUVP4P","json":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P.json","graph_json":"https://pith.science/api/pith-number/FGJ25ZACL2M6BDOCBXS2TUVP4P/graph.json","events_json":"https://pith.science/api/pith-number/FGJ25ZACL2M6BDOCBXS2TUVP4P/events.json","paper":"https://pith.science/paper/FGJ25ZAC"},"agent_actions":{"view_html":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P","download_json":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P.json","view_paper":"https://pith.science/paper/FGJ25ZAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04189&json=true","fetch_graph":"https://pith.science/api/pith-number/FGJ25ZACL2M6BDOCBXS2TUVP4P/graph.json","fetch_events":"https://pith.science/api/pith-number/FGJ25ZACL2M6BDOCBXS2TUVP4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P/action/storage_attestation","attest_author":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P/action/author_attestation","sign_citation":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P/action/citation_signature","submit_replication":"https://pith.science/pith/FGJ25ZACL2M6BDOCBXS2TUVP4P/action/replication_record"}},"created_at":"2026-07-05T11:15:58.635178+00:00","updated_at":"2026-07-05T11:15:58.635178+00:00"}