{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ME6D4XEWFCYQIN4OZOI3JSLKKV","short_pith_number":"pith:ME6D4XEW","canonical_record":{"source":{"id":"2608.11289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-08-11T16:13:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f8e7b8439bfa02f21f79afbe32989f9e595da724a6ceec04a8131c4f707bfa80","abstract_canon_sha256":"24dc244055632b535ea15c1000c0dde096cc520380dfd9903c240b7fb75b752a"},"schema_version":"1.0"},"canonical_sha256":"613c3e5c9628b104378ecb91b4c96a557cddff44a2ec99dd2166ddc3924ae58a","source":{"kind":"arxiv","id":"2608.11289","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11289","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11289v1","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11289","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"ME6D4XEWFCYQ","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"ME6D4XEWFCYQIN4O","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"ME6D4XEW","created_at":"2026-08-13T00:20:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ME6D4XEWFCYQIN4OZOI3JSLKKV","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-08-11T16:13:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f8e7b8439bfa02f21f79afbe32989f9e595da724a6ceec04a8131c4f707bfa80","abstract_canon_sha256":"24dc244055632b535ea15c1000c0dde096cc520380dfd9903c240b7fb75b752a"},"schema_version":"1.0"},"canonical_sha256":"613c3e5c9628b104378ecb91b4c96a557cddff44a2ec99dd2166ddc3924ae58a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-13T00:20:58.215464Z","signature_b64":"qSeiqLlfOnc4Q22w7fUKRZdwRqPbs/YP28+emLppGGchD/kfd0X2VKFra/H2NuiZ30tViSQpnb7u1rVq+voXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613c3e5c9628b104378ecb91b4c96a557cddff44a2ec99dd2166ddc3924ae58a","last_reissued_at":"2026-08-13T00:20:58.213730Z","signature_status":"signed_v1","first_computed_at":"2026-08-13T00:20:58.213730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11289","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-08-13T00:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"houQX/Qh4LAqPipNShs8TMMIcLn0eRQsHqQdOS6Z4nfl7Z4t/QjJ5QDjGzFZEzyLMe7qjt9M2qHvLSZbMVM5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:05:55.097953Z"},"content_sha256":"80a363ffb983357095dc8ba2bf8dc893758bcc63527cef000bcd668a737f083e","schema_version":"1.0","event_id":"sha256:80a363ffb983357095dc8ba2bf8dc893758bcc63527cef000bcd668a737f083e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ME6D4XEWFCYQIN4OZOI3JSLKKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Difficult Is It to Recognize CIS Graphs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Mengxi Yang, Rongchuan Tao, Wenan Zang","submitted_at":"2026-08-11T16:13:39Z","abstract_excerpt":"A graph $G$ is called $CIS$ if each maximal clique intersects each maximal stable set of $G$, with maximality taken with respect to set inclusion. CIS graphs resemble perfect graphs in several respects and have interesting applications in game theory. The complexity of recognizing CIS graphs was posed as an open problem by Chv\\'atal in the 1990s and has since led to conflicting conjectures. We settle the problem by showing that recognizing CIS graphs is $\\mathsf{coNP}\\text{-complete}$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11289","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.11289/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-13T00:20:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAkdsNMN3t5lgQ24PIloAzr2EN6RLt9ZnOvlU1oW8aVT01gVKUXfWpRG1nZkM6efHmvvn+2Hh5OyBD0J7KtkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T05:05:55.098501Z"},"content_sha256":"6fdb98478f0aaf8381ca4e70c9d4aaa67c147f112cfe587985fe4b601322794f","schema_version":"1.0","event_id":"sha256:6fdb98478f0aaf8381ca4e70c9d4aaa67c147f112cfe587985fe4b601322794f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/bundle.json","state_url":"https://pith.science/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/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-08-22T05:05:55Z","links":{"resolver":"https://pith.science/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV","bundle":"https://pith.science/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/bundle.json","state":"https://pith.science/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ME6D4XEWFCYQIN4OZOI3JSLKKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ME6D4XEWFCYQIN4OZOI3JSLKKV","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":"24dc244055632b535ea15c1000c0dde096cc520380dfd9903c240b7fb75b752a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-08-11T16:13:39Z","title_canon_sha256":"f8e7b8439bfa02f21f79afbe32989f9e595da724a6ceec04a8131c4f707bfa80"},"schema_version":"1.0","source":{"id":"2608.11289","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11289","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11289v1","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11289","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_12","alias_value":"ME6D4XEWFCYQ","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_16","alias_value":"ME6D4XEWFCYQIN4O","created_at":"2026-08-13T00:20:58Z"},{"alias_kind":"pith_short_8","alias_value":"ME6D4XEW","created_at":"2026-08-13T00:20:58Z"}],"graph_snapshots":[{"event_id":"sha256:6fdb98478f0aaf8381ca4e70c9d4aaa67c147f112cfe587985fe4b601322794f","target":"graph","created_at":"2026-08-13T00:20:58Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.11289/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph $G$ is called $CIS$ if each maximal clique intersects each maximal stable set of $G$, with maximality taken with respect to set inclusion. CIS graphs resemble perfect graphs in several respects and have interesting applications in game theory. The complexity of recognizing CIS graphs was posed as an open problem by Chv\\'atal in the 1990s and has since led to conflicting conjectures. We settle the problem by showing that recognizing CIS graphs is $\\mathsf{coNP}\\text{-complete}$.","authors_text":"Mengxi Yang, Rongchuan Tao, Wenan Zang","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-08-11T16:13:39Z","title":"How Difficult Is It to Recognize CIS Graphs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11289","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:80a363ffb983357095dc8ba2bf8dc893758bcc63527cef000bcd668a737f083e","target":"record","created_at":"2026-08-13T00:20:58Z","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":"24dc244055632b535ea15c1000c0dde096cc520380dfd9903c240b7fb75b752a","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-08-11T16:13:39Z","title_canon_sha256":"f8e7b8439bfa02f21f79afbe32989f9e595da724a6ceec04a8131c4f707bfa80"},"schema_version":"1.0","source":{"id":"2608.11289","kind":"arxiv","version":1}},"canonical_sha256":"613c3e5c9628b104378ecb91b4c96a557cddff44a2ec99dd2166ddc3924ae58a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"613c3e5c9628b104378ecb91b4c96a557cddff44a2ec99dd2166ddc3924ae58a","first_computed_at":"2026-08-13T00:20:58.213730Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-13T00:20:58.213730Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qSeiqLlfOnc4Q22w7fUKRZdwRqPbs/YP28+emLppGGchD/kfd0X2VKFra/H2NuiZ30tViSQpnb7u1rVq+voXCw==","signature_status":"signed_v1","signed_at":"2026-08-13T00:20:58.215464Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11289","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80a363ffb983357095dc8ba2bf8dc893758bcc63527cef000bcd668a737f083e","sha256:6fdb98478f0aaf8381ca4e70c9d4aaa67c147f112cfe587985fe4b601322794f"],"state_sha256":"2705cd48ec7a7ff2d377f0dd24305c0dd15182c757c3684528ac53f29cc8b495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cYfks61zFAMcxNheP63/Esrwbdo5xqzFYP1NPg6BpqxiJBphxTTKotnqhIm+DHF82TIHFP8O3HzKmdUodwmDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T05:05:55.103029Z","bundle_sha256":"d4001cf43dd0d98a300026c793275e9bd41466a3e8be434c7e20c3a080835e0b"}}