{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6P5VKT5VGVZN2EUL3XTRGRL7V3","short_pith_number":"pith:6P5VKT5V","schema_version":"1.0","canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","source":{"kind":"arxiv","id":"1801.02253","version":1},"attestation_state":"computed","paper":{"title":"Perfect graphs with polynomially computable kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ad\\`ele Pass-Lanneau, Ayumi Igarashi, Fr\\'ed\\'eric Meunier","submitted_at":"2018-01-07T21:38:04Z","abstract_excerpt":"In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polynomiality results for subfamilies of perfect graphs, among which are claw-free perfect graphs and chordal graphs. Our results are based on the design of kernel computation methods with respect to two grap"},"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":"1801.02253","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-07T21:38:04Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"70ba4f171149aae5375441f3eac4ba16c88aedd05e1cfd09e0b122dc90a59ac2","abstract_canon_sha256":"43f4535a3c2394d37296bd98bd53a1a8bc385ef70d8cee8c0fe17c32cbf6a339"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.314577Z","signature_b64":"KfRQ0fONv3XB2YA8Nb6Y+IPY7IUtzux2Nn/xiJK+1n0Y6JUGzGmfCQ1REXf6FSGGtiMJ9ecyxM2Z9byntvtXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","last_reissued_at":"2026-05-18T00:26:32.313870Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.313870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect graphs with polynomially computable kernels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Ad\\`ele Pass-Lanneau, Ayumi Igarashi, Fr\\'ed\\'eric Meunier","submitted_at":"2018-01-07T21:38:04Z","abstract_excerpt":"In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a perfect graph. However, an open question is the complexity status of the computation of a kernel in such a digraph. Our main contribution is to prove new polynomiality results for subfamilies of perfect graphs, among which are claw-free perfect graphs and chordal graphs. Our results are based on the design of kernel computation methods with respect to two grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02253","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":"1801.02253","created_at":"2026-05-18T00:26:32.313975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02253v1","created_at":"2026-05-18T00:26:32.313975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02253","created_at":"2026-05-18T00:26:32.313975+00:00"},{"alias_kind":"pith_short_12","alias_value":"6P5VKT5VGVZN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6P5VKT5VGVZN2EUL","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6P5VKT5V","created_at":"2026-05-18T12:32:11.075285+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/6P5VKT5VGVZN2EUL3XTRGRL7V3","json":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3.json","graph_json":"https://pith.science/api/pith-number/6P5VKT5VGVZN2EUL3XTRGRL7V3/graph.json","events_json":"https://pith.science/api/pith-number/6P5VKT5VGVZN2EUL3XTRGRL7V3/events.json","paper":"https://pith.science/paper/6P5VKT5V"},"agent_actions":{"view_html":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3","download_json":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3.json","view_paper":"https://pith.science/paper/6P5VKT5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02253&json=true","fetch_graph":"https://pith.science/api/pith-number/6P5VKT5VGVZN2EUL3XTRGRL7V3/graph.json","fetch_events":"https://pith.science/api/pith-number/6P5VKT5VGVZN2EUL3XTRGRL7V3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/action/storage_attestation","attest_author":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/action/author_attestation","sign_citation":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/action/citation_signature","submit_replication":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/action/replication_record"}},"created_at":"2026-05-18T00:26:32.313975+00:00","updated_at":"2026-05-18T00:26:32.313975+00:00"}