{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BWJXC5KR2BDGZ7NBA6WMEU5B6L","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":"58d80d8d8955b040d5fd41004b3b560980ced7840c2fe4f7e47de2eb95bce54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-08T18:30:49Z","title_canon_sha256":"255f980bc317323f7e82b32a664e4e79b086513e209d06870857c3473d71e4cc"},"schema_version":"1.0","source":{"id":"2303.04782","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.04782","created_at":"2026-07-05T08:54:01Z"},{"alias_kind":"arxiv_version","alias_value":"2303.04782v2","created_at":"2026-07-05T08:54:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04782","created_at":"2026-07-05T08:54:01Z"},{"alias_kind":"pith_short_12","alias_value":"BWJXC5KR2BDG","created_at":"2026-07-05T08:54:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWJXC5KR2BDGZ7NB","created_at":"2026-07-05T08:54:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWJXC5KR","created_at":"2026-07-05T08:54:01Z"}],"graph_snapshots":[{"event_id":"sha256:6fd73fdeabf804b8d4b8c485bb6086cd37e82b71e1a2518375e5579aecec58aa","target":"graph","created_at":"2026-07-05T08:54:01Z","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/2303.04782/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is said to be interval colourable if it admits a proper edge-colouring using palette $\\mathbb{N}$ in which the set of colours incident to each vertex is an interval. The interval colouring thickness of a graph $G$ is the minimum $k$ such that $G$ can be edge-decomposed into $k$ interval colourable graphs. We show that $\\theta(n)$, the maximum interval colouring thickness of an $n$-vertex graph, satisfies $\\theta(n) =\\Omega(\\log(n)/\\log\\log(n))$ and $\\theta(n)\\leq n^{5/6+o(1)}$, which improves on the trivial lower bound and an upper bound of the first author and Zheng. As a corollary, w","authors_text":"Ant\\'onio Gir\\~ao, Emil Powierski, Julien Portier, Lawrence Hollom, Leo Versteegen, Maria Axenovich, Michael Savery, Youri Tamitegama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-08T18:30:49Z","title":"A note on interval colourings of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04782","kind":"arxiv","version":2},"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:b1156e517f58135c020dea3d760bde2affbaf75d9f7f8967e8948350c93e965e","target":"record","created_at":"2026-07-05T08:54:01Z","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":"58d80d8d8955b040d5fd41004b3b560980ced7840c2fe4f7e47de2eb95bce54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-08T18:30:49Z","title_canon_sha256":"255f980bc317323f7e82b32a664e4e79b086513e209d06870857c3473d71e4cc"},"schema_version":"1.0","source":{"id":"2303.04782","kind":"arxiv","version":2}},"canonical_sha256":"0d93717551d0466cfda107acc253a1f2fe888fa34145fd2f1821807c149f3d53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d93717551d0466cfda107acc253a1f2fe888fa34145fd2f1821807c149f3d53","first_computed_at":"2026-07-05T08:54:01.353396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:01.353396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k6ciSt+aQnmTO3HvkikYjaQ+7mm+8EGv2Rs48N5ZJBtXlASDpvXFEQIaYr7063MN4AVc/NXyK93uo9VRZGAcDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:01.353987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.04782","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1156e517f58135c020dea3d760bde2affbaf75d9f7f8967e8948350c93e965e","sha256:6fd73fdeabf804b8d4b8c485bb6086cd37e82b71e1a2518375e5579aecec58aa"],"state_sha256":"352474dfa25005978ef7837d3b87fb861ef1d27628ef8663e073629264da32c1"}