{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4IJPSNVOUV2H4H7PVOQRVQIDNL","short_pith_number":"pith:4IJPSNVO","schema_version":"1.0","canonical_sha256":"e212f936aea5747e1fefaba11ac1036afcd6b0a44d3bae82b313ab2567bac72f","source":{"kind":"arxiv","id":"2409.12672","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.12672","created_at":"2026-05-18T03:09:46.536825+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.12672v4","created_at":"2026-05-18T03:09:46.536825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.12672","created_at":"2026-05-18T03:09:46.536825+00:00"},{"alias_kind":"pith_short_12","alias_value":"4IJPSNVOUV2H","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"4IJPSNVOUV2H4H7P","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"4IJPSNVO","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.22357","citing_title":"Asymptotically Tight Bound for the Conflict-Free Chromatic Index","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL","json":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL.json","graph_json":"https://pith.science/api/pith-number/4IJPSNVOUV2H4H7PVOQRVQIDNL/graph.json","events_json":"https://pith.science/api/pith-number/4IJPSNVOUV2H4H7PVOQRVQIDNL/events.json","paper":"https://pith.science/paper/4IJPSNVO"},"agent_actions":{"view_html":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL","download_json":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL.json","view_paper":"https://pith.science/paper/4IJPSNVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.12672&json=true","fetch_graph":"https://pith.science/api/pith-number/4IJPSNVOUV2H4H7PVOQRVQIDNL/graph.json","fetch_events":"https://pith.science/api/pith-number/4IJPSNVOUV2H4H7PVOQRVQIDNL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/action/storage_attestation","attest_author":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/action/author_attestation","sign_citation":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/action/citation_signature","submit_replication":"https://pith.science/pith/4IJPSNVOUV2H4H7PVOQRVQIDNL/action/replication_record"}},"created_at":"2026-05-18T03:09:46.536825+00:00","updated_at":"2026-05-18T03:09:46.536825+00:00"}