{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B5IMHGIFUQUZBPTUKP6URFZHQJ","short_pith_number":"pith:B5IMHGIF","schema_version":"1.0","canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","source":{"kind":"arxiv","id":"2410.06148","version":1},"attestation_state":"computed","paper":{"title":"Almost colour-balanced spanning forests in complete graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom","submitted_at":"2024-10-08T15:48:20Z","abstract_excerpt":"Given $K_n$ whose edges are coloured red and blue, and a forest $F$ of order $n$, we seek embeddings of $F$ with small imbalance, that is, difference between the numbers of red and blue edges. We show that if the $2$-colouring of the edges of $K_n$ is balanced, meaning that the numbers of red and blue edges are equal, and $F$ has maximum degree $\\Delta$, then one can find an embedding of $F$ into $K_n$ whose imbalance is at most $\\Delta/2 + 18$, which is essentially best possible and resolves a conjecture of Mohr, Pardey, and Rautenbach. Furthermore, we give a tighter bound for the imbalance f"},"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":"2410.06148","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T15:48:20Z","cross_cats_sorted":[],"title_canon_sha256":"4fbc4863eb93575a40c88c33b6e5beb74f93cb71411ac44ec3e1c6bb40f26174","abstract_canon_sha256":"b996f15903e4ef069b1abbde364d904063c486b96c8d1c68c715180fdfea61a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:17:56.590601Z","signature_b64":"y+Hw8wTOIr/YYfx+hygnSfu+XYc95zTjsttyOSAgMs76TJ1ekUwE5g4EAnawid7FhUJKj0xO3ODtzeJ/zg+UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","last_reissued_at":"2026-07-05T09:17:56.590041Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:17:56.590041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost colour-balanced spanning forests in complete graphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom","submitted_at":"2024-10-08T15:48:20Z","abstract_excerpt":"Given $K_n$ whose edges are coloured red and blue, and a forest $F$ of order $n$, we seek embeddings of $F$ with small imbalance, that is, difference between the numbers of red and blue edges. We show that if the $2$-colouring of the edges of $K_n$ is balanced, meaning that the numbers of red and blue edges are equal, and $F$ has maximum degree $\\Delta$, then one can find an embedding of $F$ into $K_n$ whose imbalance is at most $\\Delta/2 + 18$, which is essentially best possible and resolves a conjecture of Mohr, Pardey, and Rautenbach. Furthermore, we give a tighter bound for the imbalance f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06148","kind":"arxiv","version":1},"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/2410.06148/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":"2410.06148","created_at":"2026-07-05T09:17:56.590108+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.06148v1","created_at":"2026-07-05T09:17:56.590108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06148","created_at":"2026-07-05T09:17:56.590108+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5IMHGIFUQUZ","created_at":"2026-07-05T09:17:56.590108+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5IMHGIFUQUZBPTU","created_at":"2026-07-05T09:17:56.590108+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5IMHGIF","created_at":"2026-07-05T09:17:56.590108+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09449","citing_title":"Colour-balanced subgraphs","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ","json":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ.json","graph_json":"https://pith.science/api/pith-number/B5IMHGIFUQUZBPTUKP6URFZHQJ/graph.json","events_json":"https://pith.science/api/pith-number/B5IMHGIFUQUZBPTUKP6URFZHQJ/events.json","paper":"https://pith.science/paper/B5IMHGIF"},"agent_actions":{"view_html":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ","download_json":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ.json","view_paper":"https://pith.science/paper/B5IMHGIF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.06148&json=true","fetch_graph":"https://pith.science/api/pith-number/B5IMHGIFUQUZBPTUKP6URFZHQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/B5IMHGIFUQUZBPTUKP6URFZHQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/action/storage_attestation","attest_author":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/action/author_attestation","sign_citation":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/action/citation_signature","submit_replication":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/action/replication_record"}},"created_at":"2026-07-05T09:17:56.590108+00:00","updated_at":"2026-07-05T09:17:56.590108+00:00"}