{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QKZIGAOGJR2JWOU5XT3GJYH677","short_pith_number":"pith:QKZIGAOG","schema_version":"1.0","canonical_sha256":"82b28301c64c749b3a9dbcf664e0fefffc05a8272fce684edf312acd4a6b19bd","source":{"kind":"arxiv","id":"2302.00080","version":1},"attestation_state":"computed","paper":{"title":"Rainbow Hamilton cycle in hypergraph system","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Guanghui Wang, Guiying Yan, Yucong Tang","submitted_at":"2023-01-31T20:23:00Z","abstract_excerpt":"In this paper, we develop a new rainbow Hamilton framework, which is of independent interest, settling the problem proposed by Gupta, Hamann, M\\\"{u}yesser, Parczyk, and Sgueglia when $k=3$, and draw the general conclusion for any $k\\geq3$ as follows. A $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[n]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$, moreover, a $k$-graph $H$ on $V$ is rainbow if $E(H)\\subseteq \\bigcup_{i\\in[n]}E(H_i)$ and $|E(H)\\cap E(H_i)|\\leq1$ for $i\\in[n]$. We show that given $\\gamma> 0$, sufficiently large $n$ and an $n$-vertex $k$-graph sy"},"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":"2302.00080","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2023-01-31T20:23:00Z","cross_cats_sorted":[],"title_canon_sha256":"c762f17426b3a9476d168e59bf6d298f034b70f2ddd7447be206ac05210ca457","abstract_canon_sha256":"d2ab0132c9231028207122f9bb509a4ec64c5212703d1fab738d7f2bb8a1779f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:59.176224Z","signature_b64":"DV0j5oZSzKJRlf/+vhpLZvDChRWpaPKcBz3O0cNuqN18zG3GhxtMOHYLNPDKyyCaH8h1PBc8vCNgjs2nAsTpCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82b28301c64c749b3a9dbcf664e0fefffc05a8272fce684edf312acd4a6b19bd","last_reissued_at":"2026-07-05T05:37:59.175761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:59.175761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow Hamilton cycle in hypergraph system","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bin Wang, Guanghui Wang, Guiying Yan, Yucong Tang","submitted_at":"2023-01-31T20:23:00Z","abstract_excerpt":"In this paper, we develop a new rainbow Hamilton framework, which is of independent interest, settling the problem proposed by Gupta, Hamann, M\\\"{u}yesser, Parczyk, and Sgueglia when $k=3$, and draw the general conclusion for any $k\\geq3$ as follows. A $k$-graph system $\\textbf{H}=\\{H_i\\}_{i\\in[n]}$ is a family of not necessarily distinct $k$-graphs on the same $n$-vertex set $V$, moreover, a $k$-graph $H$ on $V$ is rainbow if $E(H)\\subseteq \\bigcup_{i\\in[n]}E(H_i)$ and $|E(H)\\cap E(H_i)|\\leq1$ for $i\\in[n]$. We show that given $\\gamma> 0$, sufficiently large $n$ and an $n$-vertex $k$-graph sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00080","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/2302.00080/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":"2302.00080","created_at":"2026-07-05T05:37:59.175816+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00080v1","created_at":"2026-07-05T05:37:59.175816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00080","created_at":"2026-07-05T05:37:59.175816+00:00"},{"alias_kind":"pith_short_12","alias_value":"QKZIGAOGJR2J","created_at":"2026-07-05T05:37:59.175816+00:00"},{"alias_kind":"pith_short_16","alias_value":"QKZIGAOGJR2JWOU5","created_at":"2026-07-05T05:37:59.175816+00:00"},{"alias_kind":"pith_short_8","alias_value":"QKZIGAOG","created_at":"2026-07-05T05:37:59.175816+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":129,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677","json":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677.json","graph_json":"https://pith.science/api/pith-number/QKZIGAOGJR2JWOU5XT3GJYH677/graph.json","events_json":"https://pith.science/api/pith-number/QKZIGAOGJR2JWOU5XT3GJYH677/events.json","paper":"https://pith.science/paper/QKZIGAOG"},"agent_actions":{"view_html":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677","download_json":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677.json","view_paper":"https://pith.science/paper/QKZIGAOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00080&json=true","fetch_graph":"https://pith.science/api/pith-number/QKZIGAOGJR2JWOU5XT3GJYH677/graph.json","fetch_events":"https://pith.science/api/pith-number/QKZIGAOGJR2JWOU5XT3GJYH677/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677/action/storage_attestation","attest_author":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677/action/author_attestation","sign_citation":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677/action/citation_signature","submit_replication":"https://pith.science/pith/QKZIGAOGJR2JWOU5XT3GJYH677/action/replication_record"}},"created_at":"2026-07-05T05:37:59.175816+00:00","updated_at":"2026-07-05T05:37:59.175816+00:00"}