{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RJWBAY6E4GX7V23XBTVVCK6EBT","short_pith_number":"pith:RJWBAY6E","schema_version":"1.0","canonical_sha256":"8a6c1063c4e1affaeb770ceb512bc40ce176441e6716e4edc5b99bab4f3b5155","source":{"kind":"arxiv","id":"1107.0138","version":5},"attestation_state":"computed","paper":{"title":"On variants of conflict-free-coloring for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ze-Chun Hu, Zhen Cui","submitted_at":"2011-07-01T08:15:42Z","abstract_excerpt":"Conflict-free coloring is a kind of vertex coloring of hypergraphs requiring each hyperedge to have a color which appears only on one vertex. More generally, for a positive integer $k$ there are $k$-conflict-free colorings ($k$-CF-colorings for short) and $k$-strong-conflict-free colorings ($k$-SCF-colorings for short). %for some positive integer $k$. Let $H_n$ be the hypergraph of which the vertex-set is $V_n=\\{1,2,\\dots,n\\}$ and the hyperedge-set $\\cal{E}_n$ is the set of all (non-empty) subsets of $V_n$ consisting of consecutive elements of $V_n$. Firstly, we study the $k$-SCF-coloring of $"},"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":"1107.0138","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T08:15:42Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b36fe2d86dffc330db24ef5389d825759978264b96e77754bd6da8fe868b4f45","abstract_canon_sha256":"57611384bb90d3393694955cc294b4505b08098a43a1e1b97f695d7628e0c5be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:07.306418Z","signature_b64":"r+hzyojXr+YupF8HBQj6VWIWVaSYdyoyVSrC54chQGMmJCj6fyjKlanMJ1/9vSExvOzgrE9KiB97eNUi2C2GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a6c1063c4e1affaeb770ceb512bc40ce176441e6716e4edc5b99bab4f3b5155","last_reissued_at":"2026-05-18T02:44:07.305948Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:07.305948Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On variants of conflict-free-coloring for hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Ze-Chun Hu, Zhen Cui","submitted_at":"2011-07-01T08:15:42Z","abstract_excerpt":"Conflict-free coloring is a kind of vertex coloring of hypergraphs requiring each hyperedge to have a color which appears only on one vertex. More generally, for a positive integer $k$ there are $k$-conflict-free colorings ($k$-CF-colorings for short) and $k$-strong-conflict-free colorings ($k$-SCF-colorings for short). %for some positive integer $k$. Let $H_n$ be the hypergraph of which the vertex-set is $V_n=\\{1,2,\\dots,n\\}$ and the hyperedge-set $\\cal{E}_n$ is the set of all (non-empty) subsets of $V_n$ consisting of consecutive elements of $V_n$. Firstly, we study the $k$-SCF-coloring of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0138","kind":"arxiv","version":5},"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":"1107.0138","created_at":"2026-05-18T02:44:07.306022+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0138v5","created_at":"2026-05-18T02:44:07.306022+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0138","created_at":"2026-05-18T02:44:07.306022+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJWBAY6E4GX7","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJWBAY6E4GX7V23X","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJWBAY6E","created_at":"2026-05-18T12:26:41.206345+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/RJWBAY6E4GX7V23XBTVVCK6EBT","json":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT.json","graph_json":"https://pith.science/api/pith-number/RJWBAY6E4GX7V23XBTVVCK6EBT/graph.json","events_json":"https://pith.science/api/pith-number/RJWBAY6E4GX7V23XBTVVCK6EBT/events.json","paper":"https://pith.science/paper/RJWBAY6E"},"agent_actions":{"view_html":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT","download_json":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT.json","view_paper":"https://pith.science/paper/RJWBAY6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0138&json=true","fetch_graph":"https://pith.science/api/pith-number/RJWBAY6E4GX7V23XBTVVCK6EBT/graph.json","fetch_events":"https://pith.science/api/pith-number/RJWBAY6E4GX7V23XBTVVCK6EBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT/action/storage_attestation","attest_author":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT/action/author_attestation","sign_citation":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT/action/citation_signature","submit_replication":"https://pith.science/pith/RJWBAY6E4GX7V23XBTVVCK6EBT/action/replication_record"}},"created_at":"2026-05-18T02:44:07.306022+00:00","updated_at":"2026-05-18T02:44:07.306022+00:00"}