{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YOWAXHAFWRGCTKWIGOHY45HSQH","short_pith_number":"pith:YOWAXHAF","schema_version":"1.0","canonical_sha256":"c3ac0b9c05b44c29aac8338f8e74f281e145e4a5bb0ceaae3f803df5eeddcd5b","source":{"kind":"arxiv","id":"1306.1656","version":1},"attestation_state":"computed","paper":{"title":"Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hsiang-Hsuan Liu, Sheung-Hung Poon, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2013-06-07T08:59:26Z","abstract_excerpt":"We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty} \\alpha(G^k)/n^k. The ultimate categorical independence ratio is polynomial for cographs, permutation graphs, interval graphs, graphs of bounded treewidth and splitgraphs. When G is a planar graph of maximal degree three then alpha(G \\times K_4) is NP-complete. We present a PTAS for the ultimate categorical independence ratio of planar graphs. We present an O"},"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":"1306.1656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-06-07T08:59:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dce1abe508667e57c41958276635b945dcc9b7a5e66aa98460a5513111abfc1a","abstract_canon_sha256":"ca55d69ba0b05c810efb365e588fcf6b4d287e2f21cc2d6fa3db0f9a7ada3e7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:32.774955Z","signature_b64":"mAJwLFPvA+pqzPi4bpZxilxmhlMHqGUgKj2PcxTvVVi41ZAlCAVnBsj/y5or4t8KT3WB9y2J+YMso7Hj0mLrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3ac0b9c05b44c29aac8338f8e74f281e145e4a5bb0ceaae3f803df5eeddcd5b","last_reissued_at":"2026-05-18T03:21:32.774181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:32.774181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Results on independent sets in categorical products of graphs, the ultimate categorical independence ratio and the ultimate categorical independent domination ratio","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hsiang-Hsuan Liu, Sheung-Hung Poon, Ton Kloks, Wing-Kai Hon, Yue-Li Wang","submitted_at":"2013-06-07T08:59:26Z","abstract_excerpt":"We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. The ultimate categorical independence ratio of a graph G is defined as lim_{k --> infty} \\alpha(G^k)/n^k. The ultimate categorical independence ratio is polynomial for cographs, permutation graphs, interval graphs, graphs of bounded treewidth and splitgraphs. When G is a planar graph of maximal degree three then alpha(G \\times K_4) is NP-complete. We present a PTAS for the ultimate categorical independence ratio of planar graphs. We present an O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1656","kind":"arxiv","version":1},"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":"1306.1656","created_at":"2026-05-18T03:21:32.774304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1656v1","created_at":"2026-05-18T03:21:32.774304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1656","created_at":"2026-05-18T03:21:32.774304+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOWAXHAFWRGC","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOWAXHAFWRGCTKWI","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOWAXHAF","created_at":"2026-05-18T12:28:09.283467+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/YOWAXHAFWRGCTKWIGOHY45HSQH","json":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH.json","graph_json":"https://pith.science/api/pith-number/YOWAXHAFWRGCTKWIGOHY45HSQH/graph.json","events_json":"https://pith.science/api/pith-number/YOWAXHAFWRGCTKWIGOHY45HSQH/events.json","paper":"https://pith.science/paper/YOWAXHAF"},"agent_actions":{"view_html":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH","download_json":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH.json","view_paper":"https://pith.science/paper/YOWAXHAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1656&json=true","fetch_graph":"https://pith.science/api/pith-number/YOWAXHAFWRGCTKWIGOHY45HSQH/graph.json","fetch_events":"https://pith.science/api/pith-number/YOWAXHAFWRGCTKWIGOHY45HSQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH/action/storage_attestation","attest_author":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH/action/author_attestation","sign_citation":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH/action/citation_signature","submit_replication":"https://pith.science/pith/YOWAXHAFWRGCTKWIGOHY45HSQH/action/replication_record"}},"created_at":"2026-05-18T03:21:32.774304+00:00","updated_at":"2026-05-18T03:21:32.774304+00:00"}