{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AVISULT5WX7JKKC5YLMWJKKXY2","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":"ef20adab3cbaddbaa7ce546340a7eb2444cc5ed3b1ce42234f4927a506657f6b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-22T14:04:33Z","title_canon_sha256":"2e3fb6a2c52207f25f08a7da843c3b9f7d943438a0092e84dd4c89d355748b27"},"schema_version":"1.0","source":{"id":"2410.17034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.17034","created_at":"2026-07-05T09:24:11Z"},{"alias_kind":"arxiv_version","alias_value":"2410.17034v1","created_at":"2026-07-05T09:24:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.17034","created_at":"2026-07-05T09:24:11Z"},{"alias_kind":"pith_short_12","alias_value":"AVISULT5WX7J","created_at":"2026-07-05T09:24:11Z"},{"alias_kind":"pith_short_16","alias_value":"AVISULT5WX7JKKC5","created_at":"2026-07-05T09:24:11Z"},{"alias_kind":"pith_short_8","alias_value":"AVISULT5","created_at":"2026-07-05T09:24:11Z"}],"graph_snapshots":[{"event_id":"sha256:33cbe375b5ba77c96a971d9b4477629c3fdab153e268a4888074e68440e22354","target":"graph","created_at":"2026-07-05T09:24:11Z","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.17034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erd\\H{o}s, F\\\"{u}redi, Loebl and S\\'{o}s. Given a fixed tree $T$ on $n$ vertices and an edge-colouring of the complete graph $K_n$, for every colour, we find a copy of $T$ in $K_n$ where the number of edges in that colour significantly exceeds its expected count in a uniformly random embedding. This resolves a problem posed by Erd\\H{o}s, F\\\"{u}redi, Loebl and S\\'{o}s by generalising their work from two to many colours. Furthermore, if $T$ has maximum degree $\\Delta\\leq\\epsilon n$ for sufficient","authors_text":"Adva Mond, Julien Portier, Lawrence Hollom, Lyuben Lichev","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-22T14:04:33Z","title":"Discrepancies of spanning trees in dense graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.17034","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:e3124f8cb3f43a8df9de3657869ddd5de73eb97fd1a2706d85d6e7940b50d35d","target":"record","created_at":"2026-07-05T09:24:11Z","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":"ef20adab3cbaddbaa7ce546340a7eb2444cc5ed3b1ce42234f4927a506657f6b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-10-22T14:04:33Z","title_canon_sha256":"2e3fb6a2c52207f25f08a7da843c3b9f7d943438a0092e84dd4c89d355748b27"},"schema_version":"1.0","source":{"id":"2410.17034","kind":"arxiv","version":1}},"canonical_sha256":"05512a2e7db5fe95285dc2d964a957c6857658f0ab698595c3851f723e3098a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05512a2e7db5fe95285dc2d964a957c6857658f0ab698595c3851f723e3098a7","first_computed_at":"2026-07-05T09:24:11.009636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:24:11.009636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iAQokmXoyBWsZIYQ+AOOdgdIq+YUUjMHLC6oOeK/kTtKgpRI8e2+9L+ZixrYvHFED2FXWuVhDPezL7Bv55h6Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:24:11.010147Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.17034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3124f8cb3f43a8df9de3657869ddd5de73eb97fd1a2706d85d6e7940b50d35d","sha256:33cbe375b5ba77c96a971d9b4477629c3fdab153e268a4888074e68440e22354"],"state_sha256":"3a793ac9c2a791fe441f4925be470ce88ab9186fe3e87454a5d8dd6bb85b30ca"}