{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:AVB3YLG2XXYW32L7RE2JCILYFQ","short_pith_number":"pith:AVB3YLG2","schema_version":"1.0","canonical_sha256":"0543bc2cdabdf16de97f89349121782c1a854732daf67baef2da1b6d3d84ac40","source":{"kind":"arxiv","id":"2209.09289","version":3},"attestation_state":"computed","paper":{"title":"A general approach to transversal versions of Dirac-type theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Amedeo Sgueglia, Fabian Hamann, Olaf Parczyk, Pranshu Gupta","submitted_at":"2022-09-19T18:28:01Z","abstract_excerpt":"Given a collection of hypergraphs $\\textbf{H}=(H_1,\\ldots,H_m)$ with the same vertex set, an $m$-edge graph $F\\subset \\cup_{i\\in [m]}H_i$ is a transversal if there is a bijection $\\phi:E(F)\\to [m]$ such that $e\\in E(H_{\\phi(e)})$ for each $e\\in E(F)$. How large does the minimum degree of each $H_i$ need to be so that $\\textbf{H}$ necessarily contains a copy of $F$ that is a transversal? Each $H_i$ in the collection could be the same hypergraph, hence the minimum degree of each $H_i$ needs to be large enough to ensure that $F\\subseteq H_i$. Since its general introduction by Joos and Kim [Bull. "},"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":"2209.09289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2022-09-19T18:28:01Z","cross_cats_sorted":[],"title_canon_sha256":"f8982368b83ff0ae9f6c7d8752c0a774c59608c472f2a540a26e0ad53e3efb63","abstract_canon_sha256":"87e9bed493bc300ccb9a4ba183dfb10af5af753d23d631e858afc55491e803b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:54.662964Z","signature_b64":"hih7aR01ugd+B6n6O1kKUZnm7y4mmdZbih/fSeuhgE9yaI8+4Mjb2ChVuTpay0PfwGDsX0uht6svkppITNizDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0543bc2cdabdf16de97f89349121782c1a854732daf67baef2da1b6d3d84ac40","last_reissued_at":"2026-07-05T06:23:54.662601Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:54.662601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A general approach to transversal versions of Dirac-type theorems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alp M\\\"uyesser, Amedeo Sgueglia, Fabian Hamann, Olaf Parczyk, Pranshu Gupta","submitted_at":"2022-09-19T18:28:01Z","abstract_excerpt":"Given a collection of hypergraphs $\\textbf{H}=(H_1,\\ldots,H_m)$ with the same vertex set, an $m$-edge graph $F\\subset \\cup_{i\\in [m]}H_i$ is a transversal if there is a bijection $\\phi:E(F)\\to [m]$ such that $e\\in E(H_{\\phi(e)})$ for each $e\\in E(F)$. How large does the minimum degree of each $H_i$ need to be so that $\\textbf{H}$ necessarily contains a copy of $F$ that is a transversal? Each $H_i$ in the collection could be the same hypergraph, hence the minimum degree of each $H_i$ needs to be large enough to ensure that $F\\subseteq H_i$. Since its general introduction by Joos and Kim [Bull. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.09289","kind":"arxiv","version":3},"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/2209.09289/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":"2209.09289","created_at":"2026-07-05T06:23:54.662656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.09289v3","created_at":"2026-07-05T06:23:54.662656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.09289","created_at":"2026-07-05T06:23:54.662656+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVB3YLG2XXYW","created_at":"2026-07-05T06:23:54.662656+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVB3YLG2XXYW32L7","created_at":"2026-07-05T06:23:54.662656+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVB3YLG2","created_at":"2026-07-05T06:23:54.662656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2309.12607","citing_title":"Robust Hamiltonicity in families of Dirac graphs","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ","json":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ.json","graph_json":"https://pith.science/api/pith-number/AVB3YLG2XXYW32L7RE2JCILYFQ/graph.json","events_json":"https://pith.science/api/pith-number/AVB3YLG2XXYW32L7RE2JCILYFQ/events.json","paper":"https://pith.science/paper/AVB3YLG2"},"agent_actions":{"view_html":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ","download_json":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ.json","view_paper":"https://pith.science/paper/AVB3YLG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.09289&json=true","fetch_graph":"https://pith.science/api/pith-number/AVB3YLG2XXYW32L7RE2JCILYFQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AVB3YLG2XXYW32L7RE2JCILYFQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ/action/storage_attestation","attest_author":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ/action/author_attestation","sign_citation":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ/action/citation_signature","submit_replication":"https://pith.science/pith/AVB3YLG2XXYW32L7RE2JCILYFQ/action/replication_record"}},"created_at":"2026-07-05T06:23:54.662656+00:00","updated_at":"2026-07-05T06:23:54.662656+00:00"}