{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DAKX4PHTS3PI5WWFGGKNK34AJ7","short_pith_number":"pith:DAKX4PHT","canonical_record":{"source":{"id":"2604.25206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T04:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"35d481cb58e797e38ccc889f1e2dd96f0936946d0e9be3db59bdfbbcaf916bb5","abstract_canon_sha256":"57f3d951c4aa8f707db15bdbcb504ba99b80a415e46fcde4992e4884a2ef6dd8"},"schema_version":"1.0"},"canonical_sha256":"18157e3cf396de8edac53194d56f804fff2fb2e55699a92056a1c9939723e390","source":{"kind":"arxiv","id":"2604.25206","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.25206","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2604.25206v2","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25206","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"DAKX4PHTS3PI","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"DAKX4PHTS3PI5WWF","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"DAKX4PHT","created_at":"2026-06-25T01:17:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DAKX4PHTS3PI5WWFGGKNK34AJ7","target":"record","payload":{"canonical_record":{"source":{"id":"2604.25206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T04:23:55Z","cross_cats_sorted":[],"title_canon_sha256":"35d481cb58e797e38ccc889f1e2dd96f0936946d0e9be3db59bdfbbcaf916bb5","abstract_canon_sha256":"57f3d951c4aa8f707db15bdbcb504ba99b80a415e46fcde4992e4884a2ef6dd8"},"schema_version":"1.0"},"canonical_sha256":"18157e3cf396de8edac53194d56f804fff2fb2e55699a92056a1c9939723e390","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-25T01:17:53.503914Z","signature_b64":"zcRB6kutv+lW6GeM/eobU6A0BNBa/AbuZ/aDIQ+tLsGkG/rdOP+sYV7zDrzUwFG/m9azf7dWJ3ArCsbhSpzWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18157e3cf396de8edac53194d56f804fff2fb2e55699a92056a1c9939723e390","last_reissued_at":"2026-06-25T01:17:53.503485Z","signature_status":"signed_v1","first_computed_at":"2026-06-25T01:17:53.503485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.25206","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-06-25T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mEP9TTEXqGJWT7pHOP8WCVu74uFUi94gsmjyZ2iCUYx7wSIuyvWjInkiG31tcZw9gTikj3ebA/hB4qxbPIojBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:00:10.961770Z"},"content_sha256":"b86443c946a0e57837235edf58d8b1d0e494bab8e7d176552a76cd390b79ab86","schema_version":"1.0","event_id":"sha256:b86443c946a0e57837235edf58d8b1d0e494bab8e7d176552a76cd390b79ab86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DAKX4PHTS3PI5WWFGGKNK34AJ7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional clique decompositions of dense balanced multipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengrui Liu, Shikang Yu, Tao Feng","submitted_at":"2026-04-28T04:23:55Z","abstract_excerpt":"This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\\ge s\\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if r≥s+2 and the partite minimum degree of G is at least (1-c)n with c≤1/((s-2)(s+1)(s-1)^4), then G has a fractional K_s-decomposition; for r=s+1 the bound is c≤1/(3s^3(s-2)^2) under s-admissibility.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The graphs must be balanced (equal part sizes) and the s-admissibility condition must hold; the association scheme averaging argument assumes the density is high enough for the error terms to be controlled by the given c bounds.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"e9a77685293f85537249f607d162a9d9adee163443837946aa685ef1343ddd40"},"source":{"id":"2604.25206","kind":"arxiv","version":2},"verdict":{"id":"8fd16ff8-c56c-423f-9e90-09dd4a32fb87","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-07T16:00:51.545802Z","strongest_claim":"if r≥s+2 and the partite minimum degree of G is at least (1-c)n with c≤1/((s-2)(s+1)(s-1)^4), then G has a fractional K_s-decomposition; for r=s+1 the bound is c≤1/(3s^3(s-2)^2) under s-admissibility.","one_line_summary":"Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The graphs must be balanced (equal part sizes) and the s-admissibility condition must hold; the association scheme averaging argument assumes the density is high enough for the error terms to be controlled by the given c bounds.","pith_extraction_headline":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.25206/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T05:35:10.977157Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:23:27.553405Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d4645e3df1480acde721b1c64ae938d12b06329e29675776835f35a6905d4fec"},"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":"8fd16ff8-c56c-423f-9e90-09dd4a32fb87"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-25T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBOiQ0ZWeIOWMVqP30vGUkBoRQeAyxE7FjsCyDBMRiDcZG5v/oobcceV1bGDhXzXGO0+BTzIyJsG6tylhfaLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:00:10.962371Z"},"content_sha256":"d357b1799fdb0da0298c411e972fed9092c434d724dea5944b4b281026f720be","schema_version":"1.0","event_id":"sha256:d357b1799fdb0da0298c411e972fed9092c434d724dea5944b4b281026f720be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/bundle.json","state_url":"https://pith.science/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/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-07-02T10:00:10Z","links":{"resolver":"https://pith.science/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7","bundle":"https://pith.science/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/bundle.json","state":"https://pith.science/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAKX4PHTS3PI5WWFGGKNK34AJ7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DAKX4PHTS3PI5WWFGGKNK34AJ7","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":"57f3d951c4aa8f707db15bdbcb504ba99b80a415e46fcde4992e4884a2ef6dd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T04:23:55Z","title_canon_sha256":"35d481cb58e797e38ccc889f1e2dd96f0936946d0e9be3db59bdfbbcaf916bb5"},"schema_version":"1.0","source":{"id":"2604.25206","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.25206","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2604.25206v2","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.25206","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"DAKX4PHTS3PI","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"DAKX4PHTS3PI5WWF","created_at":"2026-06-25T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"DAKX4PHT","created_at":"2026-06-25T01:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:d357b1799fdb0da0298c411e972fed9092c434d724dea5944b4b281026f720be","target":"graph","created_at":"2026-06-25T01:17:53Z","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":"if r≥s+2 and the partite minimum degree of G is at least (1-c)n with c≤1/((s-2)(s+1)(s-1)^4), then G has a fractional K_s-decomposition; for r=s+1 the bound is c≤1/(3s^3(s-2)^2) under s-admissibility."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graphs must be balanced (equal part sizes) and the s-admissibility condition must hold; the association scheme averaging argument assumes the density is high enough for the error terms to be controlled by the given c bounds."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s."}],"snapshot_sha256":"e9a77685293f85537249f607d162a9d9adee163443837946aa685ef1343ddd40"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T05:35:10.977157Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:23:27.553405Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.25206/integrity.json","findings":[],"snapshot_sha256":"d4645e3df1480acde721b1c64ae938d12b06329e29675776835f35a6905d4fec","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\\ge s\\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under","authors_text":"Hengrui Liu, Shikang Yu, Tao Feng","cross_cats":[],"headline":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T04:23:55Z","title":"Fractional clique decompositions of dense balanced multipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.25206","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-07T16:00:51.545802Z","id":"8fd16ff8-c56c-423f-9e90-09dd4a32fb87","model_set":{"reader":"grok-4.3"},"one_line_summary":"Balanced r-partite graphs with partite minimum degree at least (1-c)n admit fractional K_s-decompositions for r >= s+1 under explicit c bounds that depend on s and the gap between r and s.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Balanced r-partite graphs with high partite minimum degree admit fractional K_s-decompositions for small enough density deficits depending on r and s.","strongest_claim":"if r≥s+2 and the partite minimum degree of G is at least (1-c)n with c≤1/((s-2)(s+1)(s-1)^4), then G has a fractional K_s-decomposition; for r=s+1 the bound is c≤1/(3s^3(s-2)^2) under s-admissibility.","weakest_assumption":"The graphs must be balanced (equal part sizes) and the s-admissibility condition must hold; the association scheme averaging argument assumes the density is high enough for the error terms to be controlled by the given c bounds."}},"verdict_id":"8fd16ff8-c56c-423f-9e90-09dd4a32fb87"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b86443c946a0e57837235edf58d8b1d0e494bab8e7d176552a76cd390b79ab86","target":"record","created_at":"2026-06-25T01:17:53Z","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":"57f3d951c4aa8f707db15bdbcb504ba99b80a415e46fcde4992e4884a2ef6dd8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-04-28T04:23:55Z","title_canon_sha256":"35d481cb58e797e38ccc889f1e2dd96f0936946d0e9be3db59bdfbbcaf916bb5"},"schema_version":"1.0","source":{"id":"2604.25206","kind":"arxiv","version":2}},"canonical_sha256":"18157e3cf396de8edac53194d56f804fff2fb2e55699a92056a1c9939723e390","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18157e3cf396de8edac53194d56f804fff2fb2e55699a92056a1c9939723e390","first_computed_at":"2026-06-25T01:17:53.503485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:17:53.503485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zcRB6kutv+lW6GeM/eobU6A0BNBa/AbuZ/aDIQ+tLsGkG/rdOP+sYV7zDrzUwFG/m9azf7dWJ3ArCsbhSpzWBg==","signature_status":"signed_v1","signed_at":"2026-06-25T01:17:53.503914Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.25206","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b86443c946a0e57837235edf58d8b1d0e494bab8e7d176552a76cd390b79ab86","sha256:d357b1799fdb0da0298c411e972fed9092c434d724dea5944b4b281026f720be"],"state_sha256":"45b1eaee336ab4f0a1370c84df9d679d7d2caf2849a078dc91e59de74a4ca408"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvKXHRCF7r9ZHR9ycYF5lSWlm9C+Wyzn5v4g97eD/SRaSviP3cw7/FJPjhaGqeQYh9sIZ03223KU7P+9ajd5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T10:00:10.964930Z","bundle_sha256":"a99a7d1348b597297ecba5c573fed7aaf375b7b8b12ffe1ae55eb507fd674371"}}