{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UUN4P4DDV3QTIQP43E4CXMFINP","short_pith_number":"pith:UUN4P4DD","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"},"canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","source":{"kind":"arxiv","id":"2111.07079","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.07079","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2111.07079v2","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07079","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"UUN4P4DDV3QT","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"UUN4P4DDV3QTIQP4","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"UUN4P4DD","created_at":"2026-07-05T06:09:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UUN4P4DDV3QTIQP43E4CXMFINP","target":"record","payload":{"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"},"canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","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"},"source_kind":"arxiv","source_id":"2111.07079","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJ/kpEQ9rAetHWbbiRMN/ay+XCEmwRcgJkJXmei887AqhTCnEB5NkjKGv+BnO1IJAVUvjhgXf44MZl+F92+JDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:17:05.858904Z"},"content_sha256":"225af28e8939b8513a97ad8a531aafdc212a68130d83c07aaf78bbf901928faf","schema_version":"1.0","event_id":"sha256:225af28e8939b8513a97ad8a531aafdc212a68130d83c07aaf78bbf901928faf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UUN4P4DDV3QTIQP43E4CXMFINP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:09:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U4V0sLaGjJ+D09hVqKjVibtTLhMYZFoS7h34id04l4CB3V8QM3CUlw1FWaaj0O9EZwvQ5VkfXWIQ6bW3o3UvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T15:17:05.859880Z"},"content_sha256":"42807af02c81cbd53d749e168b5f74acb6e7f5c30445380f202a27063d82b175","schema_version":"1.0","event_id":"sha256:42807af02c81cbd53d749e168b5f74acb6e7f5c30445380f202a27063d82b175"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/bundle.json","state_url":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UUN4P4DDV3QTIQP43E4CXMFINP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T15:17:05Z","links":{"resolver":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP","bundle":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/bundle.json","state":"https://pith.science/pith/UUN4P4DDV3QTIQP43E4CXMFINP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UUN4P4DDV3QTIQP43E4CXMFINP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UUN4P4DDV3QTIQP43E4CXMFINP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"828b50fe8696d1e082b4bf8c60b29670c7a612cb734648130176d974dbd65704","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-13T09:53:00Z","title_canon_sha256":"0a5970b4b4404cf9d7a95eed9d613f3a1c673cb7283c5c8207fef00b6665db28"},"schema_version":"1.0","source":{"id":"2111.07079","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.07079","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"arxiv_version","alias_value":"2111.07079v2","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.07079","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_12","alias_value":"UUN4P4DDV3QT","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_16","alias_value":"UUN4P4DDV3QTIQP4","created_at":"2026-07-05T06:09:03Z"},{"alias_kind":"pith_short_8","alias_value":"UUN4P4DD","created_at":"2026-07-05T06:09:03Z"}],"graph_snapshots":[{"event_id":"sha256:42807af02c81cbd53d749e168b5f74acb6e7f5c30445380f202a27063d82b175","target":"graph","created_at":"2026-07-05T06:09:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2111.07079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bin Wang, Donglei Yang, Guanghui Wang, Jie Han, Yangyang Cheng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-13T09:53:00Z","title":"Transversal Hamilton cycle in hypergraph systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.07079","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:225af28e8939b8513a97ad8a531aafdc212a68130d83c07aaf78bbf901928faf","target":"record","created_at":"2026-07-05T06:09:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"828b50fe8696d1e082b4bf8c60b29670c7a612cb734648130176d974dbd65704","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2021-11-13T09:53:00Z","title_canon_sha256":"0a5970b4b4404cf9d7a95eed9d613f3a1c673cb7283c5c8207fef00b6665db28"},"schema_version":"1.0","source":{"id":"2111.07079","kind":"arxiv","version":2}},"canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a51bc7f063aee13441fcd9382bb0a86beab966957e867efa28341433efd35759","first_computed_at":"2026-07-05T06:09:03.731358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:09:03.731358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71rW7koRQkFd/mFseWcJJYLH0D935M4HWXcwj94dJSYHfm5RMxY9YQs2vaV/FWHXCASI9NsP6zGI9hm1MnbwDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:09:03.731845Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.07079","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:225af28e8939b8513a97ad8a531aafdc212a68130d83c07aaf78bbf901928faf","sha256:42807af02c81cbd53d749e168b5f74acb6e7f5c30445380f202a27063d82b175"],"state_sha256":"ccdd0682740602b231c24362ea52e04623f62eca50ca1e05f0f2ec53ceb6b280"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBDXS/8Wn2kPhss8oLjjOE29y4ov/P2/TZpQVHJmlsbKcfoQSZkni0IZXPBlhqYfJ8EImobzKoQpu8+fQv24Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T15:17:05.865381Z","bundle_sha256":"8cfbdd41cf749e098c403d14bd5c104106c26bf9f4c54d3de557bf9d653589b5"}}