{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6P5VKT5VGVZN2EUL3XTRGRL7V3","short_pith_number":"pith:6P5VKT5V","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"},"canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","source":{"kind":"arxiv","id":"1801.02253","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02253","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02253v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02253","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"6P5VKT5VGVZN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6P5VKT5VGVZN2EUL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6P5VKT5V","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6P5VKT5VGVZN2EUL3XTRGRL7V3","target":"record","payload":{"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"},"canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","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"},"source_kind":"arxiv","source_id":"1801.02253","source_version":1,"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYE85H7SL2irAY/JJWIRl+Z7bK7I+V5Hxeg2k3G1NGm70kFOjgjVd45Nk6IFEv1u03+uY3eJHWsh+swZaYYsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:15:43.244922Z"},"content_sha256":"80fc53953cb53ea88b31c462150659a424422073cd561a316ae353ee10142e07","schema_version":"1.0","event_id":"sha256:80fc53953cb53ea88b31c462150659a424422073cd561a316ae353ee10142e07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6P5VKT5VGVZN2EUL3XTRGRL7V3","target":"graph","payload":{"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"},"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:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OCQuVCT7CeQT3qQJxZMQQ8WAIHrNYkxxEpEXHRV8VPIBiBPO2tbFTclFY0P5tWhQzwvR1wfEDzXvcjjvIC28AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:15:43.245277Z"},"content_sha256":"b102c9bddff4fe3e63f8f8fa2e6b30115f121a9153edcedb2a145cdf415e45ab","schema_version":"1.0","event_id":"sha256:b102c9bddff4fe3e63f8f8fa2e6b30115f121a9153edcedb2a145cdf415e45ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/bundle.json","state_url":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/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-01T09:15:43Z","links":{"resolver":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3","bundle":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/bundle.json","state":"https://pith.science/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6P5VKT5VGVZN2EUL3XTRGRL7V3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6P5VKT5VGVZN2EUL3XTRGRL7V3","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":"43f4535a3c2394d37296bd98bd53a1a8bc385ef70d8cee8c0fe17c32cbf6a339","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-07T21:38:04Z","title_canon_sha256":"70ba4f171149aae5375441f3eac4ba16c88aedd05e1cfd09e0b122dc90a59ac2"},"schema_version":"1.0","source":{"id":"1801.02253","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02253","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02253v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02253","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"6P5VKT5VGVZN","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"6P5VKT5VGVZN2EUL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"6P5VKT5V","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:b102c9bddff4fe3e63f8f8fa2e6b30115f121a9153edcedb2a145cdf415e45ab","target":"graph","created_at":"2026-05-18T00:26:32Z","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":"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","authors_text":"Ad\\`ele Pass-Lanneau, Ayumi Igarashi, Fr\\'ed\\'eric Meunier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-07T21:38:04Z","title":"Perfect graphs with polynomially computable kernels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02253","kind":"arxiv","version":1},"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:80fc53953cb53ea88b31c462150659a424422073cd561a316ae353ee10142e07","target":"record","created_at":"2026-05-18T00:26:32Z","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":"43f4535a3c2394d37296bd98bd53a1a8bc385ef70d8cee8c0fe17c32cbf6a339","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-07T21:38:04Z","title_canon_sha256":"70ba4f171149aae5375441f3eac4ba16c88aedd05e1cfd09e0b122dc90a59ac2"},"schema_version":"1.0","source":{"id":"1801.02253","kind":"arxiv","version":1}},"canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f3fb554fb53572dd128bdde713457faef9939a2ae542fab140c5cb34097d3692","first_computed_at":"2026-05-18T00:26:32.313870Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:32.313870Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfRQ0fONv3XB2YA8Nb6Y+IPY7IUtzux2Nn/xiJK+1n0Y6JUGzGmfCQ1REXf6FSGGtiMJ9ecyxM2Z9byntvtXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:32.314577Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02253","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80fc53953cb53ea88b31c462150659a424422073cd561a316ae353ee10142e07","sha256:b102c9bddff4fe3e63f8f8fa2e6b30115f121a9153edcedb2a145cdf415e45ab"],"state_sha256":"4de75e755201aa296adef0db54cf564a16f5d44c15993250206f019ce6e07045"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRPP9OGc/Qfg27C6OnbTRka6kehGKCTCK0UN1Osc9rBCuA4Ml0Vkv8JlNF7SADuvbCm8SKUxj62iYwjJsUHMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:15:43.247258Z","bundle_sha256":"4bbeee80eb63a340dc885146883f6195930cb992c6121f50cc20f4e61fd321b7"}}