{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2DZ5A62ITFRMGQE3OWJCSXUBPO","short_pith_number":"pith:2DZ5A62I","schema_version":"1.0","canonical_sha256":"d0f3d07b489962c3409b7592295e817ba79f9861bec2432aa0ba30c2c8313a5c","source":{"kind":"arxiv","id":"2310.04138","version":2},"attestation_state":"computed","paper":{"title":"Universality for transversal Hamilton cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Katherine Staden, Patrick Morris, Yanitsa Pehova","submitted_at":"2023-10-06T10:22:47Z","abstract_excerpt":"Let $\\mathbf{G}=\\{G_1, \\ldots, G_m\\}$ be a graph collection on a common vertex set $V$ of size $n$ such that $\\delta(G_i) \\geq (1+o(1))n/2$ for every $i \\in [m]$. We show that $\\mathbf{G}$ contains every Hamilton cycle pattern. That is, for every map $\\chi: [n] \\to [m]$ there is a Hamilton cycle whose $i$-th edge lies in $G_{\\chi(i)}$."},"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":"2310.04138","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-10-06T10:22:47Z","cross_cats_sorted":[],"title_canon_sha256":"91b1c7e2ca1cbd0e6d6672108d17ca24fc8739d00fc4c34a67d7d75668667956","abstract_canon_sha256":"5555714a2f7d2e86a6cb324c03a0e31b47f3ca442dbdf1e40ec25aab934b4b31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:55.068042Z","signature_b64":"u2jxv0AYCu36EqbEn41n6KF7KgnENSBkDLdi7gRWbQL4MV9WVax68PaWtbtUrSZcpETHzSacsC188NK6ufrWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f3d07b489962c3409b7592295e817ba79f9861bec2432aa0ba30c2c8313a5c","last_reissued_at":"2026-06-24T01:14:55.067641Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:55.067641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality for transversal Hamilton cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Candida Bowtell, Katherine Staden, Patrick Morris, Yanitsa Pehova","submitted_at":"2023-10-06T10:22:47Z","abstract_excerpt":"Let $\\mathbf{G}=\\{G_1, \\ldots, G_m\\}$ be a graph collection on a common vertex set $V$ of size $n$ such that $\\delta(G_i) \\geq (1+o(1))n/2$ for every $i \\in [m]$. We show that $\\mathbf{G}$ contains every Hamilton cycle pattern. That is, for every map $\\chi: [n] \\to [m]$ there is a Hamilton cycle whose $i$-th edge lies in $G_{\\chi(i)}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.04138","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/2310.04138/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":"2310.04138","created_at":"2026-06-24T01:14:55.067698+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.04138v2","created_at":"2026-06-24T01:14:55.067698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.04138","created_at":"2026-06-24T01:14:55.067698+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DZ5A62ITFRM","created_at":"2026-06-24T01:14:55.067698+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DZ5A62ITFRMGQE3","created_at":"2026-06-24T01:14:55.067698+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DZ5A62I","created_at":"2026-06-24T01:14:55.067698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO","json":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO.json","graph_json":"https://pith.science/api/pith-number/2DZ5A62ITFRMGQE3OWJCSXUBPO/graph.json","events_json":"https://pith.science/api/pith-number/2DZ5A62ITFRMGQE3OWJCSXUBPO/events.json","paper":"https://pith.science/paper/2DZ5A62I"},"agent_actions":{"view_html":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO","download_json":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO.json","view_paper":"https://pith.science/paper/2DZ5A62I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.04138&json=true","fetch_graph":"https://pith.science/api/pith-number/2DZ5A62ITFRMGQE3OWJCSXUBPO/graph.json","fetch_events":"https://pith.science/api/pith-number/2DZ5A62ITFRMGQE3OWJCSXUBPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO/action/storage_attestation","attest_author":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO/action/author_attestation","sign_citation":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO/action/citation_signature","submit_replication":"https://pith.science/pith/2DZ5A62ITFRMGQE3OWJCSXUBPO/action/replication_record"}},"created_at":"2026-06-24T01:14:55.067698+00:00","updated_at":"2026-06-24T01:14:55.067698+00:00"}