{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LGVKZEQLBONSFWAH5SSTVVESDR","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":"4c15244d7214915fc5e993caad388835cfbc5be8d904c67f2a1bfec15c10fc84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-11T12:11:04Z","title_canon_sha256":"2ea72018303e191991242814a444c990b52ae03c42eb64b82cd545241ddfb950"},"schema_version":"1.0","source":{"id":"1912.05251","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1912.05251","created_at":"2026-07-05T01:33:18Z"},{"alias_kind":"arxiv_version","alias_value":"1912.05251v3","created_at":"2026-07-05T01:33:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.05251","created_at":"2026-07-05T01:33:18Z"},{"alias_kind":"pith_short_12","alias_value":"LGVKZEQLBONS","created_at":"2026-07-05T01:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"LGVKZEQLBONSFWAH","created_at":"2026-07-05T01:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"LGVKZEQL","created_at":"2026-07-05T01:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:7b0047663dfe3d3d7d4018d83dc26f64760dc781fa5a7d712ce9f5441bc2a68a","target":"graph","created_at":"2026-07-05T01:33:18Z","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/1912.05251/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Jean Cardinal, Kolja Knauer, Narmada Varadarajan, Piotr Micek, Torsten Ueckerdt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-11T12:11:04Z","title":"Colouring bottomless rectangles and arborescences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.05251","kind":"arxiv","version":3},"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:70fdd646343bbde7f46fdfddf9004f865c06cd5c18272ff00d09271c4664cd9d","target":"record","created_at":"2026-07-05T01:33:18Z","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":"4c15244d7214915fc5e993caad388835cfbc5be8d904c67f2a1bfec15c10fc84","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-11T12:11:04Z","title_canon_sha256":"2ea72018303e191991242814a444c990b52ae03c42eb64b82cd545241ddfb950"},"schema_version":"1.0","source":{"id":"1912.05251","kind":"arxiv","version":3}},"canonical_sha256":"59aaac920b0b9b22d807eca53ad4921c53b6c392bd1f85c3cda7d48ec6b8f37c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59aaac920b0b9b22d807eca53ad4921c53b6c392bd1f85c3cda7d48ec6b8f37c","first_computed_at":"2026-07-05T01:33:18.574659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:33:18.574659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vkvj1gEhkbGFUbqURNYV57S7+Jbe+qNF35Kxuz+ucLA5q5ZJK2o20JJCwd0Mtomw2PjiMZGi/dtdhF4AhmsJDw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:33:18.575066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1912.05251","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70fdd646343bbde7f46fdfddf9004f865c06cd5c18272ff00d09271c4664cd9d","sha256:7b0047663dfe3d3d7d4018d83dc26f64760dc781fa5a7d712ce9f5441bc2a68a"],"state_sha256":"b3f9d2df243a643cdc6819fd925a7df61949394a9049b7bff353cc58751d3ec1"}