{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AEMQLDNZTQMN3HR4PUBSCVVTNW","short_pith_number":"pith:AEMQLDNZ","schema_version":"1.0","canonical_sha256":"0119058db99c18dd9e3c7d032156b36d91557e1fea91cb7d68d666efaf4028b1","source":{"kind":"arxiv","id":"1203.2543","version":2},"attestation_state":"computed","paper":{"title":"Biclique-colouring verification complexity and biclique-colouring power graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, H\\'elio B. Mac\\^edo Filho, Raphael C. S. Machado, Simone Dantas","submitted_at":"2012-03-12T16:45:21Z","abstract_excerpt":"Biclique-colouring is a colouring of the vertices of a graph in such a way that no maximal complete bipartite subgraph with at least one edge is monochromatic. We show that it is coNP-complete to check whether a given function that associates a colour to each vertex is a biclique-colouring, a result that justifies the search for structured classes where the biclique-colouring problem could be efficiently solved. We consider biclique-colouring restricted to powers of paths and powers of cycles. We determine the biclique-chromatic number of powers of paths and powers of cycles. The biclique-chro"},"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":"1203.2543","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-03-12T16:45:21Z","cross_cats_sorted":[],"title_canon_sha256":"9286f604110bd87f62b46450b435e437d15edc86db7a8a8c041326ce43716121","abstract_canon_sha256":"43b05ca47fc6cbaa2bf9a11829e148f0e631da7a98574c39e4e7a6afa9913406"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:16.385213Z","signature_b64":"1wsQOWsQ8w58UfGSczwtmns528bS+uli8T9GS7RJysoiTgg7QUUxcQFYd9PAelkR81g3fg3RbOxktzvgRYNnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0119058db99c18dd9e3c7d032156b36d91557e1fea91cb7d68d666efaf4028b1","last_reissued_at":"2026-05-18T03:29:16.384559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:16.384559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biclique-colouring verification complexity and biclique-colouring power graphs","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Celina M. H. de Figueiredo, H\\'elio B. Mac\\^edo Filho, Raphael C. S. Machado, Simone Dantas","submitted_at":"2012-03-12T16:45:21Z","abstract_excerpt":"Biclique-colouring is a colouring of the vertices of a graph in such a way that no maximal complete bipartite subgraph with at least one edge is monochromatic. We show that it is coNP-complete to check whether a given function that associates a colour to each vertex is a biclique-colouring, a result that justifies the search for structured classes where the biclique-colouring problem could be efficiently solved. We consider biclique-colouring restricted to powers of paths and powers of cycles. We determine the biclique-chromatic number of powers of paths and powers of cycles. The biclique-chro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2543","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":"1203.2543","created_at":"2026-05-18T03:29:16.384673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2543v2","created_at":"2026-05-18T03:29:16.384673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2543","created_at":"2026-05-18T03:29:16.384673+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEMQLDNZTQMN","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEMQLDNZTQMN3HR4","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEMQLDNZ","created_at":"2026-05-18T12:26:58.693483+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/AEMQLDNZTQMN3HR4PUBSCVVTNW","json":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW.json","graph_json":"https://pith.science/api/pith-number/AEMQLDNZTQMN3HR4PUBSCVVTNW/graph.json","events_json":"https://pith.science/api/pith-number/AEMQLDNZTQMN3HR4PUBSCVVTNW/events.json","paper":"https://pith.science/paper/AEMQLDNZ"},"agent_actions":{"view_html":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW","download_json":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW.json","view_paper":"https://pith.science/paper/AEMQLDNZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2543&json=true","fetch_graph":"https://pith.science/api/pith-number/AEMQLDNZTQMN3HR4PUBSCVVTNW/graph.json","fetch_events":"https://pith.science/api/pith-number/AEMQLDNZTQMN3HR4PUBSCVVTNW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW/action/storage_attestation","attest_author":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW/action/author_attestation","sign_citation":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW/action/citation_signature","submit_replication":"https://pith.science/pith/AEMQLDNZTQMN3HR4PUBSCVVTNW/action/replication_record"}},"created_at":"2026-05-18T03:29:16.384673+00:00","updated_at":"2026-05-18T03:29:16.384673+00:00"}