{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:NUGLAP4Z3SJV7IIYVC4YZUHA4G","short_pith_number":"pith:NUGLAP4Z","schema_version":"1.0","canonical_sha256":"6d0cb03f99dc935fa118a8b98cd0e0e18915b9e365505d4a9c2dd1344efd4d59","source":{"kind":"arxiv","id":"cs/0701185","version":3},"attestation_state":"computed","paper":{"title":"Graph Operations on Clique-Width Bounded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Frank Gurski","submitted_at":"2007-01-29T14:36:25Z","abstract_excerpt":"Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width and NLC-width under various graph operations and graph transformations. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs."},"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":"cs/0701185","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2007-01-29T14:36:25Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"246c0af04b570cc680aea8eaea11f029a011ff812cfb47a7b1f05e827ef0b1a1","abstract_canon_sha256":"217c78fb9ab2a9ea764344352945ec2eb42784b05f66f983e604360c927e1e8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:53.467863Z","signature_b64":"GlF2zXGEl3gS3lU38BEuCbr+LZBGsr6vWJp4PhC8JDczbZMRc+qX8Ez3u1WRWvFSgK2QxORdtOVjs1GDSHmADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d0cb03f99dc935fa118a8b98cd0e0e18915b9e365505d4a9c2dd1344efd4d59","last_reissued_at":"2026-05-18T01:12:53.467506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:53.467506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Operations on Clique-Width Bounded Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Frank Gurski","submitted_at":"2007-01-29T14:36:25Z","abstract_excerpt":"Clique-width is a well-known graph parameter. Many NP-hard graph problems admit polynomial-time solutions when restricted to graphs of bounded clique-width. The same holds for NLC-width. In this paper we study the behavior of clique-width and NLC-width under various graph operations and graph transformations. We give upper and lower bounds for the clique-width and NLC-width of the modified graphs in terms of the clique-width and NLC-width of the involved graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701185","kind":"arxiv","version":3},"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":"cs/0701185","created_at":"2026-05-18T01:12:53.467563+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0701185v3","created_at":"2026-05-18T01:12:53.467563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701185","created_at":"2026-05-18T01:12:53.467563+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUGLAP4Z3SJV","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUGLAP4Z3SJV7IIY","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUGLAP4Z","created_at":"2026-05-18T12:25:55.427421+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/NUGLAP4Z3SJV7IIYVC4YZUHA4G","json":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G.json","graph_json":"https://pith.science/api/pith-number/NUGLAP4Z3SJV7IIYVC4YZUHA4G/graph.json","events_json":"https://pith.science/api/pith-number/NUGLAP4Z3SJV7IIYVC4YZUHA4G/events.json","paper":"https://pith.science/paper/NUGLAP4Z"},"agent_actions":{"view_html":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G","download_json":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G.json","view_paper":"https://pith.science/paper/NUGLAP4Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0701185&json=true","fetch_graph":"https://pith.science/api/pith-number/NUGLAP4Z3SJV7IIYVC4YZUHA4G/graph.json","fetch_events":"https://pith.science/api/pith-number/NUGLAP4Z3SJV7IIYVC4YZUHA4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G/action/storage_attestation","attest_author":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G/action/author_attestation","sign_citation":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G/action/citation_signature","submit_replication":"https://pith.science/pith/NUGLAP4Z3SJV7IIYVC4YZUHA4G/action/replication_record"}},"created_at":"2026-05-18T01:12:53.467563+00:00","updated_at":"2026-05-18T01:12:53.467563+00:00"}