{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JWIFMOBENWBMHRX2PWK36ZE24Y","short_pith_number":"pith:JWIFMOBE","schema_version":"1.0","canonical_sha256":"4d905638246d82c3c6fa7d95bf649ae613e990249ef8b5a9190a34bb9fc61fe6","source":{"kind":"arxiv","id":"1111.5501","version":2},"attestation_state":"computed","paper":{"title":"Conflict-free coloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'abor Tardos, Roman Glebov, Tibor Szab\\'o","submitted_at":"2011-11-23T14:25:30Z","abstract_excerpt":"We study the conflict-free chromatic number chi_{CF} of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized. In relation to this we study the evolution of the conflict-free chromatic number of the Erd\\H{o}s-R\\'enyi random graph G(n,p) and give the asymptotics for p=omega(1/n). We also show that for p \\geq 1/2 the conflict-free chromatic number differs from the domination number by at most 3."},"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":"1111.5501","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-23T14:25:30Z","cross_cats_sorted":[],"title_canon_sha256":"910b26d64898397554733f6395e28f4832bbe0d02bf9603c38a4f682bdd6b957","abstract_canon_sha256":"611e4dbc69398e346c6250a08dfec0c788daa44ee9f753ee251850761f433ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:48.661136Z","signature_b64":"lvuCy8EXHAVoxxxqceiFuIrEvAwsEDrTDewTyqpSSY+NdbHyur3NuRF/aoCioohrX6wDoDANkYePN1zf8uxbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d905638246d82c3c6fa7d95bf649ae613e990249ef8b5a9190a34bb9fc61fe6","last_reissued_at":"2026-05-18T03:12:48.660167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:48.660167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conflict-free coloring of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G\\'abor Tardos, Roman Glebov, Tibor Szab\\'o","submitted_at":"2011-11-23T14:25:30Z","abstract_excerpt":"We study the conflict-free chromatic number chi_{CF} of graphs from extremal and probabilistic point of view. We resolve a question of Pach and Tardos about the maximum conflict-free chromatic number an n-vertex graph can have. Our construction is randomized. In relation to this we study the evolution of the conflict-free chromatic number of the Erd\\H{o}s-R\\'enyi random graph G(n,p) and give the asymptotics for p=omega(1/n). We also show that for p \\geq 1/2 the conflict-free chromatic number differs from the domination number by at most 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.5501","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.5501","created_at":"2026-05-18T03:12:48.660347+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.5501v2","created_at":"2026-05-18T03:12:48.660347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.5501","created_at":"2026-05-18T03:12:48.660347+00:00"},{"alias_kind":"pith_short_12","alias_value":"JWIFMOBENWBM","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JWIFMOBENWBMHRX2","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JWIFMOBE","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y","json":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y.json","graph_json":"https://pith.science/api/pith-number/JWIFMOBENWBMHRX2PWK36ZE24Y/graph.json","events_json":"https://pith.science/api/pith-number/JWIFMOBENWBMHRX2PWK36ZE24Y/events.json","paper":"https://pith.science/paper/JWIFMOBE"},"agent_actions":{"view_html":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y","download_json":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y.json","view_paper":"https://pith.science/paper/JWIFMOBE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.5501&json=true","fetch_graph":"https://pith.science/api/pith-number/JWIFMOBENWBMHRX2PWK36ZE24Y/graph.json","fetch_events":"https://pith.science/api/pith-number/JWIFMOBENWBMHRX2PWK36ZE24Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y/action/storage_attestation","attest_author":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y/action/author_attestation","sign_citation":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y/action/citation_signature","submit_replication":"https://pith.science/pith/JWIFMOBENWBMHRX2PWK36ZE24Y/action/replication_record"}},"created_at":"2026-05-18T03:12:48.660347+00:00","updated_at":"2026-05-18T03:12:48.660347+00:00"}