{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:QFSHETZ2HQIJPAWRB7DXA2WZPE","short_pith_number":"pith:QFSHETZ2","canonical_record":{"source":{"id":"1002.4210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-22T22:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"62160eb363ea8132d7236c6409d347dfc61d6f85ed51a71070cbb012b63e9bc1","abstract_canon_sha256":"8fca0b19d617ad2ca9021881e348f31da350247dbcccd6eecabc0234fe8fefb3"},"schema_version":"1.0"},"canonical_sha256":"8164724f3a3c109782d10fc7706ad97921987dc58cfbe260ca31da90b859895c","source":{"kind":"arxiv","id":"1002.4210","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4210","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4210v3","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4210","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"QFSHETZ2HQIJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFSHETZ2HQIJPAWR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFSHETZ2","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:QFSHETZ2HQIJPAWRB7DXA2WZPE","target":"record","payload":{"canonical_record":{"source":{"id":"1002.4210","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-22T22:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"62160eb363ea8132d7236c6409d347dfc61d6f85ed51a71070cbb012b63e9bc1","abstract_canon_sha256":"8fca0b19d617ad2ca9021881e348f31da350247dbcccd6eecabc0234fe8fefb3"},"schema_version":"1.0"},"canonical_sha256":"8164724f3a3c109782d10fc7706ad97921987dc58cfbe260ca31da90b859895c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:55.014766Z","signature_b64":"XlQITqwuqTTz7WYWfNkH54pIvCD4Fu1fEYfQN5ej3Hllpz2MtNNm65tsCg5Bm5mFhMzI1IKdC+9aT2k+JlSkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8164724f3a3c109782d10fc7706ad97921987dc58cfbe260ca31da90b859895c","last_reissued_at":"2026-05-18T03:53:55.014250Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:55.014250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1002.4210","source_version":3,"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-18T03:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8XM5JAlHTf/nQ9R3qdQX4nOQvq3Og/NKcltdAXgGd09uwyRJuuAP7Sm+aF0UVlIgpYDhkG/40pOy38dliXtSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:16:16.550421Z"},"content_sha256":"b1908fd1b15c599364d4a72716a6bbd7469c130528a4a8cc954d1baf8c6fc2dc","schema_version":"1.0","event_id":"sha256:b1908fd1b15c599364d4a72716a6bbd7469c130528a4a8cc954d1baf8c6fc2dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:QFSHETZ2HQIJPAWRB7DXA2WZPE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unique-maximum and conflict-free colorings for hypergraphs and tree graphs","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, Panagiotis Cheilaris","submitted_at":"2010-02-22T22:08:20Z","abstract_excerpt":"We investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color appears only once. In a conflict-free coloring, in every hyperedge of the hypergraph there is a color that appears only once. We define corresponding unique-maximum and conflict-free chromatic numbers and investigate their relationship in arbitrary hypergraphs. Then, we concentrate on hypergraphs that are induced by simple paths in tree graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4210","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":""},"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-18T03:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KLgqU49P2Dg23AQbuHHUGTmpvP6qG0QaNRMBWwdSPrw58jyUL+xTidho5GbVgJa614xHAX6eLj7B3a6sGNCBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:16:16.550784Z"},"content_sha256":"dfbdba99069155757de46688c91d65f6440f3c576eb83d9ed7d0bce102a3d5a1","schema_version":"1.0","event_id":"sha256:dfbdba99069155757de46688c91d65f6440f3c576eb83d9ed7d0bce102a3d5a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/bundle.json","state_url":"https://pith.science/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/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-21T15:16:16Z","links":{"resolver":"https://pith.science/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE","bundle":"https://pith.science/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/bundle.json","state":"https://pith.science/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFSHETZ2HQIJPAWRB7DXA2WZPE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QFSHETZ2HQIJPAWRB7DXA2WZPE","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":"8fca0b19d617ad2ca9021881e348f31da350247dbcccd6eecabc0234fe8fefb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-22T22:08:20Z","title_canon_sha256":"62160eb363ea8132d7236c6409d347dfc61d6f85ed51a71070cbb012b63e9bc1"},"schema_version":"1.0","source":{"id":"1002.4210","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1002.4210","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1002.4210v3","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.4210","created_at":"2026-05-18T03:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"QFSHETZ2HQIJ","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"QFSHETZ2HQIJPAWR","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"QFSHETZ2","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:dfbdba99069155757de46688c91d65f6440f3c576eb83d9ed7d0bce102a3d5a1","target":"graph","created_at":"2026-05-18T03:53:55Z","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 investigate the relationship between two kinds of vertex colorings of hypergraphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every hyperedge of the hypergraph the maximum color appears only once. In a conflict-free coloring, in every hyperedge of the hypergraph there is a color that appears only once. We define corresponding unique-maximum and conflict-free chromatic numbers and investigate their relationship in arbitrary hypergraphs. Then, we concentrate on hypergraphs that are induced by simple paths in tree graphs.","authors_text":"Bal\\'azs Keszegh, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, Panagiotis Cheilaris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-22T22:08:20Z","title":"Unique-maximum and conflict-free colorings for hypergraphs and tree graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.4210","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:b1908fd1b15c599364d4a72716a6bbd7469c130528a4a8cc954d1baf8c6fc2dc","target":"record","created_at":"2026-05-18T03:53:55Z","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":"8fca0b19d617ad2ca9021881e348f31da350247dbcccd6eecabc0234fe8fefb3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-02-22T22:08:20Z","title_canon_sha256":"62160eb363ea8132d7236c6409d347dfc61d6f85ed51a71070cbb012b63e9bc1"},"schema_version":"1.0","source":{"id":"1002.4210","kind":"arxiv","version":3}},"canonical_sha256":"8164724f3a3c109782d10fc7706ad97921987dc58cfbe260ca31da90b859895c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8164724f3a3c109782d10fc7706ad97921987dc58cfbe260ca31da90b859895c","first_computed_at":"2026-05-18T03:53:55.014250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:55.014250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XlQITqwuqTTz7WYWfNkH54pIvCD4Fu1fEYfQN5ej3Hllpz2MtNNm65tsCg5Bm5mFhMzI1IKdC+9aT2k+JlSkBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:55.014766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1002.4210","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b1908fd1b15c599364d4a72716a6bbd7469c130528a4a8cc954d1baf8c6fc2dc","sha256:dfbdba99069155757de46688c91d65f6440f3c576eb83d9ed7d0bce102a3d5a1"],"state_sha256":"4dbacf3027d4c9169a5b97681203e60080220047464d80dfb5206aa37b63cfe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yhon1kVD8j5x0MjmElqfNnY+0AGlWTbobwcNwWtGQksQm8GnVsKhT4OVJkOqM/GMRfA0ADNs6JRAop2wXx0PDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:16:16.553529Z","bundle_sha256":"33b7eed5c4e22c87ab4c70358dc9346c47ddc406bd5e8549b210a2f6dbdd8bff"}}