{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I4GWVRYTEDJYJB5SIDVUGB7FR5","short_pith_number":"pith:I4GWVRYT","canonical_record":{"source":{"id":"2605.02610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T13:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"786d4c3b040e5a6fb865d6b43cbd1637886385623d4c9b1a15a563429c8ca737","abstract_canon_sha256":"5d9c3c9ead731433733fe5a588e371fba8228c2d6a4ce1ae101a7c2ee71fdb3c"},"schema_version":"1.0"},"canonical_sha256":"470d6ac71320d38487b240eb4307e58f7f6b2159e8e5d5c543257dc818766469","source":{"kind":"arxiv","id":"2605.02610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02610","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02610v2","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02610","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_12","alias_value":"I4GWVRYTEDJY","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_16","alias_value":"I4GWVRYTEDJYJB5S","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_8","alias_value":"I4GWVRYT","created_at":"2026-07-08T01:18:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I4GWVRYTEDJYJB5SIDVUGB7FR5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.02610","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T13:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"786d4c3b040e5a6fb865d6b43cbd1637886385623d4c9b1a15a563429c8ca737","abstract_canon_sha256":"5d9c3c9ead731433733fe5a588e371fba8228c2d6a4ce1ae101a7c2ee71fdb3c"},"schema_version":"1.0"},"canonical_sha256":"470d6ac71320d38487b240eb4307e58f7f6b2159e8e5d5c543257dc818766469","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:29.499422Z","signature_b64":"WUecaOu6TTgqcPqS1FzLB/rKLwu1j+ClwykUqlEsvHjyfl6rnP8/mtS5o5kczHZfa2S5+DeZejQ10s7o9hwnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"470d6ac71320d38487b240eb4307e58f7f6b2159e8e5d5c543257dc818766469","last_reissued_at":"2026-07-08T01:18:29.498954Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:29.498954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.02610","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-08T01:18:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDMIUpPCFIrFCDL30kAHBGeKeAXk6Y6406P+HmpBHGQKNeWLIWJqBsbq/PexD+LnOXX34523XxQM6WC8pcWtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:53:13.749750Z"},"content_sha256":"c43b5c444ed0e53592e3c251934d04fcb150aa7bef723a095c50732584b7e0b0","schema_version":"1.0","event_id":"sha256:c43b5c444ed0e53592e3c251934d04fcb150aa7bef723a095c50732584b7e0b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I4GWVRYTEDJYJB5SIDVUGB7FR5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Shadows of Uniform Hypergraphs under a Minimum Degree Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Haorui Liu, Mei Lu, Yi Zhang","submitted_at":"2026-05-04T13:58:17Z","abstract_excerpt":"Given a set $X$ and an integer $t$, let $\\mathcal{F}$ be a family of $k$-subsets of $X$. The Kruskal--Katona theorem implies that if $|\\mathcal{F}|\\geq \\binom{t}{k}$, then $|\\partial_\\ell\\mathcal{F}|\\geq\\binom{t}{\\ell}$. The minimum degree version of this problem asks: if $\\delta(\\mathcal{F})\\geq \\binom{t}{k-1}$, how small can $|\\partial_\\ell\\mathcal{F}|$ be? We call a hypergraph \\textit{extremal} if it achieves the minimum value of $|\\partial_\\ell \\mathcal{F}|$ subject to the degree condition $\\delta(\\mathcal{F}) \\geq \\binom{t}{k-1}$. F\\\"uredi and Zhao [SIAM J. Discrete Math. 36(4), 2022] pro"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"By developing a hypergraph transformation that combines shifting operations with antilexicographic compression, we prove that there exists an extremal hypergraph containing an isolated copy of K^k_{t+1} whenever |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The new shifting-plus-antilexicographic-compression transformation preserves both the minimum-degree condition and the extremal property for arbitrary k > ℓ ≥ 2.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"For k-uniform hypergraphs with δ(F) ≥ binom(t, k-1), the minimum |∂_ℓ F| is achieved by one containing an isolated K_{t+1}^k when |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d6131bdf1d2b4ed08e314b18abdf8ccc5af9828bfa44c0678308debd34c91431"},"source":{"id":"2605.02610","kind":"arxiv","version":2},"verdict":{"id":"375938ae-2e0f-4bae-8c52-c8211b0147a0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T17:45:04.664185Z","strongest_claim":"By developing a hypergraph transformation that combines shifting operations with antilexicographic compression, we prove that there exists an extremal hypergraph containing an isolated copy of K^k_{t+1} whenever |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","one_line_summary":"For k-uniform hypergraphs with δ(F) ≥ binom(t, k-1), the minimum |∂_ℓ F| is achieved by one containing an isolated K_{t+1}^k when |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The new shifting-plus-antilexicographic-compression transformation preserves both the minimum-degree condition and the extremal property for arbitrary k > ℓ ≥ 2.","pith_extraction_headline":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.02610/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-20T15:37:42.838309Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-20T03:01:22.177127Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:11:33.542519Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"98d39a171c08337f7f0838f3290d9b29a74911fb12f1a6f210a5056c36ce0cd0"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"bf89b30b9cd7ad68fc0b65454a3913436ca377fade533e620370ed332a0a76b2"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"375938ae-2e0f-4bae-8c52-c8211b0147a0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-08T01:18:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bOnFc9Yn0B1wX/dYHKzbzyCxssUUUP06LdgM1QsFsW+YHdnVBj1q+RlvZ5jL0UT5wzRjDHpM0HuBukRjgQ2OBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T22:53:13.750489Z"},"content_sha256":"5391bcdca4f2abeb625a6e451c1518219e23764a20f27b2d17decc321468a87e","schema_version":"1.0","event_id":"sha256:5391bcdca4f2abeb625a6e451c1518219e23764a20f27b2d17decc321468a87e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/bundle.json","state_url":"https://pith.science/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/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-09T22:53:13Z","links":{"resolver":"https://pith.science/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5","bundle":"https://pith.science/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/bundle.json","state":"https://pith.science/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I4GWVRYTEDJYJB5SIDVUGB7FR5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I4GWVRYTEDJYJB5SIDVUGB7FR5","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":"5d9c3c9ead731433733fe5a588e371fba8228c2d6a4ce1ae101a7c2ee71fdb3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T13:58:17Z","title_canon_sha256":"786d4c3b040e5a6fb865d6b43cbd1637886385623d4c9b1a15a563429c8ca737"},"schema_version":"1.0","source":{"id":"2605.02610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.02610","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"arxiv_version","alias_value":"2605.02610v2","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.02610","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_12","alias_value":"I4GWVRYTEDJY","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_16","alias_value":"I4GWVRYTEDJYJB5S","created_at":"2026-07-08T01:18:29Z"},{"alias_kind":"pith_short_8","alias_value":"I4GWVRYT","created_at":"2026-07-08T01:18:29Z"}],"graph_snapshots":[{"event_id":"sha256:5391bcdca4f2abeb625a6e451c1518219e23764a20f27b2d17decc321468a87e","target":"graph","created_at":"2026-07-08T01:18:29Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"By developing a hypergraph transformation that combines shifting operations with antilexicographic compression, we prove that there exists an extremal hypergraph containing an isolated copy of K^k_{t+1} whenever |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The new shifting-plus-antilexicographic-compression transformation preserves both the minimum-degree condition and the extremal property for arbitrary k > ℓ ≥ 2."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"For k-uniform hypergraphs with δ(F) ≥ binom(t, k-1), the minimum |∂_ℓ F| is achieved by one containing an isolated K_{t+1}^k when |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}."}],"snapshot_sha256":"d6131bdf1d2b4ed08e314b18abdf8ccc5af9828bfa44c0678308debd34c91431"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"bf89b30b9cd7ad68fc0b65454a3913436ca377fade533e620370ed332a0a76b2"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-20T15:37:42.838309Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-20T03:01:22.177127Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:11:33.542519Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.02610/integrity.json","findings":[],"snapshot_sha256":"98d39a171c08337f7f0838f3290d9b29a74911fb12f1a6f210a5056c36ce0cd0","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a set $X$ and an integer $t$, let $\\mathcal{F}$ be a family of $k$-subsets of $X$. The Kruskal--Katona theorem implies that if $|\\mathcal{F}|\\geq \\binom{t}{k}$, then $|\\partial_\\ell\\mathcal{F}|\\geq\\binom{t}{\\ell}$. The minimum degree version of this problem asks: if $\\delta(\\mathcal{F})\\geq \\binom{t}{k-1}$, how small can $|\\partial_\\ell\\mathcal{F}|$ be? We call a hypergraph \\textit{extremal} if it achieves the minimum value of $|\\partial_\\ell \\mathcal{F}|$ subject to the degree condition $\\delta(\\mathcal{F}) \\geq \\binom{t}{k-1}$. F\\\"uredi and Zhao [SIAM J. Discrete Math. 36(4), 2022] pro","authors_text":"Haorui Liu, Mei Lu, Yi Zhang","cross_cats":[],"headline":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T13:58:17Z","title":"Shadows of Uniform Hypergraphs under a Minimum Degree Condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.02610","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T17:45:04.664185Z","id":"375938ae-2e0f-4bae-8c52-c8211b0147a0","model_set":{"reader":"grok-4.3"},"one_line_summary":"For k-uniform hypergraphs with δ(F) ≥ binom(t, k-1), the minimum |∂_ℓ F| is achieved by one containing an isolated K_{t+1}^k when |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"For vertex sets larger than a quadratic bound in t, any extremal k-uniform hypergraph with minimum degree binom(t, k-1) contains an isolated copy of K^k_{t+1}.","strongest_claim":"By developing a hypergraph transformation that combines shifting operations with antilexicographic compression, we prove that there exists an extremal hypergraph containing an isolated copy of K^k_{t+1} whenever |X| > (1/4)(t+1)^2 binom(t-1, ℓ-2) + 2t.","weakest_assumption":"The new shifting-plus-antilexicographic-compression transformation preserves both the minimum-degree condition and the extremal property for arbitrary k > ℓ ≥ 2."}},"verdict_id":"375938ae-2e0f-4bae-8c52-c8211b0147a0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c43b5c444ed0e53592e3c251934d04fcb150aa7bef723a095c50732584b7e0b0","target":"record","created_at":"2026-07-08T01:18:29Z","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":"5d9c3c9ead731433733fe5a588e371fba8228c2d6a4ce1ae101a7c2ee71fdb3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-04T13:58:17Z","title_canon_sha256":"786d4c3b040e5a6fb865d6b43cbd1637886385623d4c9b1a15a563429c8ca737"},"schema_version":"1.0","source":{"id":"2605.02610","kind":"arxiv","version":2}},"canonical_sha256":"470d6ac71320d38487b240eb4307e58f7f6b2159e8e5d5c543257dc818766469","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"470d6ac71320d38487b240eb4307e58f7f6b2159e8e5d5c543257dc818766469","first_computed_at":"2026-07-08T01:18:29.498954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:29.498954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WUecaOu6TTgqcPqS1FzLB/rKLwu1j+ClwykUqlEsvHjyfl6rnP8/mtS5o5kczHZfa2S5+DeZejQ10s7o9hwnDg==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:29.499422Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.02610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c43b5c444ed0e53592e3c251934d04fcb150aa7bef723a095c50732584b7e0b0","sha256:5391bcdca4f2abeb625a6e451c1518219e23764a20f27b2d17decc321468a87e"],"state_sha256":"ebe7162ae8a6c5c96019ad0aec4c1c244d604f33304232cc4f496ca6f0c021e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fq5XaGwiluFt4q7k6JrCSsYASzAAE9Dd/dZgfFTCQJxA7gKJwedNP4cFMfcV0z2wE8Xj/0TuxAGaViYoPyflCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T22:53:13.756544Z","bundle_sha256":"fcbebbd13ae57026fe3129650a485786a8fafbb82f54c1b880d9b3ba3f62cb72"}}