{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AYXESYCV3AUSF4DXU5GF7IFWRV","short_pith_number":"pith:AYXESYCV","schema_version":"1.0","canonical_sha256":"062e496055d82922f077a74c5fa0b68d5301a5aa352184c54d5c28e903bc6674","source":{"kind":"arxiv","id":"2007.12111","version":4},"attestation_state":"computed","paper":{"title":"Colour-biased Hamilton cycles in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Michael Krivelevich, Peleg Michaeli","submitted_at":"2020-07-23T16:31:09Z","abstract_excerpt":"We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This estimate is asymptotically optimal."},"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":"2007.12111","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-23T16:31:09Z","cross_cats_sorted":[],"title_canon_sha256":"28ccf0d47024e76283d7e41da0f829a0c6e4218760ef455d0d4f72b9c8181e60","abstract_canon_sha256":"e064b11fcafd3bbee6aba93a19b47b9ea3302561450f192e9b2ef2c28d4bc01c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:33:54.214388Z","signature_b64":"Sv5Snno1qJL0kvU57bU3S9/IGPh/YkKTQdVHQc8vmPgbfjjYXclr8oTZdO+Atwrg/jJHPpPPoPYxpuRezMRXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"062e496055d82922f077a74c5fa0b68d5301a5aa352184c54d5c28e903bc6674","last_reissued_at":"2026-07-05T02:33:54.213931Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:33:54.213931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colour-biased Hamilton cycles in random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Lior Gishboliner, Michael Krivelevich, Peleg Michaeli","submitted_at":"2020-07-23T16:31:09Z","abstract_excerpt":"We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This estimate is asymptotically optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.12111","kind":"arxiv","version":4},"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/2007.12111/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":"2007.12111","created_at":"2026-07-05T02:33:54.213990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.12111v4","created_at":"2026-07-05T02:33:54.213990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.12111","created_at":"2026-07-05T02:33:54.213990+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYXESYCV3AUS","created_at":"2026-07-05T02:33:54.213990+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYXESYCV3AUSF4DX","created_at":"2026-07-05T02:33:54.213990+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYXESYCV","created_at":"2026-07-05T02:33:54.213990+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/AYXESYCV3AUSF4DXU5GF7IFWRV","json":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV.json","graph_json":"https://pith.science/api/pith-number/AYXESYCV3AUSF4DXU5GF7IFWRV/graph.json","events_json":"https://pith.science/api/pith-number/AYXESYCV3AUSF4DXU5GF7IFWRV/events.json","paper":"https://pith.science/paper/AYXESYCV"},"agent_actions":{"view_html":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV","download_json":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV.json","view_paper":"https://pith.science/paper/AYXESYCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.12111&json=true","fetch_graph":"https://pith.science/api/pith-number/AYXESYCV3AUSF4DXU5GF7IFWRV/graph.json","fetch_events":"https://pith.science/api/pith-number/AYXESYCV3AUSF4DXU5GF7IFWRV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV/action/storage_attestation","attest_author":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV/action/author_attestation","sign_citation":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV/action/citation_signature","submit_replication":"https://pith.science/pith/AYXESYCV3AUSF4DXU5GF7IFWRV/action/replication_record"}},"created_at":"2026-07-05T02:33:54.213990+00:00","updated_at":"2026-07-05T02:33:54.213990+00:00"}