{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CO7ZNE6PWCUANGTQNNOA7GM4XP","short_pith_number":"pith:CO7ZNE6P","canonical_record":{"source":{"id":"1405.7874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-30T14:28:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"19d98ec7eff8c17ee6ad2a1b5a5c562c65fa8ddc32aa01dc6bc17d51e1d8bf12","abstract_canon_sha256":"b5d72b8438460e6faf2ee2e0c3ce0d435d5b410ec6a2bf3c737313525bb97434"},"schema_version":"1.0"},"canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","source":{"kind":"arxiv","id":"1405.7874","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7874","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7874v2","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7874","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"CO7ZNE6PWCUA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CO7ZNE6PWCUANGTQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CO7ZNE6P","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CO7ZNE6PWCUANGTQNNOA7GM4XP","target":"record","payload":{"canonical_record":{"source":{"id":"1405.7874","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-30T14:28:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"19d98ec7eff8c17ee6ad2a1b5a5c562c65fa8ddc32aa01dc6bc17d51e1d8bf12","abstract_canon_sha256":"b5d72b8438460e6faf2ee2e0c3ce0d435d5b410ec6a2bf3c737313525bb97434"},"schema_version":"1.0"},"canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:49.834011Z","signature_b64":"brcrosrFvrqCXDbPyBtZw9y4FodufKKzzO7hNUQ2S+cZead+VFoGlGsfXMLoMN0EBvOlGCIrzvSI2XM3sr6YBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","last_reissued_at":"2026-05-18T01:09:49.833290Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:49.833290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.7874","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-18T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aITCQUOcN8cZva6Dwkpds5Y53txU6YfEXGxAh2p58Eg9oSdN18wZyfCLDLAgRUeq7KeqZi3wH21mF8lbwENkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:27:09.508922Z"},"content_sha256":"b0860ce1002fc316ae20fa32a5290cecb420e204d304beb998143eda5d745005","schema_version":"1.0","event_id":"sha256:b0860ce1002fc316ae20fa32a5290cecb420e204d304beb998143eda5d745005"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CO7ZNE6PWCUANGTQNNOA7GM4XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex-transitive CIS graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Edward Dobson, Gabriel Verret, Martin Milani\\v{c}","submitted_at":"2014-05-30T14:28:53Z","abstract_excerpt":"A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and only if it is well-covered, co-well-covered, and the product of its clique and stability numbers equals its order. A graph is irreducible if no two distinct vertices have the same neighborhood. We classif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7874","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-18T01:09:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3V0BCZb3A/omzO8a5TemxVmwVywyrrdisszaSbT/Vdg1jvo8NuqQzja9KJBbHZttdyZ+8WgBF307l/ULECHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:27:09.509270Z"},"content_sha256":"d974f29d4131e743e94156dfceb1f1ec7bcf3ec6e428094cdae0951737a2e4bc","schema_version":"1.0","event_id":"sha256:d974f29d4131e743e94156dfceb1f1ec7bcf3ec6e428094cdae0951737a2e4bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/bundle.json","state_url":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/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-22T17:27:09Z","links":{"resolver":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP","bundle":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/bundle.json","state":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CO7ZNE6PWCUANGTQNNOA7GM4XP","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":"b5d72b8438460e6faf2ee2e0c3ce0d435d5b410ec6a2bf3c737313525bb97434","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-30T14:28:53Z","title_canon_sha256":"19d98ec7eff8c17ee6ad2a1b5a5c562c65fa8ddc32aa01dc6bc17d51e1d8bf12"},"schema_version":"1.0","source":{"id":"1405.7874","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.7874","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"arxiv_version","alias_value":"1405.7874v2","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7874","created_at":"2026-05-18T01:09:49Z"},{"alias_kind":"pith_short_12","alias_value":"CO7ZNE6PWCUA","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CO7ZNE6PWCUANGTQ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CO7ZNE6P","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d974f29d4131e743e94156dfceb1f1ec7bcf3ec6e428094cdae0951737a2e4bc","target":"graph","created_at":"2026-05-18T01:09:49Z","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 CIS graph is a graph in which every maximal stable set and every maximal clique intersect. A graph is well-covered if all its maximal stable sets are of the same size, co-well-covered if its complement is well-covered, and vertex-transitive if, for every pair of vertices, there exists an automorphism of the graph mapping one to the other. We show that a vertex-transitive graph is CIS if and only if it is well-covered, co-well-covered, and the product of its clique and stability numbers equals its order. A graph is irreducible if no two distinct vertices have the same neighborhood. We classif","authors_text":"Ademir Hujdurovi\\'c, Edward Dobson, Gabriel Verret, Martin Milani\\v{c}","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-30T14:28:53Z","title":"Vertex-transitive CIS graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7874","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:b0860ce1002fc316ae20fa32a5290cecb420e204d304beb998143eda5d745005","target":"record","created_at":"2026-05-18T01:09:49Z","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":"b5d72b8438460e6faf2ee2e0c3ce0d435d5b410ec6a2bf3c737313525bb97434","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-30T14:28:53Z","title_canon_sha256":"19d98ec7eff8c17ee6ad2a1b5a5c562c65fa8ddc32aa01dc6bc17d51e1d8bf12"},"schema_version":"1.0","source":{"id":"1405.7874","kind":"arxiv","version":2}},"canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","first_computed_at":"2026-05-18T01:09:49.833290Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:49.833290Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"brcrosrFvrqCXDbPyBtZw9y4FodufKKzzO7hNUQ2S+cZead+VFoGlGsfXMLoMN0EBvOlGCIrzvSI2XM3sr6YBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:49.834011Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.7874","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0860ce1002fc316ae20fa32a5290cecb420e204d304beb998143eda5d745005","sha256:d974f29d4131e743e94156dfceb1f1ec7bcf3ec6e428094cdae0951737a2e4bc"],"state_sha256":"68b50621848fcc29abd4c111a6b7bb95e3a0d9e5552400159aa3592289544cc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0sgaHT2H8Rp2YZH6okOBMaANCjmQY38DJUKHWMCUBtDNQsCt2nB/CBph4BTXGomVR4rjVBzbfGon8YMrsTUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:27:09.511233Z","bundle_sha256":"ebbc9c6b32483a73cb0f0ec6fc0cd1224cd82acda1b97d7011d13b1e3cc0bb75"}}