{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6A7HL74W4NIDKWC3U6T6VYP56H","short_pith_number":"pith:6A7HL74W","schema_version":"1.0","canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","source":{"kind":"arxiv","id":"1705.09177","version":2},"attestation_state":"computed","paper":{"title":"On the (parameterized) complexity of recognizing well-covered (r,l)-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Konrad K. Dabrowski, Luerbio Faria, Sancrey R. Alves, Sulamita Klein, U\\'everton S. Souza","submitted_at":"2017-05-25T13:47:33Z","abstract_excerpt":"An $(r, \\ell)$-partition of a graph $G$ is a partition of its vertex set into $r$ independent sets and $\\ell$ cliques. A graph is $(r, \\ell)$ if it admits an $(r, \\ell)$-partition. A graph is well-covered if every maximal independent set is also maximum. A graph is $(r,\\ell)$-well-covered if it is both $(r,\\ell)$ and well-covered. In this paper we consider two different decision problems. In the $(r,\\ell)$-Well-Covered Graph problem ($(r,\\ell)$WCG for short), we are given a graph $G$, and the question is whether $G$ is an $(r,\\ell)$-well-covered graph. In the Well-Covered $(r,\\ell)$-Graph prob"},"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":"1705.09177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-25T13:47:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d38ba6d9d14878e55fcaa3a92c0d7a4d155620f1c191f599d127a8b9e6ec9718","abstract_canon_sha256":"0aee17bedbc1b2e743021d39add3bdd2a76f4c6d5f5ece547a30127358b4f38e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:06.826324Z","signature_b64":"gVEBW9Z/rsVUc1h2AjNMhUsQ/kSB7JgKK8qFggzKz4x7YTrREUE/QwzmmlV5gSLi1OW5yiwyqf48zOaZNsB2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","last_reissued_at":"2026-05-18T00:14:06.825787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:06.825787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the (parameterized) complexity of recognizing well-covered (r,l)-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Konrad K. Dabrowski, Luerbio Faria, Sancrey R. Alves, Sulamita Klein, U\\'everton S. Souza","submitted_at":"2017-05-25T13:47:33Z","abstract_excerpt":"An $(r, \\ell)$-partition of a graph $G$ is a partition of its vertex set into $r$ independent sets and $\\ell$ cliques. A graph is $(r, \\ell)$ if it admits an $(r, \\ell)$-partition. A graph is well-covered if every maximal independent set is also maximum. A graph is $(r,\\ell)$-well-covered if it is both $(r,\\ell)$ and well-covered. In this paper we consider two different decision problems. In the $(r,\\ell)$-Well-Covered Graph problem ($(r,\\ell)$WCG for short), we are given a graph $G$, and the question is whether $G$ is an $(r,\\ell)$-well-covered graph. In the Well-Covered $(r,\\ell)$-Graph prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09177","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":"1705.09177","created_at":"2026-05-18T00:14:06.825871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09177v2","created_at":"2026-05-18T00:14:06.825871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09177","created_at":"2026-05-18T00:14:06.825871+00:00"},{"alias_kind":"pith_short_12","alias_value":"6A7HL74W4NID","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6A7HL74W4NIDKWC3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6A7HL74W","created_at":"2026-05-18T12:31:03.183658+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/6A7HL74W4NIDKWC3U6T6VYP56H","json":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H.json","graph_json":"https://pith.science/api/pith-number/6A7HL74W4NIDKWC3U6T6VYP56H/graph.json","events_json":"https://pith.science/api/pith-number/6A7HL74W4NIDKWC3U6T6VYP56H/events.json","paper":"https://pith.science/paper/6A7HL74W"},"agent_actions":{"view_html":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H","download_json":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H.json","view_paper":"https://pith.science/paper/6A7HL74W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09177&json=true","fetch_graph":"https://pith.science/api/pith-number/6A7HL74W4NIDKWC3U6T6VYP56H/graph.json","fetch_events":"https://pith.science/api/pith-number/6A7HL74W4NIDKWC3U6T6VYP56H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/action/storage_attestation","attest_author":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/action/author_attestation","sign_citation":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/action/citation_signature","submit_replication":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/action/replication_record"}},"created_at":"2026-05-18T00:14:06.825871+00:00","updated_at":"2026-05-18T00:14:06.825871+00:00"}