{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:YE23R543K656TXIOISQW62DBX7","short_pith_number":"pith:YE23R543","canonical_record":{"source":{"id":"2302.09849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-20T09:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"9edbd602ced07ace1aa261dc26e474ee3bd5bf1fe914fd520273767f4ac91d82","abstract_canon_sha256":"8a099062bf64bf2d87588d8b8db1b7a6ea7a0ee86d443efaa4792e0e4286e369"},"schema_version":"1.0"},"canonical_sha256":"c135b8f79b57bbe9dd0e44a16f6861bfc3e72a0c27db4b634b0a93df49c71607","source":{"kind":"arxiv","id":"2302.09849","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.09849","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"2302.09849v2","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09849","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"YE23R543K656","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_16","alias_value":"YE23R543K656TXIO","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_8","alias_value":"YE23R543","created_at":"2026-07-05T05:45:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:YE23R543K656TXIOISQW62DBX7","target":"record","payload":{"canonical_record":{"source":{"id":"2302.09849","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-20T09:12:10Z","cross_cats_sorted":[],"title_canon_sha256":"9edbd602ced07ace1aa261dc26e474ee3bd5bf1fe914fd520273767f4ac91d82","abstract_canon_sha256":"8a099062bf64bf2d87588d8b8db1b7a6ea7a0ee86d443efaa4792e0e4286e369"},"schema_version":"1.0"},"canonical_sha256":"c135b8f79b57bbe9dd0e44a16f6861bfc3e72a0c27db4b634b0a93df49c71607","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:45:39.201766Z","signature_b64":"aOYZFxHwnTsLxd67WGKgZTocAdIm8MxHBxOajCBjAueCQF2JZfZ6BUajSvji1StgD5itY1ZjsC8i7dIXhCgUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c135b8f79b57bbe9dd0e44a16f6861bfc3e72a0c27db4b634b0a93df49c71607","last_reissued_at":"2026-07-05T05:45:39.201332Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:45:39.201332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2302.09849","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-05T05:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZ9LkhsnwSXExNb2AGRe0Qd4M/HiJ5WtR50B8R11ne/bbgGEuR/4U02UljrBZ/AsWFZj56l4S2JGMP8zhjTAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:00:16.376121Z"},"content_sha256":"b517fcea87d356f9c0267cda6b17d06c21dcb9956975471516b348e919fb3226","schema_version":"1.0","event_id":"sha256:b517fcea87d356f9c0267cda6b17d06c21dcb9956975471516b348e919fb3226"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:YE23R543K656TXIOISQW62DBX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A step towards a general density Corr\\'{a}di--Hajnal Theorem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Heng Li, Jianfeng Hou, Long-tu Yuan, Xizhi Liu, Yixiao Zhang","submitted_at":"2023-02-20T09:12:10Z","abstract_excerpt":"For a nondegenerate $r$-graph $F$, large $n$, and $t$ in the regime $[0, c_{F} n]$, where $c_F>0$ is a constant depending only on $F$, we present a general approach for determining the maximum number of edges in an $n$-vertex $r$-graph that does not contain $t+1$ vertex-disjoint copies of $F$. In fact, our method results in a rainbow version of the above result and includes a characterization of the extremal constructions.\n  Our approach applies to many well-studied hypergraphs (including graphs) such as the edge-critical graphs, the Fano plane, the generalized triangles, hypergraph expansions"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09849","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/2302.09849/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-05T05:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"re1fUH3AU6d4E4SogDp5IyPwhDGnlyaE+cSJprXngTmQiS5JL5DowdoYsKZNy5829df+EtkUc/CYM4t/ejfjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T03:00:16.376616Z"},"content_sha256":"fb76acc6e500c6cb599fa9c62825167a5e0333693c195685682f4327b7da9f4c","schema_version":"1.0","event_id":"sha256:fb76acc6e500c6cb599fa9c62825167a5e0333693c195685682f4327b7da9f4c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE23R543K656TXIOISQW62DBX7/bundle.json","state_url":"https://pith.science/pith/YE23R543K656TXIOISQW62DBX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE23R543K656TXIOISQW62DBX7/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-09T03:00:16Z","links":{"resolver":"https://pith.science/pith/YE23R543K656TXIOISQW62DBX7","bundle":"https://pith.science/pith/YE23R543K656TXIOISQW62DBX7/bundle.json","state":"https://pith.science/pith/YE23R543K656TXIOISQW62DBX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE23R543K656TXIOISQW62DBX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:YE23R543K656TXIOISQW62DBX7","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":"8a099062bf64bf2d87588d8b8db1b7a6ea7a0ee86d443efaa4792e0e4286e369","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-20T09:12:10Z","title_canon_sha256":"9edbd602ced07ace1aa261dc26e474ee3bd5bf1fe914fd520273767f4ac91d82"},"schema_version":"1.0","source":{"id":"2302.09849","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.09849","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"2302.09849v2","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.09849","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"YE23R543K656","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_16","alias_value":"YE23R543K656TXIO","created_at":"2026-07-05T05:45:39Z"},{"alias_kind":"pith_short_8","alias_value":"YE23R543","created_at":"2026-07-05T05:45:39Z"}],"graph_snapshots":[{"event_id":"sha256:fb76acc6e500c6cb599fa9c62825167a5e0333693c195685682f4327b7da9f4c","target":"graph","created_at":"2026-07-05T05:45:39Z","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/2302.09849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a nondegenerate $r$-graph $F$, large $n$, and $t$ in the regime $[0, c_{F} n]$, where $c_F>0$ is a constant depending only on $F$, we present a general approach for determining the maximum number of edges in an $n$-vertex $r$-graph that does not contain $t+1$ vertex-disjoint copies of $F$. In fact, our method results in a rainbow version of the above result and includes a characterization of the extremal constructions.\n  Our approach applies to many well-studied hypergraphs (including graphs) such as the edge-critical graphs, the Fano plane, the generalized triangles, hypergraph expansions","authors_text":"Heng Li, Jianfeng Hou, Long-tu Yuan, Xizhi Liu, Yixiao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-20T09:12:10Z","title":"A step towards a general density Corr\\'{a}di--Hajnal Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.09849","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:b517fcea87d356f9c0267cda6b17d06c21dcb9956975471516b348e919fb3226","target":"record","created_at":"2026-07-05T05:45:39Z","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":"8a099062bf64bf2d87588d8b8db1b7a6ea7a0ee86d443efaa4792e0e4286e369","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-02-20T09:12:10Z","title_canon_sha256":"9edbd602ced07ace1aa261dc26e474ee3bd5bf1fe914fd520273767f4ac91d82"},"schema_version":"1.0","source":{"id":"2302.09849","kind":"arxiv","version":2}},"canonical_sha256":"c135b8f79b57bbe9dd0e44a16f6861bfc3e72a0c27db4b634b0a93df49c71607","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c135b8f79b57bbe9dd0e44a16f6861bfc3e72a0c27db4b634b0a93df49c71607","first_computed_at":"2026-07-05T05:45:39.201332Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:45:39.201332Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aOYZFxHwnTsLxd67WGKgZTocAdIm8MxHBxOajCBjAueCQF2JZfZ6BUajSvji1StgD5itY1ZjsC8i7dIXhCgUCg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:45:39.201766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.09849","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b517fcea87d356f9c0267cda6b17d06c21dcb9956975471516b348e919fb3226","sha256:fb76acc6e500c6cb599fa9c62825167a5e0333693c195685682f4327b7da9f4c"],"state_sha256":"f53e0aa47c1e970953a602dce6679fe6b82ee82a990bbc657b23b0dac7ebbfaf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4lCAijVTN3dPgga6vNErSEJDF3iYvXOuerVuf9hcXGMFs1qu0LSYC+JuQKsK+HmiMEqmHBuLvP/Otkz8MG8DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T03:00:16.381579Z","bundle_sha256":"1609ed74cab4d60604e1a4c6219d8a234bcc6d87c4448f38c7e776d7a2b255f1"}}