{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IINH72NB2GSGKR4AQVUEAOUPUF","short_pith_number":"pith:IINH72NB","schema_version":"1.0","canonical_sha256":"421a7fe9a1d1a46547808568403a8fa160d2bfddfacf2f84a250c971ae675503","source":{"kind":"arxiv","id":"1302.3498","version":1},"attestation_state":"computed","paper":{"title":"On CIS Circulants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Endre Boros, Martin Milanic, Vladimir Gurvich","submitted_at":"2013-02-14T18:16:15Z","abstract_excerpt":"A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. It is not difficult to show that a circulant G is a CIS graph if and only if G and its complement are both well-covered and the product of the independence and the clique numbers of G is equal to the number of vertices. It is also easy to demonstrate that both families, the circulants and the CIS graphs, are closed with respec"},"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":"1302.3498","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-14T18:16:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"b9adad5ec955d503f6d6912f8f0f628b3610fb481546b43f6e1844db37bc073b","abstract_canon_sha256":"e74c5217e72f31b56d0beb5e39a28b0b2cdb251dba4c9bfff8bd7fb787f67ab7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:44.728228Z","signature_b64":"T5ul2YBmFsexiyKKkTRgSjKLYXf8EW+MoQ10s6kqoD+MYTrlbf7r+iOg0T4jCpl6JYzzpctGId07b+0aGD1QBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"421a7fe9a1d1a46547808568403a8fa160d2bfddfacf2f84a250c971ae675503","last_reissued_at":"2026-05-18T02:59:44.727709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:44.727709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On CIS Circulants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Endre Boros, Martin Milanic, Vladimir Gurvich","submitted_at":"2013-02-14T18:16:15Z","abstract_excerpt":"A circulant is a Cayley graph over a cyclic group. A well-covered graph is a graph in which all maximal stable sets are of the same size, or in other words, they are all maximum. A CIS graph is a graph in which every maximal stable set and every maximal clique intersect. It is not difficult to show that a circulant G is a CIS graph if and only if G and its complement are both well-covered and the product of the independence and the clique numbers of G is equal to the number of vertices. It is also easy to demonstrate that both families, the circulants and the CIS graphs, are closed with respec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3498","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.3498","created_at":"2026-05-18T02:59:44.727789+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3498v1","created_at":"2026-05-18T02:59:44.727789+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3498","created_at":"2026-05-18T02:59:44.727789+00:00"},{"alias_kind":"pith_short_12","alias_value":"IINH72NB2GSG","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IINH72NB2GSGKR4A","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IINH72NB","created_at":"2026-05-18T12:27:46.883200+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/IINH72NB2GSGKR4AQVUEAOUPUF","json":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF.json","graph_json":"https://pith.science/api/pith-number/IINH72NB2GSGKR4AQVUEAOUPUF/graph.json","events_json":"https://pith.science/api/pith-number/IINH72NB2GSGKR4AQVUEAOUPUF/events.json","paper":"https://pith.science/paper/IINH72NB"},"agent_actions":{"view_html":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF","download_json":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF.json","view_paper":"https://pith.science/paper/IINH72NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3498&json=true","fetch_graph":"https://pith.science/api/pith-number/IINH72NB2GSGKR4AQVUEAOUPUF/graph.json","fetch_events":"https://pith.science/api/pith-number/IINH72NB2GSGKR4AQVUEAOUPUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF/action/storage_attestation","attest_author":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF/action/author_attestation","sign_citation":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF/action/citation_signature","submit_replication":"https://pith.science/pith/IINH72NB2GSGKR4AQVUEAOUPUF/action/replication_record"}},"created_at":"2026-05-18T02:59:44.727789+00:00","updated_at":"2026-05-18T02:59:44.727789+00:00"}