{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:RAFCQXOZRWAAPMLCQWUICPOSYR","short_pith_number":"pith:RAFCQXOZ","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"},"canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","source":{"kind":"arxiv","id":"2311.15172","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15172","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15172v2","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15172","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"RAFCQXOZRWAA","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_16","alias_value":"RAFCQXOZRWAAPMLC","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_8","alias_value":"RAFCQXOZ","created_at":"2026-07-05T09:19:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:RAFCQXOZRWAAPMLCQWUICPOSYR","target":"record","payload":{"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"},"canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","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"},"source_kind":"arxiv","source_id":"2311.15172","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-05T09:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zyrzm1WihLvyJm1LH8cKNSaVtLu+5L2J0D68dWa54k9kLHKPoLVlgqDWR8YtWqwyxbt0DmcYYPJ/HJCdktB4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:59:02.143602Z"},"content_sha256":"55477b5d44b40039429316fdf6bd75fcfa603b907ef832027d87517eb7cab964","schema_version":"1.0","event_id":"sha256:55477b5d44b40039429316fdf6bd75fcfa603b907ef832027d87517eb7cab964"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:RAFCQXOZRWAAPMLCQWUICPOSYR","target":"graph","payload":{"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"},"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-05T09:19:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MM0oD3Y1rR1oIXTw3iZZXwZh+rW//UfhAlaex3emiRPMuiYFX5MGlmU/LaMTd4fQHJD00yvJwNvrtbod8YeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T17:59:02.145077Z"},"content_sha256":"ff9d33e906ae4253164bac098bd691b0bade1374fae77543b620368f92aceff7","schema_version":"1.0","event_id":"sha256:ff9d33e906ae4253164bac098bd691b0bade1374fae77543b620368f92aceff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/bundle.json","state_url":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/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-12T17:59:02Z","links":{"resolver":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR","bundle":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/bundle.json","state":"https://pith.science/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RAFCQXOZRWAAPMLCQWUICPOSYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:RAFCQXOZRWAAPMLCQWUICPOSYR","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":"58b0c3e65842cf53c422e7335addbaf78f4610770b4e9992bb6f8b4af3e970c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-26T03:07:34Z","title_canon_sha256":"dcc01be91a55306f75642c59ad625e02d6c5bbf15bbc09eefc42bc74dffdf22b"},"schema_version":"1.0","source":{"id":"2311.15172","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.15172","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"arxiv_version","alias_value":"2311.15172v2","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.15172","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_12","alias_value":"RAFCQXOZRWAA","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_16","alias_value":"RAFCQXOZRWAAPMLC","created_at":"2026-07-05T09:19:25Z"},{"alias_kind":"pith_short_8","alias_value":"RAFCQXOZ","created_at":"2026-07-05T09:19:25Z"}],"graph_snapshots":[{"event_id":"sha256:ff9d33e906ae4253164bac098bd691b0bade1374fae77543b620368f92aceff7","target":"graph","created_at":"2026-07-05T09:19:25Z","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/2311.15172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Caihong Yang, Caiyun Hu, Heng Li, Jianfeng Hou, Xizhi Liu, Yixiao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-26T03:07:34Z","title":"Toward a density Corr\\'{a}di--Hajnal theorem for degenerate hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.15172","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:55477b5d44b40039429316fdf6bd75fcfa603b907ef832027d87517eb7cab964","target":"record","created_at":"2026-07-05T09:19:25Z","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":"58b0c3e65842cf53c422e7335addbaf78f4610770b4e9992bb6f8b4af3e970c1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-11-26T03:07:34Z","title_canon_sha256":"dcc01be91a55306f75642c59ad625e02d6c5bbf15bbc09eefc42bc74dffdf22b"},"schema_version":"1.0","source":{"id":"2311.15172","kind":"arxiv","version":2}},"canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"880a285dd98d8007b16285a8813dd2c46ceb39f2b16160dd3c1942037e32d6a4","first_computed_at":"2026-07-05T09:19:25.077257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:19:25.077257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vn6TnfUgQfbv7DyeDqMn/GDG7cyMOCRAqMiuSlpaJq06KCXuQg8IvzbLJC8FBIUIFlB9DjaBhWwPPf+KJJMAAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:19:25.077674Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.15172","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55477b5d44b40039429316fdf6bd75fcfa603b907ef832027d87517eb7cab964","sha256:ff9d33e906ae4253164bac098bd691b0bade1374fae77543b620368f92aceff7"],"state_sha256":"06c2912361e8924a4c5df9044e16626d3d03fc6232c7131788798cf315d2ce66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hkb1IK/0PWi8BcvAsFlU7jn4hEJNJTAoUuhctvOP6Xr/NSd36XhKIRlxkNr1hFPJGjlhDX3mg2hTNB/Mew7QAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T17:59:02.151745Z","bundle_sha256":"3ae451cc43124501c2f92fe09761c5cd63632e884458c60b89e39ccde2640c0a"}}