{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LWG4HSBRTFHYI2NWQLDXSJX66G","short_pith_number":"pith:LWG4HSBR","schema_version":"1.0","canonical_sha256":"5d8dc3c831994f8469b682c77926fef1b2bd288e0628c0d7c66af4104611fb50","source":{"kind":"arxiv","id":"1210.7269","version":2},"attestation_state":"computed","paper":{"title":"The star and biclique coloring and choosability problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francisco J. Soulignac, Marina Groshaus, Pablo Terlisky","submitted_at":"2012-10-26T23:12:08Z","abstract_excerpt":"A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G that contains no monochromatic maximal stars (bicliques). Similarly, for a list assignment L of G, a star (biclique) L-coloring is an L-coloring of G in which no maximal star (biclique) is monochromatic. If G admits a star (biclique) L-coloring for every k-list assignment L, then G is said to be star (biclique) k-choosable. In this article we study the computational complexity of the star and biclique "},"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":"1210.7269","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-10-26T23:12:08Z","cross_cats_sorted":[],"title_canon_sha256":"189dabbc39d1afc0124d79f1001bd05245af6fdada0f55bad3932bfb69dd0d90","abstract_canon_sha256":"e7e5f81e056df2156bfa23292982caee7b23ad30c6795cd2abcdb463e0ae5ebc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:12.795887Z","signature_b64":"mD2B3ziU+zgV5EqXi1Z4YYNDubtvm0RGpriyp2b0mFCacFiPOJBGdL5jNulHgVrQhQNLj4OckQg5kUWhVToqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d8dc3c831994f8469b682c77926fef1b2bd288e0628c0d7c66af4104611fb50","last_reissued_at":"2026-05-18T02:45:12.795150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:12.795150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The star and biclique coloring and choosability problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francisco J. Soulignac, Marina Groshaus, Pablo Terlisky","submitted_at":"2012-10-26T23:12:08Z","abstract_excerpt":"A biclique of a graph G is an induced complete bipartite graph. A star of G is a biclique contained in the closed neighborhood of a vertex. A star (biclique) k-coloring of G is a k-coloring of G that contains no monochromatic maximal stars (bicliques). Similarly, for a list assignment L of G, a star (biclique) L-coloring is an L-coloring of G in which no maximal star (biclique) is monochromatic. If G admits a star (biclique) L-coloring for every k-list assignment L, then G is said to be star (biclique) k-choosable. In this article we study the computational complexity of the star and biclique "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7269","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":"1210.7269","created_at":"2026-05-18T02:45:12.795278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7269v2","created_at":"2026-05-18T02:45:12.795278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7269","created_at":"2026-05-18T02:45:12.795278+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWG4HSBRTFHY","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWG4HSBRTFHYI2NW","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWG4HSBR","created_at":"2026-05-18T12:27:14.488303+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/LWG4HSBRTFHYI2NWQLDXSJX66G","json":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G.json","graph_json":"https://pith.science/api/pith-number/LWG4HSBRTFHYI2NWQLDXSJX66G/graph.json","events_json":"https://pith.science/api/pith-number/LWG4HSBRTFHYI2NWQLDXSJX66G/events.json","paper":"https://pith.science/paper/LWG4HSBR"},"agent_actions":{"view_html":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G","download_json":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G.json","view_paper":"https://pith.science/paper/LWG4HSBR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7269&json=true","fetch_graph":"https://pith.science/api/pith-number/LWG4HSBRTFHYI2NWQLDXSJX66G/graph.json","fetch_events":"https://pith.science/api/pith-number/LWG4HSBRTFHYI2NWQLDXSJX66G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G/action/storage_attestation","attest_author":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G/action/author_attestation","sign_citation":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G/action/citation_signature","submit_replication":"https://pith.science/pith/LWG4HSBRTFHYI2NWQLDXSJX66G/action/replication_record"}},"created_at":"2026-05-18T02:45:12.795278+00:00","updated_at":"2026-05-18T02:45:12.795278+00:00"}