{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:4IJPSNVOUV2H4H7PVOQRVQIDNL","short_pith_number":"pith:4IJPSNVO","canonical_record":{"source":{"id":"2409.12672","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T11:32:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1861224d35b0613fc45faab2846fae96e936272a26a87d887719a43c7fe1b7b","abstract_canon_sha256":"70b7909138b09b597ed29958e020483177b3adf8376659db4cfc3c49a509477d"},"schema_version":"1.0"},"canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","source":{"kind":"arxiv","id":"2409.12672","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12672","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12672v4","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12672","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"4IJPSNVOUV2H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4IJPSNVOUV2H4H7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4IJPSNVO","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:4IJPSNVOUV2H4H7PVOQRVQIDNL","target":"record","payload":{"canonical_record":{"source":{"id":"2409.12672","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T11:32:28Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c1861224d35b0613fc45faab2846fae96e936272a26a87d887719a43c7fe1b7b","abstract_canon_sha256":"70b7909138b09b597ed29958e020483177b3adf8376659db4cfc3c49a509477d"},"schema_version":"1.0"},"canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.537651Z","signature_b64":"yqIPvySqfvf+F9rN13IrCNe3PQxFyAN7fOEUARx+XF0na5JrmWl7KqAQOkVKiU4JjwEG3m09mx+6JAYT/I6cCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","last_reissued_at":"2026-05-18T03:09:46.536678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.536678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.12672","source_version":4,"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:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbKSJKgAGMVzYBt60WqUmOuCMyVzqY9rD6oTYo6XqFz++jmKGYt28yDRbV40r+thdELxvCPLLR6qICItqAThAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:47.639419Z"},"content_sha256":"bb21475695c7804334c289c5d12ee6a98c5f6028ee250ea8c8a53da29af8ecb7","schema_version":"1.0","event_id":"sha256:bb21475695c7804334c289c5d12ee6a98c5f6028ee250ea8c8a53da29af8ecb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:4IJPSNVOUV2H4H7PVOQRVQIDNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds and Hardness Results for Conflict-free Choosability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Rogers Mathew, Shiwali Gupta","submitted_at":"2024-09-19T11:32:28Z","abstract_excerpt":"A '(partial) conflict-free coloring' of a hypergraph $\\mathcal{H}$ is an assignment of colors to (a subset of) the vertex set of $\\mathcal{H}$ such that every hyperedge in $\\mathcal{H}$ has a vertex whose color is distinct from every other vertex in that hyperedge. The minimum number of colors required for such a coloring is known as the '(partial) conflict-free chromatic number' of $\\mathcal{H}$. It is easy to see that the conflict-free chromatic number of a hypergraph is at most its partial conflict-free chromatic number plus one. Conflict-free coloring has also been studied on the open/clos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12672","kind":"arxiv","version":4},"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:09:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S2DkgxnKMY7w9W0deeioUcy//LjjPiLFf9Gsp3UCLud9/KKQwkhwTLcQL7agE70qKIRMf+FmR2OUZS2TkNejDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:01:47.640096Z"},"content_sha256":"3fd6d7657b2bfb781acc0fc1e4f752689290d7c18cb29473d47e1efe69119387","schema_version":"1.0","event_id":"sha256:3fd6d7657b2bfb781acc0fc1e4f752689290d7c18cb29473d47e1efe69119387"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/bundle.json","state_url":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/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-30T09:01:47Z","links":{"resolver":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL","bundle":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/bundle.json","state":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:4IJPSNVOUV2H4H7PVOQRVQIDNL","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":"70b7909138b09b597ed29958e020483177b3adf8376659db4cfc3c49a509477d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T11:32:28Z","title_canon_sha256":"c1861224d35b0613fc45faab2846fae96e936272a26a87d887719a43c7fe1b7b"},"schema_version":"1.0","source":{"id":"2409.12672","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.12672","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.12672v4","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12672","created_at":"2026-05-18T03:09:46Z"},{"alias_kind":"pith_short_12","alias_value":"4IJPSNVOUV2H","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"4IJPSNVOUV2H4H7P","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"4IJPSNVO","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3fd6d7657b2bfb781acc0fc1e4f752689290d7c18cb29473d47e1efe69119387","target":"graph","created_at":"2026-05-18T03:09:46Z","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":"A '(partial) conflict-free coloring' of a hypergraph $\\mathcal{H}$ is an assignment of colors to (a subset of) the vertex set of $\\mathcal{H}$ such that every hyperedge in $\\mathcal{H}$ has a vertex whose color is distinct from every other vertex in that hyperedge. The minimum number of colors required for such a coloring is known as the '(partial) conflict-free chromatic number' of $\\mathcal{H}$. It is easy to see that the conflict-free chromatic number of a hypergraph is at most its partial conflict-free chromatic number plus one. Conflict-free coloring has also been studied on the open/clos","authors_text":"Rogers Mathew, Shiwali Gupta","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T11:32:28Z","title":"Bounds and Hardness Results for Conflict-free Choosability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.12672","kind":"arxiv","version":4},"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:bb21475695c7804334c289c5d12ee6a98c5f6028ee250ea8c8a53da29af8ecb7","target":"record","created_at":"2026-05-18T03:09:46Z","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":"70b7909138b09b597ed29958e020483177b3adf8376659db4cfc3c49a509477d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-09-19T11:32:28Z","title_canon_sha256":"c1861224d35b0613fc45faab2846fae96e936272a26a87d887719a43c7fe1b7b"},"schema_version":"1.0","source":{"id":"2409.12672","kind":"arxiv","version":4}},"canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","first_computed_at":"2026-05-18T03:09:46.536678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:46.536678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yqIPvySqfvf+F9rN13IrCNe3PQxFyAN7fOEUARx+XF0na5JrmWl7KqAQOkVKiU4JjwEG3m09mx+6JAYT/I6cCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:46.537651Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.12672","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb21475695c7804334c289c5d12ee6a98c5f6028ee250ea8c8a53da29af8ecb7","sha256:3fd6d7657b2bfb781acc0fc1e4f752689290d7c18cb29473d47e1efe69119387"],"state_sha256":"13cb8c73c9d6bc7160328a11c7458c6a166e2adbea7636e080645f619241b157"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xQ9oIKClbpEJ0cVlOsSb9PXVECyhfyFTMiqcETPMmvCkOR42Za0V0/u2I8oumcCDkjKFcxRG+eHyj9r0UHxYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:01:47.643617Z","bundle_sha256":"c0c366b76fb57a14bf0a3b2d427d866f3f92393a455fb649b123de7cbed18c3a"}}