{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UUN4P4DDV3QTIQP43E4CXMFINP","short_pith_number":"pith:UUN4P4DD","schema_version":"1.0","canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","source":{"kind":"arxiv","id":"2111.07079","version":2},"attestation_state":"computed","paper":{"title":"Transversal Hamilton cycle in hypergraph systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Donglei Yang, Guanghui Wang, Jie Han, Yangyang Cheng","submitted_at":"2021-11-13T09:53:00Z","abstract_excerpt":"A $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\\textbf{H}$-transversal provided that there exists an injection $\\varphi: E(H)\\rightarrow [m]$ such that $e\\in E(H_{\\varphi(e)})$ for all $e\\in E(H)$. We show that given $k\\geq3, \\gamma>0$, sufficiently large $n$ and an $n$-vertex $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[n]}$, if $\\delta_{k-1}(H_i)\\geq(1/2+\\gamma)n$ for each $i\\in[n]$, then there exists an $\\textbf{H}$-transversal tight Hamilton cycle. This extends the r"},"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":"2111.07079","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-13T09:53:00Z","cross_cats_sorted":[],"title_canon_sha256":"0a5970b4b4404cf9d7a95eed9d613f3a1c673cb7283c5c8207fef00b6665db28","abstract_canon_sha256":"828b50fe8696d1e082b4bf8c60b29670c7a612cb734648130176d974dbd65704"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:09:03.731845Z","signature_b64":"71rW7koRQkFd/mFseWcJJYLH0D935M4HWXcwj94dJSYHfm5RMxY9YQs2vaV/FWHXCASI9NsP6zGI9hm1MnbwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","last_reissued_at":"2026-07-05T06:09:03.731358Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:09:03.731358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transversal Hamilton cycle in hypergraph systems","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Donglei Yang, Guanghui Wang, Jie Han, Yangyang Cheng","submitted_at":"2021-11-13T09:53:00Z","abstract_excerpt":"A $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[m]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$ and a $k$-graph $H$ on $V$ is said to be $\\textbf{H}$-transversal provided that there exists an injection $\\varphi: E(H)\\rightarrow [m]$ such that $e\\in E(H_{\\varphi(e)})$ for all $e\\in E(H)$. We show that given $k\\geq3, \\gamma>0$, sufficiently large $n$ and an $n$-vertex $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[n]}$, if $\\delta_{k-1}(H_i)\\geq(1/2+\\gamma)n$ for each $i\\in[n]$, then there exists an $\\textbf{H}$-transversal tight Hamilton cycle. This extends the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.07079","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/2111.07079/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":"2111.07079","created_at":"2026-07-05T06:09:03.731420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.07079v2","created_at":"2026-07-05T06:09:03.731420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07079","created_at":"2026-07-05T06:09:03.731420+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUN4P4DDV3QT","created_at":"2026-07-05T06:09:03.731420+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUN4P4DDV3QTIQP4","created_at":"2026-07-05T06:09:03.731420+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUN4P4DD","created_at":"2026-07-05T06:09:03.731420+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.01121","citing_title":"Transversal Structures in Graph Systems: A Survey","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP","json":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP.json","graph_json":"https://pith.science/api/pith-number/UUN4P4DDV3QTIQP43E4CXMFINP/graph.json","events_json":"https://pith.science/api/pith-number/UUN4P4DDV3QTIQP43E4CXMFINP/events.json","paper":"https://pith.science/paper/UUN4P4DD"},"agent_actions":{"view_html":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP","download_json":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP.json","view_paper":"https://pith.science/paper/UUN4P4DD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.07079&json=true","fetch_graph":"https://pith.science/api/pith-number/UUN4P4DDV3QTIQP43E4CXMFINP/graph.json","fetch_events":"https://pith.science/api/pith-number/UUN4P4DDV3QTIQP43E4CXMFINP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/action/storage_attestation","attest_author":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/action/author_attestation","sign_citation":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/action/citation_signature","submit_replication":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/action/replication_record"}},"created_at":"2026-07-05T06:09:03.731420+00:00","updated_at":"2026-07-05T06:09:03.731420+00:00"}