{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CO7ZNE6PWCUANGTQNNOA7GM4XP","short_pith_number":"pith:CO7ZNE6P","schema_version":"1.0","canonical_sha256":"13bf9693cfb0a8069a706b5c0f999cbbea58f5f255b668b4e1175ecc6e8a3879","source":{"kind":"arxiv","id":"1405.7874","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.7874","created_at":"2026-05-18T01:09:49.833422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7874v2","created_at":"2026-05-18T01:09:49.833422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7874","created_at":"2026-05-18T01:09:49.833422+00:00"},{"alias_kind":"pith_short_12","alias_value":"CO7ZNE6PWCUA","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CO7ZNE6PWCUANGTQ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CO7ZNE6P","created_at":"2026-05-18T12:28:22.404517+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/CO7ZNE6PWCUANGTQNNOA7GM4XP","json":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP.json","graph_json":"https://pith.science/api/pith-number/CO7ZNE6PWCUANGTQNNOA7GM4XP/graph.json","events_json":"https://pith.science/api/pith-number/CO7ZNE6PWCUANGTQNNOA7GM4XP/events.json","paper":"https://pith.science/paper/CO7ZNE6P"},"agent_actions":{"view_html":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP","download_json":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP.json","view_paper":"https://pith.science/paper/CO7ZNE6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7874&json=true","fetch_graph":"https://pith.science/api/pith-number/CO7ZNE6PWCUANGTQNNOA7GM4XP/graph.json","fetch_events":"https://pith.science/api/pith-number/CO7ZNE6PWCUANGTQNNOA7GM4XP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/action/storage_attestation","attest_author":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/action/author_attestation","sign_citation":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/action/citation_signature","submit_replication":"https://pith.science/pith/CO7ZNE6PWCUANGTQNNOA7GM4XP/action/replication_record"}},"created_at":"2026-05-18T01:09:49.833422+00:00","updated_at":"2026-05-18T01:09:49.833422+00:00"}