{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:W3CRAC5CMAPBK3ULJ6YCUZNLYX","short_pith_number":"pith:W3CRAC5C","schema_version":"1.0","canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","source":{"kind":"arxiv","id":"2403.14269","version":2},"attestation_state":"computed","paper":{"title":"Dirac's theorem for linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hyunwoo Lee, Seonghyuk Im","submitted_at":"2024-03-21T10:10:32Z","abstract_excerpt":"Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\\delta(G) \\geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following. Any $n$-vertex $k$-uniform linear hypergraph $H$ with minimum degree at least $\\frac{n}{k} + \\Omega(1)$ contains a matching that covers at least $(1-o(1))n$ vertices. This minimum degree condition is asymptotically tight and obtaining a perfect matching is impossible with any degree condition. Furthermore, we show that if $\\delta(H) \\geq (\\frac{1}{k}+o(1))n$, then $H$ contains almos"},"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.14269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-21T10:10:32Z","cross_cats_sorted":[],"title_canon_sha256":"b1f4b7aef3c9c81f21c24111d1e2c409d2aca91cb3f7926f5ce3889536e44e4f","abstract_canon_sha256":"198c4459467914782b07ed4c67c18afac8cebe2b8af13dce3db2c41288ad7afb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:39:17.587408Z","signature_b64":"/tCX3bm4TfdzOdLQptV1FLDxSQizojK2PToCFCmVvrhiunFxEUWJZXYVHFQ4gcem9OnworUJB9FQoPozvzc7Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","last_reissued_at":"2026-07-05T10:39:17.586928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:39:17.586928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dirac's theorem for linear hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hyunwoo Lee, Seonghyuk Im","submitted_at":"2024-03-21T10:10:32Z","abstract_excerpt":"Dirac's theorem states that any $n$-vertex graph $G$ with even integer $n$ satisfying $\\delta(G) \\geq n/2$ contains a perfect matching. We generalize this to $k$-uniform linear hypergraphs by proving the following. Any $n$-vertex $k$-uniform linear hypergraph $H$ with minimum degree at least $\\frac{n}{k} + \\Omega(1)$ contains a matching that covers at least $(1-o(1))n$ vertices. This minimum degree condition is asymptotically tight and obtaining a perfect matching is impossible with any degree condition. Furthermore, we show that if $\\delta(H) \\geq (\\frac{1}{k}+o(1))n$, then $H$ contains almos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14269","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/2403.14269/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.14269","created_at":"2026-07-05T10:39:17.586993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14269v2","created_at":"2026-07-05T10:39:17.586993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14269","created_at":"2026-07-05T10:39:17.586993+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3CRAC5CMAPB","created_at":"2026-07-05T10:39:17.586993+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3CRAC5CMAPBK3UL","created_at":"2026-07-05T10:39:17.586993+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3CRAC5C","created_at":"2026-07-05T10:39:17.586993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04783","citing_title":"Embedding loose trees in $k$-uniform hypergraphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX","json":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX.json","graph_json":"https://pith.science/api/pith-number/W3CRAC5CMAPBK3ULJ6YCUZNLYX/graph.json","events_json":"https://pith.science/api/pith-number/W3CRAC5CMAPBK3ULJ6YCUZNLYX/events.json","paper":"https://pith.science/paper/W3CRAC5C"},"agent_actions":{"view_html":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX","download_json":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX.json","view_paper":"https://pith.science/paper/W3CRAC5C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14269&json=true","fetch_graph":"https://pith.science/api/pith-number/W3CRAC5CMAPBK3ULJ6YCUZNLYX/graph.json","fetch_events":"https://pith.science/api/pith-number/W3CRAC5CMAPBK3ULJ6YCUZNLYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/action/storage_attestation","attest_author":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/action/author_attestation","sign_citation":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/action/citation_signature","submit_replication":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/action/replication_record"}},"created_at":"2026-07-05T10:39:17.586993+00:00","updated_at":"2026-07-05T10:39:17.586993+00:00"}