{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LGVKZEQLBONSFWAH5SSTVVESDR","short_pith_number":"pith:LGVKZEQL","schema_version":"1.0","canonical_sha256":"59aaac920b0b9b22d807eca53ad4921c53b6c392bd1f85c3cda7d48ec6b8f37c","source":{"kind":"arxiv","id":"1912.05251","version":3},"attestation_state":"computed","paper":{"title":"Colouring bottomless rectangles and arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Jean Cardinal, Kolja Knauer, Narmada Varadarajan, Piotr Micek, Torsten Ueckerdt","submitted_at":"2019-12-11T12:11:04Z","abstract_excerpt":"We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in increasing order of their top sides, so that any $m$-fold covered point is covered by at least two colours. This is, surprisingly, a corollary of a stronger result for arborescence colourings. Any semi-online colouring algorithm that colours an arborescence in leaf-to-root order with a bounded number of colours produces arbitrarily long monochromatic paths. This "},"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":"1912.05251","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-11T12:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"2ea72018303e191991242814a444c990b52ae03c42eb64b82cd545241ddfb950","abstract_canon_sha256":"4c15244d7214915fc5e993caad388835cfbc5be8d904c67f2a1bfec15c10fc84"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:33:18.575066Z","signature_b64":"vkvj1gEhkbGFUbqURNYV57S7+Jbe+qNF35Kxuz+ucLA5q5ZJK2o20JJCwd0Mtomw2PjiMZGi/dtdhF4AhmsJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59aaac920b0b9b22d807eca53ad4921c53b6c392bd1f85c3cda7d48ec6b8f37c","last_reissued_at":"2026-07-05T01:33:18.574659Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:33:18.574659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colouring bottomless rectangles and arborescences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Jean Cardinal, Kolja Knauer, Narmada Varadarajan, Piotr Micek, Torsten Ueckerdt","submitted_at":"2019-12-11T12:11:04Z","abstract_excerpt":"We study problems related to colouring bottomless rectangles. One of our main results shows that for any positive integers $m, k$, there is no semi-online algorithm that can $k$-colour bottomless rectangles with disjoint boundaries in increasing order of their top sides, so that any $m$-fold covered point is covered by at least two colours. This is, surprisingly, a corollary of a stronger result for arborescence colourings. Any semi-online colouring algorithm that colours an arborescence in leaf-to-root order with a bounded number of colours produces arbitrarily long monochromatic paths. This "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.05251","kind":"arxiv","version":3},"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/1912.05251/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":"1912.05251","created_at":"2026-07-05T01:33:18.574723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.05251v3","created_at":"2026-07-05T01:33:18.574723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.05251","created_at":"2026-07-05T01:33:18.574723+00:00"},{"alias_kind":"pith_short_12","alias_value":"LGVKZEQLBONS","created_at":"2026-07-05T01:33:18.574723+00:00"},{"alias_kind":"pith_short_16","alias_value":"LGVKZEQLBONSFWAH","created_at":"2026-07-05T01:33:18.574723+00:00"},{"alias_kind":"pith_short_8","alias_value":"LGVKZEQL","created_at":"2026-07-05T01:33:18.574723+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.18655","citing_title":"Extraction Theorems With Small Extraction Numbers","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR","json":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR.json","graph_json":"https://pith.science/api/pith-number/LGVKZEQLBONSFWAH5SSTVVESDR/graph.json","events_json":"https://pith.science/api/pith-number/LGVKZEQLBONSFWAH5SSTVVESDR/events.json","paper":"https://pith.science/paper/LGVKZEQL"},"agent_actions":{"view_html":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR","download_json":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR.json","view_paper":"https://pith.science/paper/LGVKZEQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.05251&json=true","fetch_graph":"https://pith.science/api/pith-number/LGVKZEQLBONSFWAH5SSTVVESDR/graph.json","fetch_events":"https://pith.science/api/pith-number/LGVKZEQLBONSFWAH5SSTVVESDR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR/action/storage_attestation","attest_author":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR/action/author_attestation","sign_citation":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR/action/citation_signature","submit_replication":"https://pith.science/pith/LGVKZEQLBONSFWAH5SSTVVESDR/action/replication_record"}},"created_at":"2026-07-05T01:33:18.574723+00:00","updated_at":"2026-07-05T01:33:18.574723+00:00"}