{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RAFCQXOZRWAAPMLCQWUICPOSYR","short_pith_number":"pith:RAFCQXOZ","schema_version":"1.0","canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","source":{"kind":"arxiv","id":"2311.15172","version":2},"attestation_state":"computed","paper":{"title":"Toward a density Corr\\'{a}di--Hajnal theorem for degenerate hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","submitted_at":"2023-11-26T03:07:34Z","abstract_excerpt":"Given an $r$-graph $F$ with $r \\ge 2$, let $\\mathrm{ex}(n, (t+1) F)$ denote the maximum number of edges in an $n$-vertex $r$-graph with at most $t$ pairwise vertex-disjoint copies of $F$. Extending several old results and complementing prior work [J. Hou, H. Li, X. Liu, L.-T. Yuan, and Y. Zhang. A step towards a general density Corr\\'{a}di--Hajnal theorem. arXiv:2302.09849, 2023.] on nondegenerate hypergraphs, we initiate a systematic study on $\\mathrm{ex}(n, (t+1) F)$ for degenerate hypergraphs $F$. For a broad class of degenerate hypergraphs $F$, we present near-optimal upper bounds for $\\ma"},"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":"2311.15172","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-26T03:07:34Z","cross_cats_sorted":[],"title_canon_sha256":"dcc01be91a55306f75642c59ad625e02d6c5bbf15bbc09eefc42bc74dffdf22b","abstract_canon_sha256":"58b0c3e65842cf53c422e7335addbaf78f4610770b4e9992bb6f8b4af3e970c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:19:25.077674Z","signature_b64":"Vn6TnfUgQfbv7DyeDqMn/GDG7cyMOCRAqMiuSlpaJq06KCXuQg8IvzbLJC8FBIUIFlB9DjaBhWwPPf+KJJMAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","last_reissued_at":"2026-07-05T09:19:25.077257Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:19:25.077257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Toward a density Corr\\'{a}di--Hajnal theorem for degenerate hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","submitted_at":"2023-11-26T03:07:34Z","abstract_excerpt":"Given an $r$-graph $F$ with $r \\ge 2$, let $\\mathrm{ex}(n, (t+1) F)$ denote the maximum number of edges in an $n$-vertex $r$-graph with at most $t$ pairwise vertex-disjoint copies of $F$. Extending several old results and complementing prior work [J. Hou, H. Li, X. Liu, L.-T. Yuan, and Y. Zhang. A step towards a general density Corr\\'{a}di--Hajnal theorem. arXiv:2302.09849, 2023.] on nondegenerate hypergraphs, we initiate a systematic study on $\\mathrm{ex}(n, (t+1) F)$ for degenerate hypergraphs $F$. For a broad class of degenerate hypergraphs $F$, we present near-optimal upper bounds for $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15172","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/2311.15172/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":"2311.15172","created_at":"2026-07-05T09:19:25.077312+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.15172v2","created_at":"2026-07-05T09:19:25.077312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15172","created_at":"2026-07-05T09:19:25.077312+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAFCQXOZRWAA","created_at":"2026-07-05T09:19:25.077312+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAFCQXOZRWAAPMLC","created_at":"2026-07-05T09:19:25.077312+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAFCQXOZ","created_at":"2026-07-05T09:19:25.077312+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11450","citing_title":"Tiling $H$ in dense graphs","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR","json":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR.json","graph_json":"https://pith.science/api/pith-number/RAFCQXOZRWAAPMLCQWUICPOSYR/graph.json","events_json":"https://pith.science/api/pith-number/RAFCQXOZRWAAPMLCQWUICPOSYR/events.json","paper":"https://pith.science/paper/RAFCQXOZ"},"agent_actions":{"view_html":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR","download_json":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR.json","view_paper":"https://pith.science/paper/RAFCQXOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.15172&json=true","fetch_graph":"https://pith.science/api/pith-number/RAFCQXOZRWAAPMLCQWUICPOSYR/graph.json","fetch_events":"https://pith.science/api/pith-number/RAFCQXOZRWAAPMLCQWUICPOSYR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/action/storage_attestation","attest_author":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/action/author_attestation","sign_citation":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/action/citation_signature","submit_replication":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/action/replication_record"}},"created_at":"2026-07-05T09:19:25.077312+00:00","updated_at":"2026-07-05T09:19:25.077312+00:00"}