{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:B5IMHGIFUQUZBPTUKP6URFZHQJ","short_pith_number":"pith:B5IMHGIF","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"},"canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","source":{"kind":"arxiv","id":"2410.06148","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06148","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06148v1","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06148","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"B5IMHGIFUQUZ","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"B5IMHGIFUQUZBPTU","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"B5IMHGIF","created_at":"2026-07-05T09:17:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:B5IMHGIFUQUZBPTUKP6URFZHQJ","target":"record","payload":{"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"},"canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","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"},"source_kind":"arxiv","source_id":"2410.06148","source_version":1,"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:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FpMHMYRK3J6auyIcEz3ApN9fsZUzUshdPwbA14Rdy4H5i246Uiy3VcRi+VW5CS8uOlEfJv8utasmI+G4TvAvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:57:28.682395Z"},"content_sha256":"ba632fe668dc30873223cc58664d4be91cd1309f2e8d34102b78021634da4df0","schema_version":"1.0","event_id":"sha256:ba632fe668dc30873223cc58664d4be91cd1309f2e8d34102b78021634da4df0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:B5IMHGIFUQUZBPTUKP6URFZHQJ","target":"graph","payload":{"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"},"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:17:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u2+97FStn95KjVmsY2YiVjef6OJX5O9pcazKsltsGD5Ae6Nk1fn89XMgFrkGIpFyyuhl7mkdjl1tHpJJyRlVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T15:57:28.682965Z"},"content_sha256":"92092ba043c2cabba67bd9fc5e5cc1412bf7e3469ded1cc68eb6848e3a9694a5","schema_version":"1.0","event_id":"sha256:92092ba043c2cabba67bd9fc5e5cc1412bf7e3469ded1cc68eb6848e3a9694a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/bundle.json","state_url":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/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-15T15:57:28Z","links":{"resolver":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ","bundle":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/bundle.json","state":"https://pith.science/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5IMHGIFUQUZBPTUKP6URFZHQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:B5IMHGIFUQUZBPTUKP6URFZHQJ","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":"b996f15903e4ef069b1abbde364d904063c486b96c8d1c68c715180fdfea61a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T15:48:20Z","title_canon_sha256":"4fbc4863eb93575a40c88c33b6e5beb74f93cb71411ac44ec3e1c6bb40f26174"},"schema_version":"1.0","source":{"id":"2410.06148","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.06148","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"arxiv_version","alias_value":"2410.06148v1","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.06148","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_12","alias_value":"B5IMHGIFUQUZ","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_16","alias_value":"B5IMHGIFUQUZBPTU","created_at":"2026-07-05T09:17:56Z"},{"alias_kind":"pith_short_8","alias_value":"B5IMHGIF","created_at":"2026-07-05T09:17:56Z"}],"graph_snapshots":[{"event_id":"sha256:92092ba043c2cabba67bd9fc5e5cc1412bf7e3469ded1cc68eb6848e3a9694a5","target":"graph","created_at":"2026-07-05T09:17:56Z","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/2410.06148/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T15:48:20Z","title":"Almost colour-balanced spanning forests in complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.06148","kind":"arxiv","version":1},"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:ba632fe668dc30873223cc58664d4be91cd1309f2e8d34102b78021634da4df0","target":"record","created_at":"2026-07-05T09:17:56Z","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":"b996f15903e4ef069b1abbde364d904063c486b96c8d1c68c715180fdfea61a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-08T15:48:20Z","title_canon_sha256":"4fbc4863eb93575a40c88c33b6e5beb74f93cb71411ac44ec3e1c6bb40f26174"},"schema_version":"1.0","source":{"id":"2410.06148","kind":"arxiv","version":1}},"canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f50c39905a42990be7453fd4897278265f5a2ffd91660b7a4367e1f8dab685c","first_computed_at":"2026-07-05T09:17:56.590041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:17:56.590041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"y+Hw8wTOIr/YYfx+hygnSfu+XYc95zTjsttyOSAgMs76TJ1ekUwE5g4EAnawid7FhUJKj0xO3ODtzeJ/zg+UCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:17:56.590601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.06148","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba632fe668dc30873223cc58664d4be91cd1309f2e8d34102b78021634da4df0","sha256:92092ba043c2cabba67bd9fc5e5cc1412bf7e3469ded1cc68eb6848e3a9694a5"],"state_sha256":"340833f1b11b3d5e37a967fc591036cbf168bf2aaed9937674b8422c065c6012"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4911GI7G6faF8DU/fY88CVrB50YJuw67tgEGaMNyTxHZvQEDCSebyn1HEa/P/6hj6VMVVLAWNZTNTSDWJ+8Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T15:57:28.687055Z","bundle_sha256":"c0efe9d176c5b8e7f6a2653142adb9b69c37b75765d3680778dce2d697cee498"}}