{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EKKSSISUQT6SQVYKJ6INOXWKLO","short_pith_number":"pith:EKKSSISU","schema_version":"1.0","canonical_sha256":"229529225484fd28570a4f90d75eca5bbaf1417c436c833d846fc66864614a33","source":{"kind":"arxiv","id":"2403.09913","version":1},"attestation_state":"computed","paper":{"title":"Stability of transversal Hamilton cycles and paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Staden, Yangyang Cheng","submitted_at":"2024-03-14T23:12:55Z","abstract_excerpt":"Given graphs $G_1,\\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \\emph{transversal} or \\emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal Hamilton cycles: the minimum degree required to guarantee a transversal Hamilton cycle can be lowered as long as the graph collection $G_1,\\ldots,G_n$ is far in edit distance from several extremal cases. We obtain an analogous result for Hamilton paths. The proof is a combination of our newly developed regularity-blow-up method for transversals, along with the abso"},"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":"2403.09913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-14T23:12:55Z","cross_cats_sorted":[],"title_canon_sha256":"3ad33366801aed88773e29c21e8dbed7a11fdb87e6f07de8460841163f46d9c3","abstract_canon_sha256":"1c22b129a70ca20de9c9f3e657c109714053b35904405c76ee6356103d258f73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:56:27.120821Z","signature_b64":"Um7oxNlUL7q8iM7HSkVqW1tuszO3KlwmfQR0fXrYDOVdqfICfxzu8M8BI+YeTtNuSaqRAk7JVTtPCLIw3lUrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"229529225484fd28570a4f90d75eca5bbaf1417c436c833d846fc66864614a33","last_reissued_at":"2026-07-05T07:56:27.120209Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:56:27.120209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stability of transversal Hamilton cycles and paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Katherine Staden, Yangyang Cheng","submitted_at":"2024-03-14T23:12:55Z","abstract_excerpt":"Given graphs $G_1,\\ldots,G_s$ all on a common vertex set and a graph $H$ with $e(H) = s$, a copy of $H$ is \\emph{transversal} or \\emph{rainbow} if it contains one edge from each $G_i$. We establish a stability result for transversal Hamilton cycles: the minimum degree required to guarantee a transversal Hamilton cycle can be lowered as long as the graph collection $G_1,\\ldots,G_n$ is far in edit distance from several extremal cases. We obtain an analogous result for Hamilton paths. The proof is a combination of our newly developed regularity-blow-up method for transversals, along with the abso"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09913","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/2403.09913/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":"2403.09913","created_at":"2026-07-05T07:56:27.120284+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.09913v1","created_at":"2026-07-05T07:56:27.120284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09913","created_at":"2026-07-05T07:56:27.120284+00:00"},{"alias_kind":"pith_short_12","alias_value":"EKKSSISUQT6S","created_at":"2026-07-05T07:56:27.120284+00:00"},{"alias_kind":"pith_short_16","alias_value":"EKKSSISUQT6SQVYK","created_at":"2026-07-05T07:56:27.120284+00:00"},{"alias_kind":"pith_short_8","alias_value":"EKKSSISU","created_at":"2026-07-05T07:56:27.120284+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00998","citing_title":"Transversal Hamilton cycles in digraph collections","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO","json":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO.json","graph_json":"https://pith.science/api/pith-number/EKKSSISUQT6SQVYKJ6INOXWKLO/graph.json","events_json":"https://pith.science/api/pith-number/EKKSSISUQT6SQVYKJ6INOXWKLO/events.json","paper":"https://pith.science/paper/EKKSSISU"},"agent_actions":{"view_html":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO","download_json":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO.json","view_paper":"https://pith.science/paper/EKKSSISU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.09913&json=true","fetch_graph":"https://pith.science/api/pith-number/EKKSSISUQT6SQVYKJ6INOXWKLO/graph.json","fetch_events":"https://pith.science/api/pith-number/EKKSSISUQT6SQVYKJ6INOXWKLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO/action/storage_attestation","attest_author":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO/action/author_attestation","sign_citation":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO/action/citation_signature","submit_replication":"https://pith.science/pith/EKKSSISUQT6SQVYKJ6INOXWKLO/action/replication_record"}},"created_at":"2026-07-05T07:56:27.120284+00:00","updated_at":"2026-07-05T07:56:27.120284+00:00"}