{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BWJXC5KR2BDGZ7NBA6WMEU5B6L","short_pith_number":"pith:BWJXC5KR","schema_version":"1.0","canonical_sha256":"0d93717551d0466cfda107acc253a1f2fe888fa34145fd2f1821807c149f3d53","source":{"kind":"arxiv","id":"2303.04782","version":2},"attestation_state":"computed","paper":{"title":"A note on interval colourings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Emil Powierski, Julien Portier, Lawrence Hollom, Leo Versteegen, Maria Axenovich, Michael Savery, Youri Tamitegama","submitted_at":"2023-03-08T18:30:49Z","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"},"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":"2303.04782","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-03-08T18:30:49Z","cross_cats_sorted":[],"title_canon_sha256":"255f980bc317323f7e82b32a664e4e79b086513e209d06870857c3473d71e4cc","abstract_canon_sha256":"58d80d8d8955b040d5fd41004b3b560980ced7840c2fe4f7e47de2eb95bce54f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:01.353987Z","signature_b64":"k6ciSt+aQnmTO3HvkikYjaQ+7mm+8EGv2Rs48N5ZJBtXlASDpvXFEQIaYr7063MN4AVc/NXyK93uo9VRZGAcDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d93717551d0466cfda107acc253a1f2fe888fa34145fd2f1821807c149f3d53","last_reissued_at":"2026-07-05T08:54:01.353396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:01.353396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on interval colourings of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ant\\'onio Gir\\~ao, Emil Powierski, Julien Portier, Lawrence Hollom, Leo Versteegen, Maria Axenovich, Michael Savery, Youri Tamitegama","submitted_at":"2023-03-08T18:30:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.04782","kind":"arxiv","version":2},"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/2303.04782/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":"2303.04782","created_at":"2026-07-05T08:54:01.353465+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.04782v2","created_at":"2026-07-05T08:54:01.353465+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.04782","created_at":"2026-07-05T08:54:01.353465+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWJXC5KR2BDG","created_at":"2026-07-05T08:54:01.353465+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWJXC5KR2BDGZ7NB","created_at":"2026-07-05T08:54:01.353465+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWJXC5KR","created_at":"2026-07-05T08:54:01.353465+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L","json":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L.json","graph_json":"https://pith.science/api/pith-number/BWJXC5KR2BDGZ7NBA6WMEU5B6L/graph.json","events_json":"https://pith.science/api/pith-number/BWJXC5KR2BDGZ7NBA6WMEU5B6L/events.json","paper":"https://pith.science/paper/BWJXC5KR"},"agent_actions":{"view_html":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L","download_json":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L.json","view_paper":"https://pith.science/paper/BWJXC5KR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.04782&json=true","fetch_graph":"https://pith.science/api/pith-number/BWJXC5KR2BDGZ7NBA6WMEU5B6L/graph.json","fetch_events":"https://pith.science/api/pith-number/BWJXC5KR2BDGZ7NBA6WMEU5B6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L/action/storage_attestation","attest_author":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L/action/author_attestation","sign_citation":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L/action/citation_signature","submit_replication":"https://pith.science/pith/BWJXC5KR2BDGZ7NBA6WMEU5B6L/action/replication_record"}},"created_at":"2026-07-05T08:54:01.353465+00:00","updated_at":"2026-07-05T08:54:01.353465+00:00"}