{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EGTX4EQJKCW3JGJNOLAHP6LKSO","short_pith_number":"pith:EGTX4EQJ","schema_version":"1.0","canonical_sha256":"21a77e120950adb4992d72c077f96a939c3b1fe487aabd66f0eb92d62b442197","source":{"kind":"arxiv","id":"1210.8365","version":1},"attestation_state":"computed","paper":{"title":"On the threshold-width of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"L. Hung, M. Chang, S. Peng, T. Kloks","submitted_at":"2012-10-30T01:50:29Z","abstract_excerpt":"The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-parameter algorithms. We also show that for each k, graphs of TH-width at most k are characterized by a finite collection of forbidden induced subgraphs."},"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.8365","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-30T01:50:29Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"558fd8151ba6c31e5a7c89a833ea1adfca1404b1c3cabf0f27e44e181b0eb1e0","abstract_canon_sha256":"ffb090bb7b100fcdb1ff152670233d7f0ed9a4b977c25d699496b51c4a519713"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:44.738621Z","signature_b64":"Qmp74xdp1qVZ+oUegkXpQPVCQ1o5rrvuJkjAAhRYrMH++KABXIiDY+CLr+0v5t4W7jP0SdQtyNDZXvjnM1hIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21a77e120950adb4992d72c077f96a939c3b1fe487aabd66f0eb92d62b442197","last_reissued_at":"2026-05-18T03:41:44.737763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:44.737763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the threshold-width of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"L. Hung, M. Chang, S. Peng, T. Kloks","submitted_at":"2012-10-30T01:50:29Z","abstract_excerpt":"The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G, there exists an i such that both endpoints of e are in Ni. For the class TH of threshold graphs we show that TH-width is NP-complete and we present fixed-parameter algorithms. We also show that for each k, graphs of TH-width at most k are characterized by a finite collection of forbidden induced subgraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.8365","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":"1210.8365","created_at":"2026-05-18T03:41:44.737902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.8365v1","created_at":"2026-05-18T03:41:44.737902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.8365","created_at":"2026-05-18T03:41:44.737902+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGTX4EQJKCW3","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGTX4EQJKCW3JGJN","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGTX4EQJ","created_at":"2026-05-18T12:27:04.183437+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/EGTX4EQJKCW3JGJNOLAHP6LKSO","json":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO.json","graph_json":"https://pith.science/api/pith-number/EGTX4EQJKCW3JGJNOLAHP6LKSO/graph.json","events_json":"https://pith.science/api/pith-number/EGTX4EQJKCW3JGJNOLAHP6LKSO/events.json","paper":"https://pith.science/paper/EGTX4EQJ"},"agent_actions":{"view_html":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO","download_json":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO.json","view_paper":"https://pith.science/paper/EGTX4EQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.8365&json=true","fetch_graph":"https://pith.science/api/pith-number/EGTX4EQJKCW3JGJNOLAHP6LKSO/graph.json","fetch_events":"https://pith.science/api/pith-number/EGTX4EQJKCW3JGJNOLAHP6LKSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO/action/storage_attestation","attest_author":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO/action/author_attestation","sign_citation":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO/action/citation_signature","submit_replication":"https://pith.science/pith/EGTX4EQJKCW3JGJNOLAHP6LKSO/action/replication_record"}},"created_at":"2026-05-18T03:41:44.737902+00:00","updated_at":"2026-05-18T03:41:44.737902+00:00"}