{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RK2GTROVJSE35NBSOXMLO2ESSS","short_pith_number":"pith:RK2GTROV","schema_version":"1.0","canonical_sha256":"8ab469c5d54c89beb43275d8b7689294bab164df29e38c4084ebd091bcc9c375","source":{"kind":"arxiv","id":"1206.5082","version":2},"attestation_state":"computed","paper":{"title":"Independent sets in edge-clique graphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ching-Hao Liu, Sheung-Hung Poon, Ton Kloks","submitted_at":"2012-06-22T08:30:24Z","abstract_excerpt":"We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs. We show that the independent set problem on edge-clique graphs of graphs without odd wheels remains NP-complete. We present a PTAS for planar graphs and show that the problem is polynomial for planar graphs without triangle separators."},"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":"1206.5082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-22T08:30:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"709c717c54e9252b36d77255ec9086778a077b571360e17bed84fca900efbbf1","abstract_canon_sha256":"22498bd2c73668b2b4593edc028c2aa409d3514ed9c0ba20bed2a785e352a9f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:32.463929Z","signature_b64":"GGC7fDYzSP8fo6pgEy8kuhjDinpz91HR1jiSqQB8z7jHhhtmoWy+1YlkMEnLxtcK9GVqmnBm68yj3woPYqfNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ab469c5d54c89beb43275d8b7689294bab164df29e38c4084ebd091bcc9c375","last_reissued_at":"2026-05-18T03:26:32.463288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:32.463288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Independent sets in edge-clique graphs II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ching-Hao Liu, Sheung-Hung Poon, Ton Kloks","submitted_at":"2012-06-22T08:30:24Z","abstract_excerpt":"We show that edge-clique graphs of cocktail party graphs have unbounded rankwidth. This, and other observations lead us to conjecture that the edge-clique cover problem is NP-complete for cographs. We show that the independent set problem on edge-clique graphs of cographs. We show that the independent set problem on edge-clique graphs of graphs without odd wheels remains NP-complete. We present a PTAS for planar graphs and show that the problem is polynomial for planar graphs without triangle separators."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5082","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":"1206.5082","created_at":"2026-05-18T03:26:32.463389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5082v2","created_at":"2026-05-18T03:26:32.463389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5082","created_at":"2026-05-18T03:26:32.463389+00:00"},{"alias_kind":"pith_short_12","alias_value":"RK2GTROVJSE3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RK2GTROVJSE35NBS","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RK2GTROV","created_at":"2026-05-18T12:27:20.899486+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/RK2GTROVJSE35NBSOXMLO2ESSS","json":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS.json","graph_json":"https://pith.science/api/pith-number/RK2GTROVJSE35NBSOXMLO2ESSS/graph.json","events_json":"https://pith.science/api/pith-number/RK2GTROVJSE35NBSOXMLO2ESSS/events.json","paper":"https://pith.science/paper/RK2GTROV"},"agent_actions":{"view_html":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS","download_json":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS.json","view_paper":"https://pith.science/paper/RK2GTROV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5082&json=true","fetch_graph":"https://pith.science/api/pith-number/RK2GTROVJSE35NBSOXMLO2ESSS/graph.json","fetch_events":"https://pith.science/api/pith-number/RK2GTROVJSE35NBSOXMLO2ESSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS/action/storage_attestation","attest_author":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS/action/author_attestation","sign_citation":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS/action/citation_signature","submit_replication":"https://pith.science/pith/RK2GTROVJSE35NBSOXMLO2ESSS/action/replication_record"}},"created_at":"2026-05-18T03:26:32.463389+00:00","updated_at":"2026-05-18T03:26:32.463389+00:00"}