{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6A7HL74W4NIDKWC3U6T6VYP56H","short_pith_number":"pith:6A7HL74W","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"},"canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","source":{"kind":"arxiv","id":"1705.09177","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09177","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09177v2","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09177","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"6A7HL74W4NID","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6A7HL74W4NIDKWC3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6A7HL74W","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6A7HL74W4NIDKWC3U6T6VYP56H","target":"record","payload":{"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"},"canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","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"},"source_kind":"arxiv","source_id":"1705.09177","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gGIrlLS+ir5t8csmrNIijm5UYLT5WSUwnd4Kl9b4zPcHcQj01qIxHiUIyRnYiMtGl6wAalIxEqdtP+o/sdmDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:21:33.651381Z"},"content_sha256":"926584ed08389936eb95c4c8eb34f859154264283d1220f7cd639551fd4d1e54","schema_version":"1.0","event_id":"sha256:926584ed08389936eb95c4c8eb34f859154264283d1220f7cd639551fd4d1e54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6A7HL74W4NIDKWC3U6T6VYP56H","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rG6kWb7zskBn61W2SckbUu/MAVOMnUMtF3fyHO+I/n25jw9UozQ6T1FKmBSnjZQ6+B93LdJbj2BePt03UyZmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:21:33.651730Z"},"content_sha256":"75e930979a7d6ded8e342403f43151449f74067edba52621bc20d32fee739dde","schema_version":"1.0","event_id":"sha256:75e930979a7d6ded8e342403f43151449f74067edba52621bc20d32fee739dde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/bundle.json","state_url":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6A7HL74W4NIDKWC3U6T6VYP56H/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T22:21:33Z","links":{"resolver":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H","bundle":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/bundle.json","state":"https://pith.science/pith/6A7HL74W4NIDKWC3U6T6VYP56H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6A7HL74W4NIDKWC3U6T6VYP56H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6A7HL74W4NIDKWC3U6T6VYP56H","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0aee17bedbc1b2e743021d39add3bdd2a76f4c6d5f5ece547a30127358b4f38e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-25T13:47:33Z","title_canon_sha256":"d38ba6d9d14878e55fcaa3a92c0d7a4d155620f1c191f599d127a8b9e6ec9718"},"schema_version":"1.0","source":{"id":"1705.09177","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09177","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09177v2","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09177","created_at":"2026-05-18T00:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"6A7HL74W4NID","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6A7HL74W4NIDKWC3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6A7HL74W","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:75e930979a7d6ded8e342403f43151449f74067edba52621bc20d32fee739dde","target":"graph","created_at":"2026-05-18T00:14:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ignasi Sau, Konrad K. Dabrowski, Luerbio Faria, Sancrey R. Alves, Sulamita Klein, U\\'everton S. Souza","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-25T13:47:33Z","title":"On the (parameterized) complexity of recognizing well-covered (r,l)-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09177","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:926584ed08389936eb95c4c8eb34f859154264283d1220f7cd639551fd4d1e54","target":"record","created_at":"2026-05-18T00:14:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0aee17bedbc1b2e743021d39add3bdd2a76f4c6d5f5ece547a30127358b4f38e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-25T13:47:33Z","title_canon_sha256":"d38ba6d9d14878e55fcaa3a92c0d7a4d155620f1c191f599d127a8b9e6ec9718"},"schema_version":"1.0","source":{"id":"1705.09177","kind":"arxiv","version":2}},"canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f03e75ff96e35035585ba7a7eae1fdf1c1fad3faf7bc7eb3d1ac0c80173cf6a1","first_computed_at":"2026-05-18T00:14:06.825787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:06.825787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gVEBW9Z/rsVUc1h2AjNMhUsQ/kSB7JgKK8qFggzKz4x7YTrREUE/QwzmmlV5gSLi1OW5yiwyqf48zOaZNsB2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:06.826324Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09177","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:926584ed08389936eb95c4c8eb34f859154264283d1220f7cd639551fd4d1e54","sha256:75e930979a7d6ded8e342403f43151449f74067edba52621bc20d32fee739dde"],"state_sha256":"46c3ef2618b9e063a27cfeae470ed7f304f9b1f105d5ba5ca7f12cf920de8046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcvmgNm+ZC+Y6pKJ4QB/GOWTeSNa26+hC96u117nVH1XH+YO8EWF6njQDKSCzb9O5CUHreJZPVbBsbtJFSFSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:21:33.653748Z","bundle_sha256":"d07641a93bb3923ea231d85ff3f695b568f9752e50050cd98318320e46faedb2"}}