{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CKCQEYJFXLEN3NWR52OLUVFXRS","short_pith_number":"pith:CKCQEYJF","canonical_record":{"source":{"id":"1302.2426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-11T09:40:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bb78185b4ff180ee638875a0fd5c501b97edfcd7074413e05d42d2a7164e0054","abstract_canon_sha256":"c688c9d62b3a0aaf6447e7c891995ea54e1e92914fdc255832cdda6eb6316923"},"schema_version":"1.0"},"canonical_sha256":"1285026125bac8ddb6d1ee9cba54b78cab05183ce13be47007728a20076131c8","source":{"kind":"arxiv","id":"1302.2426","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2426","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2426v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2426","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"CKCQEYJFXLEN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKCQEYJFXLEN3NWR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKCQEYJF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CKCQEYJFXLEN3NWR52OLUVFXRS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.2426","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-11T09:40:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bb78185b4ff180ee638875a0fd5c501b97edfcd7074413e05d42d2a7164e0054","abstract_canon_sha256":"c688c9d62b3a0aaf6447e7c891995ea54e1e92914fdc255832cdda6eb6316923"},"schema_version":"1.0"},"canonical_sha256":"1285026125bac8ddb6d1ee9cba54b78cab05183ce13be47007728a20076131c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:59.113471Z","signature_b64":"5Ep3k4gcTc56FUEfG6vsqNnpLym3wcoHVX2DEtlKfwBDofSpin9gCYElfKTwyL7QID5ykvcnlUE/XYTMbRKMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1285026125bac8ddb6d1ee9cba54b78cab05183ce13be47007728a20076131c8","last_reissued_at":"2026-05-18T02:26:59.113111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:59.113111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.2426","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"50wnrUY8ILnw4IS2Es8xBJpilZ92jMnXAvQvzkT+wUSmU4uJUFh/r1l7AOzt83VAh2wbUJJiRgbuHuO9u/b2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:13:41.753847Z"},"content_sha256":"b291d6b4593f10cdc53f1a308b443cfd56e6512929ddb75355a046154f7612a7","schema_version":"1.0","event_id":"sha256:b291d6b4593f10cdc53f1a308b443cfd56e6512929ddb75355a046154f7612a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CKCQEYJFXLEN3NWR52OLUVFXRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Andrei Asinowski, G\\\"unter Rote, Jean Cardinal, Kolja Knauer, Michael Hoffmann, Micha{\\l} Laso\\'n, Nathann Cohen, Piotr Micek, S\\'ebastien Collette, Stefan Langerman, Thomas Hackl, Torsten Ueckerdt","submitted_at":"2013-02-11T09:40:23Z","abstract_excerpt":"We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at any time, any sequence of p(k) consecutive points, for some function p, contains at least one point of each color.\n  We prove that no such function p(k) exists in general. However, in the restricted case in which points appear gradually, but never disappear, we give a coloring algorithm guaranteeing the property at any time with p(k)=3k-2. This can be interpreted as coloring point sets in R^2 with k colors such that an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2426","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+9nGJ/nvzX/jSEQh8ls3GiUmmxzTTaQ1bMcfOCa9N0aFFD54pQAramWr7DwbmCzDdj4Da8+4tCJezSj6U+tCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:13:41.754530Z"},"content_sha256":"8f813ba3358ded52d2bbcae0edc154f876bc6dbdfa7ccb0519cf712237668796","schema_version":"1.0","event_id":"sha256:8f813ba3358ded52d2bbcae0edc154f876bc6dbdfa7ccb0519cf712237668796"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/bundle.json","state_url":"https://pith.science/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T17:13:41Z","links":{"resolver":"https://pith.science/pith/CKCQEYJFXLEN3NWR52OLUVFXRS","bundle":"https://pith.science/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/bundle.json","state":"https://pith.science/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CKCQEYJFXLEN3NWR52OLUVFXRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CKCQEYJFXLEN3NWR52OLUVFXRS","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":"c688c9d62b3a0aaf6447e7c891995ea54e1e92914fdc255832cdda6eb6316923","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-11T09:40:23Z","title_canon_sha256":"bb78185b4ff180ee638875a0fd5c501b97edfcd7074413e05d42d2a7164e0054"},"schema_version":"1.0","source":{"id":"1302.2426","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2426","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2426v1","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2426","created_at":"2026-05-18T02:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"CKCQEYJFXLEN","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CKCQEYJFXLEN3NWR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CKCQEYJF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:8f813ba3358ded52d2bbcae0edc154f876bc6dbdfa7ccb0519cf712237668796","target":"graph","created_at":"2026-05-18T02:26:59Z","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"},"paper":{"abstract_excerpt":"We consider a coloring problem on dynamic, one-dimensional point sets: points appearing and disappearing on a line at given times. We wish to color them with k colors so that at any time, any sequence of p(k) consecutive points, for some function p, contains at least one point of each color.\n  We prove that no such function p(k) exists in general. However, in the restricted case in which points appear gradually, but never disappear, we give a coloring algorithm guaranteeing the property at any time with p(k)=3k-2. This can be interpreted as coloring point sets in R^2 with k colors such that an","authors_text":"Andrei Asinowski, G\\\"unter Rote, Jean Cardinal, Kolja Knauer, Michael Hoffmann, Micha{\\l} Laso\\'n, Nathann Cohen, Piotr Micek, S\\'ebastien Collette, Stefan Langerman, Thomas Hackl, Torsten Ueckerdt","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-11T09:40:23Z","title":"Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2426","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:b291d6b4593f10cdc53f1a308b443cfd56e6512929ddb75355a046154f7612a7","target":"record","created_at":"2026-05-18T02:26:59Z","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":"c688c9d62b3a0aaf6447e7c891995ea54e1e92914fdc255832cdda6eb6316923","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-02-11T09:40:23Z","title_canon_sha256":"bb78185b4ff180ee638875a0fd5c501b97edfcd7074413e05d42d2a7164e0054"},"schema_version":"1.0","source":{"id":"1302.2426","kind":"arxiv","version":1}},"canonical_sha256":"1285026125bac8ddb6d1ee9cba54b78cab05183ce13be47007728a20076131c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1285026125bac8ddb6d1ee9cba54b78cab05183ce13be47007728a20076131c8","first_computed_at":"2026-05-18T02:26:59.113111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:59.113111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Ep3k4gcTc56FUEfG6vsqNnpLym3wcoHVX2DEtlKfwBDofSpin9gCYElfKTwyL7QID5ykvcnlUE/XYTMbRKMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:59.113471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2426","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b291d6b4593f10cdc53f1a308b443cfd56e6512929ddb75355a046154f7612a7","sha256:8f813ba3358ded52d2bbcae0edc154f876bc6dbdfa7ccb0519cf712237668796"],"state_sha256":"d4cff04d3cbb9f9c1ba23740dce16a4045b858a266dd529080d23235bdad9c29"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ppis/lHGJ30TpPFl9rGKiO+Zy6RgO5Ed5owGW2+PhPk1va67dipAmOonY+qEGHpQHZsvXd9CLMQa4rRcaKJNCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:13:41.758411Z","bundle_sha256":"970da9813c1b0dca1dec32853828faf7b18f7c296a32fcf1fdea5224eae9db88"}}