{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RV7IGSR4ZAOSKSROP6GZ734VC3","short_pith_number":"pith:RV7IGSR4","canonical_record":{"source":{"id":"1812.05314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:49:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c841156b8b6607eea848c67adcb6f3cb5031a922ab3412d63b67bde5ba8110d2","abstract_canon_sha256":"0473290aa90e61dddf9ef59c31be9e7b31caccff8f4018518388de845204c671"},"schema_version":"1.0"},"canonical_sha256":"8d7e834a3cc81d254a2e7f8d9fef9516f953748291ffa641f58444fa7878a773","source":{"kind":"arxiv","id":"1812.05314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05314","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05314v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05314","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"RV7IGSR4ZAOS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RV7IGSR4ZAOSKSRO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RV7IGSR4","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RV7IGSR4ZAOSKSROP6GZ734VC3","target":"record","payload":{"canonical_record":{"source":{"id":"1812.05314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:49:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c841156b8b6607eea848c67adcb6f3cb5031a922ab3412d63b67bde5ba8110d2","abstract_canon_sha256":"0473290aa90e61dddf9ef59c31be9e7b31caccff8f4018518388de845204c671"},"schema_version":"1.0"},"canonical_sha256":"8d7e834a3cc81d254a2e7f8d9fef9516f953748291ffa641f58444fa7878a773","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:23.824042Z","signature_b64":"5+4yqNWzbPhrfjRkwqbsZfm4hCuUI/HykzzbPNPKiM2/vRKS/XewKqyIPuM/0/spo7OftcmY/6i+4bL8YhB8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d7e834a3cc81d254a2e7f8d9fef9516f953748291ffa641f58444fa7878a773","last_reissued_at":"2026-05-17T23:58:23.823227Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:23.823227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.05314","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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kh40YL51vxmB7u/UGYEwuw6orGDNagns9JbDkX+PbbUBL0JvjkNs96JyYmp3fs8exxDA1DGj8/Xt56Jr5OVCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:15.050610Z"},"content_sha256":"85aa28ba28600cb11df15ebc0a5d5b69879112013cff154a567a995b721d0542","schema_version":"1.0","event_id":"sha256:85aa28ba28600cb11df15ebc0a5d5b69879112013cff154a567a995b721d0542"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RV7IGSR4ZAOSKSROP6GZ734VC3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A characterization of claw-free CIS graphs and new results on the order of CIS graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Liliana Alc\\'on, Marisa Gutierrez, Martin Milani\\v{c}","submitted_at":"2018-12-13T08:49:18Z","abstract_excerpt":"A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all vertices of degree at least two and use this result to give a structural, efficiently testable characterization of claw-free CIS graphs. We answer in the negative a question of Dobson, Hujdurovi\\'c, Milani\\v{c}, and Verret [Vertex-transitive CIS graphs, European J. Combin. 44 (2015) 87-98] asking whether the number of vertices of every CIS graph is bounded from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05314","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-17T23:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aAox89zMeiEfAwWK+GLnEpQhyXfKOvqeD+c4gaAar2QRIfPz3ib7hWrmEZUfirLI1TenfcNmg25QDflZ/rduCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:47:15.050959Z"},"content_sha256":"90b5917e40728019418f88115b6666f992225785b4c33efd51c695f4add692c1","schema_version":"1.0","event_id":"sha256:90b5917e40728019418f88115b6666f992225785b4c33efd51c695f4add692c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/bundle.json","state_url":"https://pith.science/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/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-05T12:47:15Z","links":{"resolver":"https://pith.science/pith/RV7IGSR4ZAOSKSROP6GZ734VC3","bundle":"https://pith.science/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/bundle.json","state":"https://pith.science/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RV7IGSR4ZAOSKSROP6GZ734VC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RV7IGSR4ZAOSKSROP6GZ734VC3","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":"0473290aa90e61dddf9ef59c31be9e7b31caccff8f4018518388de845204c671","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:49:18Z","title_canon_sha256":"c841156b8b6607eea848c67adcb6f3cb5031a922ab3412d63b67bde5ba8110d2"},"schema_version":"1.0","source":{"id":"1812.05314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05314","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05314v1","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05314","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"RV7IGSR4ZAOS","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RV7IGSR4ZAOSKSRO","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RV7IGSR4","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:90b5917e40728019418f88115b6666f992225785b4c33efd51c695f4add692c1","target":"graph","created_at":"2026-05-17T23:58:23Z","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":"A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all vertices of degree at least two and use this result to give a structural, efficiently testable characterization of claw-free CIS graphs. We answer in the negative a question of Dobson, Hujdurovi\\'c, Milani\\v{c}, and Verret [Vertex-transitive CIS graphs, European J. Combin. 44 (2015) 87-98] asking whether the number of vertices of every CIS graph is bounded from ","authors_text":"Liliana Alc\\'on, Marisa Gutierrez, Martin Milani\\v{c}","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:49:18Z","title":"A characterization of claw-free CIS graphs and new results on the order of CIS graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05314","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:85aa28ba28600cb11df15ebc0a5d5b69879112013cff154a567a995b721d0542","target":"record","created_at":"2026-05-17T23:58:23Z","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":"0473290aa90e61dddf9ef59c31be9e7b31caccff8f4018518388de845204c671","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-13T08:49:18Z","title_canon_sha256":"c841156b8b6607eea848c67adcb6f3cb5031a922ab3412d63b67bde5ba8110d2"},"schema_version":"1.0","source":{"id":"1812.05314","kind":"arxiv","version":1}},"canonical_sha256":"8d7e834a3cc81d254a2e7f8d9fef9516f953748291ffa641f58444fa7878a773","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d7e834a3cc81d254a2e7f8d9fef9516f953748291ffa641f58444fa7878a773","first_computed_at":"2026-05-17T23:58:23.823227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:23.823227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5+4yqNWzbPhrfjRkwqbsZfm4hCuUI/HykzzbPNPKiM2/vRKS/XewKqyIPuM/0/spo7OftcmY/6i+4bL8YhB8Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:23.824042Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85aa28ba28600cb11df15ebc0a5d5b69879112013cff154a567a995b721d0542","sha256:90b5917e40728019418f88115b6666f992225785b4c33efd51c695f4add692c1"],"state_sha256":"1434f1dfbcfcce71f4b69b9023ee11075d1ca064bad7ea1a32ee476eae6dceaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"36CIqzK+8z8X68ibTB9VUkdQZvwqBGB0rQWKs0k/mur6sCNTfPRWhoJRaMdSnsdDKQ+b6nM2srQ9n41sQXC5Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:47:15.052897Z","bundle_sha256":"05b97cefdcda3700dc2badfa72982804e32e237dcbf6444c29800e90be0ac2e1"}}