{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JSIAMCEX6NDIO4LVSMX7BAMING","short_pith_number":"pith:JSIAMCEX","schema_version":"1.0","canonical_sha256":"4c90060897f346877175932ff0818869b0f7c461586dee64d57ceee3fbc93e00","source":{"kind":"arxiv","id":"1501.00343","version":4},"attestation_state":"computed","paper":{"title":"Bicoloring covers for graphs and hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sudebkumar Prasant Pal, Tapas Kumar Mishra","submitted_at":"2015-01-02T04:11:11Z","abstract_excerpt":"Let the {\\it bicoloring cover number $\\chi^c(G)$} for a hypergraph $G(V,E)$ be the minimum number of bicolorings of vertices of $G$ such that every hyperedge $e\\in E$ of $G$ is properly bicolored in at least one of the $\\chi^c(G)$ bicolorings. We investigate the relationship between $\\chi^c(G)$, matchings, hitting sets, $\\alpha(G)$(independence number) and $\\chi(G)$ (chromatic number). We design a factor $O(\\frac{\\log n}{\\log \\log n-\\log \\log \\log n})$ approximation algorithm for computing a bicoloring cover. We define a new parameter for hypergraphs - \"cover independence number $\\gamma(G)$\" a"},"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":"1501.00343","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2015-01-02T04:11:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bf1ca4359e81168845e5ff9077a8a46bbcd3660e74f7c2eb9a56adef52d9fb8a","abstract_canon_sha256":"5f4f7f6fe59c8f1b1fccdd59d696b8ac6aa4386d8013a192fb281a8ff5e0d482"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.436854Z","signature_b64":"4fznLTncaW6x8Bpoxu3+zEpX0bXgKaAFmfK/DmuXblEjnYm4/T6IEbNag4daBWSqYMcDFN46Gn3YO8+W2HH5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c90060897f346877175932ff0818869b0f7c461586dee64d57ceee3fbc93e00","last_reissued_at":"2026-05-18T01:19:35.436480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.436480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bicoloring covers for graphs and hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Sudebkumar Prasant Pal, Tapas Kumar Mishra","submitted_at":"2015-01-02T04:11:11Z","abstract_excerpt":"Let the {\\it bicoloring cover number $\\chi^c(G)$} for a hypergraph $G(V,E)$ be the minimum number of bicolorings of vertices of $G$ such that every hyperedge $e\\in E$ of $G$ is properly bicolored in at least one of the $\\chi^c(G)$ bicolorings. We investigate the relationship between $\\chi^c(G)$, matchings, hitting sets, $\\alpha(G)$(independence number) and $\\chi(G)$ (chromatic number). We design a factor $O(\\frac{\\log n}{\\log \\log n-\\log \\log \\log n})$ approximation algorithm for computing a bicoloring cover. We define a new parameter for hypergraphs - \"cover independence number $\\gamma(G)$\" a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00343","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":"1501.00343","created_at":"2026-05-18T01:19:35.436538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.00343v4","created_at":"2026-05-18T01:19:35.436538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00343","created_at":"2026-05-18T01:19:35.436538+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSIAMCEX6NDI","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSIAMCEX6NDIO4LV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSIAMCEX","created_at":"2026-05-18T12:29:27.538025+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/JSIAMCEX6NDIO4LVSMX7BAMING","json":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING.json","graph_json":"https://pith.science/api/pith-number/JSIAMCEX6NDIO4LVSMX7BAMING/graph.json","events_json":"https://pith.science/api/pith-number/JSIAMCEX6NDIO4LVSMX7BAMING/events.json","paper":"https://pith.science/paper/JSIAMCEX"},"agent_actions":{"view_html":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING","download_json":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING.json","view_paper":"https://pith.science/paper/JSIAMCEX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.00343&json=true","fetch_graph":"https://pith.science/api/pith-number/JSIAMCEX6NDIO4LVSMX7BAMING/graph.json","fetch_events":"https://pith.science/api/pith-number/JSIAMCEX6NDIO4LVSMX7BAMING/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING/action/storage_attestation","attest_author":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING/action/author_attestation","sign_citation":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING/action/citation_signature","submit_replication":"https://pith.science/pith/JSIAMCEX6NDIO4LVSMX7BAMING/action/replication_record"}},"created_at":"2026-05-18T01:19:35.436538+00:00","updated_at":"2026-05-18T01:19:35.436538+00:00"}