{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PH375T2DKLAFYDUYVFT5EBVIPU","short_pith_number":"pith:PH375T2D","canonical_record":{"source":{"id":"1902.08468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T12:39:27Z","cross_cats_sorted":[],"title_canon_sha256":"bbe2964b4ede221690136f769b514b877a5ef516e30ba6a898d91e072fdce54c","abstract_canon_sha256":"e50ca7e846741a5ed1cd17545c0890b2099c25966b29c65388453942c628fb89"},"schema_version":"1.0"},"canonical_sha256":"79f7fecf4352c05c0e98a967d206a87d1e346c3c057b7cdd2b1692e463d486e9","source":{"kind":"arxiv","id":"1902.08468","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08468","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08468v2","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08468","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"PH375T2DKLAF","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PH375T2DKLAFYDUY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PH375T2D","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PH375T2DKLAFYDUYVFT5EBVIPU","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T12:39:27Z","cross_cats_sorted":[],"title_canon_sha256":"bbe2964b4ede221690136f769b514b877a5ef516e30ba6a898d91e072fdce54c","abstract_canon_sha256":"e50ca7e846741a5ed1cd17545c0890b2099c25966b29c65388453942c628fb89"},"schema_version":"1.0"},"canonical_sha256":"79f7fecf4352c05c0e98a967d206a87d1e346c3c057b7cdd2b1692e463d486e9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.679264Z","signature_b64":"wcMiUjOI5tJcypYK9S+o6NOU+vsl6X6HyTOcqkq0xcnZ0+ZFsaRtx+L0REX65juJoOm+9TVGh/5f0v48ECW1Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79f7fecf4352c05c0e98a967d206a87d1e346c3c057b7cdd2b1692e463d486e9","last_reissued_at":"2026-05-17T23:52:50.678628Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08468","source_version":2,"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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRmZ+rZTmdgbfXL0UAslL6m/QP2nrQDkLbM0rWYuq1I9iK1MrFR5DXxPALADUdigP1cIZFOYDgrusCKBAuviDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:06:11.899382Z"},"content_sha256":"bf67771423328e1e39d7ebbdd2ba3637cba27e8397d045af3c802ab69f339e2e","schema_version":"1.0","event_id":"sha256:bf67771423328e1e39d7ebbdd2ba3637cba27e8397d045af3c802ab69f339e2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PH375T2DKLAFYDUYVFT5EBVIPU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Eyal Ackerman","submitted_at":"2019-02-22T12:39:27Z","abstract_excerpt":"What is the minimum number of colors that always suffice to color every planar set of points such that any disk that contains enough points contains two points of different colors? It is known that the answer to this question is either three or four. We show that three colors always suffice if the condition must be satisfied only by disks that contain a fixed point. Our result also holds, and is even tight, when instead of disks we consider their topological generalization, namely pseudo-disks, with a non-empty intersection. Our solution uses the equivalence that a hypergraph can be realized b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08468","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":""},"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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r9DDSPHJqOqxoOpKnEHDngQ/efsMp+eDVAfog/WVG8Eg2S7yPznMOinELDdVVaofUvgKBENmqXACc9BtCIH3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:06:11.900016Z"},"content_sha256":"7f1a5d27d791db8761f16c8fb7c95985b94d9bd33866c20f64a26d7fbfdd0fa7","schema_version":"1.0","event_id":"sha256:7f1a5d27d791db8761f16c8fb7c95985b94d9bd33866c20f64a26d7fbfdd0fa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH375T2DKLAFYDUYVFT5EBVIPU/bundle.json","state_url":"https://pith.science/pith/PH375T2DKLAFYDUYVFT5EBVIPU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH375T2DKLAFYDUYVFT5EBVIPU/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:06:11Z","links":{"resolver":"https://pith.science/pith/PH375T2DKLAFYDUYVFT5EBVIPU","bundle":"https://pith.science/pith/PH375T2DKLAFYDUYVFT5EBVIPU/bundle.json","state":"https://pith.science/pith/PH375T2DKLAFYDUYVFT5EBVIPU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH375T2DKLAFYDUYVFT5EBVIPU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PH375T2DKLAFYDUYVFT5EBVIPU","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":"e50ca7e846741a5ed1cd17545c0890b2099c25966b29c65388453942c628fb89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T12:39:27Z","title_canon_sha256":"bbe2964b4ede221690136f769b514b877a5ef516e30ba6a898d91e072fdce54c"},"schema_version":"1.0","source":{"id":"1902.08468","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08468","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08468v2","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08468","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"PH375T2DKLAF","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PH375T2DKLAFYDUY","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PH375T2D","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:7f1a5d27d791db8761f16c8fb7c95985b94d9bd33866c20f64a26d7fbfdd0fa7","target":"graph","created_at":"2026-05-17T23:52:50Z","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":"What is the minimum number of colors that always suffice to color every planar set of points such that any disk that contains enough points contains two points of different colors? It is known that the answer to this question is either three or four. We show that three colors always suffice if the condition must be satisfied only by disks that contain a fixed point. Our result also holds, and is even tight, when instead of disks we consider their topological generalization, namely pseudo-disks, with a non-empty intersection. Our solution uses the equivalence that a hypergraph can be realized b","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Eyal Ackerman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T12:39:27Z","title":"Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08468","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:bf67771423328e1e39d7ebbdd2ba3637cba27e8397d045af3c802ab69f339e2e","target":"record","created_at":"2026-05-17T23:52:50Z","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":"e50ca7e846741a5ed1cd17545c0890b2099c25966b29c65388453942c628fb89","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-02-22T12:39:27Z","title_canon_sha256":"bbe2964b4ede221690136f769b514b877a5ef516e30ba6a898d91e072fdce54c"},"schema_version":"1.0","source":{"id":"1902.08468","kind":"arxiv","version":2}},"canonical_sha256":"79f7fecf4352c05c0e98a967d206a87d1e346c3c057b7cdd2b1692e463d486e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79f7fecf4352c05c0e98a967d206a87d1e346c3c057b7cdd2b1692e463d486e9","first_computed_at":"2026-05-17T23:52:50.678628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:50.678628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wcMiUjOI5tJcypYK9S+o6NOU+vsl6X6HyTOcqkq0xcnZ0+ZFsaRtx+L0REX65juJoOm+9TVGh/5f0v48ECW1Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:50.679264Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08468","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf67771423328e1e39d7ebbdd2ba3637cba27e8397d045af3c802ab69f339e2e","sha256:7f1a5d27d791db8761f16c8fb7c95985b94d9bd33866c20f64a26d7fbfdd0fa7"],"state_sha256":"d47d1634f63943980aed8f2a75593d8b73a0a46811faffbab69fa126efbd1b33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sF+z3+oRDVwipmSKoh7uouExeONTBH+DbIHbpQt9PM8VYJi2vgVsPvmL8f/IbuEEIy45K7GQjJtZSnuv5c0MAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:06:11.903732Z","bundle_sha256":"df3a9b95313a8ffd0cdff302268c3d7538932eba1e837bf751ba3183270bdcc2"}}