{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:W3CRAC5CMAPBK3ULJ6YCUZNLYX","short_pith_number":"pith:W3CRAC5C","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"},"canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","source":{"kind":"arxiv","id":"2403.14269","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14269","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14269v2","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14269","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"W3CRAC5CMAPB","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"W3CRAC5CMAPBK3UL","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"W3CRAC5C","created_at":"2026-07-05T10:39:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:W3CRAC5CMAPBK3ULJ6YCUZNLYX","target":"record","payload":{"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"},"canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","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"},"source_kind":"arxiv","source_id":"2403.14269","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-05T10:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/MN2nyM1S/hC9B/wzwa7leHnBTRb+0hfrKmwGLVJqdYw1XSojgSAWGOznIFY3w5u3WsCogjv64nr76arPGZRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:52:31.292959Z"},"content_sha256":"15f0819e7a2ebb8daaa614b65d867c467177e74eca4ec6e7c1eb8a8df3cdb1f3","schema_version":"1.0","event_id":"sha256:15f0819e7a2ebb8daaa614b65d867c467177e74eca4ec6e7c1eb8a8df3cdb1f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:W3CRAC5CMAPBK3ULJ6YCUZNLYX","target":"graph","payload":{"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"},"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-05T10:39:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xWYbenpb3LyPr+l0cM1Lo7XEP0m5WI5dVXMUcq3ZU9FOndHdViPBoS34iaW7ejVq9wzNs4r4M5/Wy0Zt4OygAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T10:52:31.293946Z"},"content_sha256":"45ecdfcc0132463893c7834638e5c898907045960a2471c0c5e37b88c30444eb","schema_version":"1.0","event_id":"sha256:45ecdfcc0132463893c7834638e5c898907045960a2471c0c5e37b88c30444eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/bundle.json","state_url":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/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-21T10:52:31Z","links":{"resolver":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX","bundle":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/bundle.json","state":"https://pith.science/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W3CRAC5CMAPBK3ULJ6YCUZNLYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:W3CRAC5CMAPBK3ULJ6YCUZNLYX","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":"198c4459467914782b07ed4c67c18afac8cebe2b8af13dce3db2c41288ad7afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-21T10:10:32Z","title_canon_sha256":"b1f4b7aef3c9c81f21c24111d1e2c409d2aca91cb3f7926f5ce3889536e44e4f"},"schema_version":"1.0","source":{"id":"2403.14269","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14269","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14269v2","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14269","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"W3CRAC5CMAPB","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_16","alias_value":"W3CRAC5CMAPBK3UL","created_at":"2026-07-05T10:39:17Z"},{"alias_kind":"pith_short_8","alias_value":"W3CRAC5C","created_at":"2026-07-05T10:39:17Z"}],"graph_snapshots":[{"event_id":"sha256:45ecdfcc0132463893c7834638e5c898907045960a2471c0c5e37b88c30444eb","target":"graph","created_at":"2026-07-05T10:39:17Z","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/2403.14269/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hyunwoo Lee, Seonghyuk Im","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-21T10:10:32Z","title":"Dirac's theorem for linear hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14269","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:15f0819e7a2ebb8daaa614b65d867c467177e74eca4ec6e7c1eb8a8df3cdb1f3","target":"record","created_at":"2026-07-05T10:39:17Z","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":"198c4459467914782b07ed4c67c18afac8cebe2b8af13dce3db2c41288ad7afb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-03-21T10:10:32Z","title_canon_sha256":"b1f4b7aef3c9c81f21c24111d1e2c409d2aca91cb3f7926f5ce3889536e44e4f"},"schema_version":"1.0","source":{"id":"2403.14269","kind":"arxiv","version":2}},"canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6c5100ba2601e156e8b4fb02a65abc5d4fb7ddcf815ff65a5bc30524d97dac4","first_computed_at":"2026-07-05T10:39:17.586928Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:39:17.586928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/tCX3bm4TfdzOdLQptV1FLDxSQizojK2PToCFCmVvrhiunFxEUWJZXYVHFQ4gcem9OnworUJB9FQoPozvzc7Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:39:17.587408Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.14269","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15f0819e7a2ebb8daaa614b65d867c467177e74eca4ec6e7c1eb8a8df3cdb1f3","sha256:45ecdfcc0132463893c7834638e5c898907045960a2471c0c5e37b88c30444eb"],"state_sha256":"ff92bb7a2ad0ef71890b42edea97e182d6ec265beb34f19a2b519930be32d6f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfNjDlMftZqAE6qF0Dp66GE12MTq/HyCZ2ZJ4JaoSQ3cHRfTlT0D3fv/dEWNrBG5EtVll0PWTeKts9u/3sO5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T10:52:31.299996Z","bundle_sha256":"e0554a7f7b88c035001478062d5fcf1f0fd194ab7c5cf2c0cc249ca60b569c7a"}}