{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LBTLQQUCMFY4MLUYHMLL62TUG2","short_pith_number":"pith:LBTLQQUC","schema_version":"1.0","canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","source":{"kind":"arxiv","id":"1104.4556","version":2},"attestation_state":"computed","paper":{"title":"Pure simplicial complexes and well-covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Rashid Zaare-Nahandi","submitted_at":"2011-04-23T13:14:02Z","abstract_excerpt":"A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\\Delta$ is called pure if all of its facets have the same cardinality. Let $\\mathcal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, we prove that for any simplicial complex or any graph, there is a corresponding graph in class $\\mathcal G$ with the same well-coveredness property. Then some necessary and sufficient conditions are presented to recognize fast when a graph in the class $\\cal G$ is well-covered or not. To"},"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":"1104.4556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-23T13:14:02Z","cross_cats_sorted":[],"title_canon_sha256":"148bde63d79e303032e4c0d1e2e87368ab93b066a12f43fd611def30c4fe3c25","abstract_canon_sha256":"8cc976ceb84d056060764dad19894d6ff5b1d991ba0528764689beace8fa6846"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:25.698523Z","signature_b64":"nvab5aYJfdL6F+oFwbFYQOReFXXA8FZR0AzZzeIZW9wtVGdcemouuBkbd03WnCoFTwGJ2UlRZ9soqwQcGlznBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5866b842826171c62e983b16bf6a74369a3be6203c96be4d901c76a129bf6a64","last_reissued_at":"2026-05-18T03:51:25.697826Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:25.697826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pure simplicial complexes and well-covered graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Rashid Zaare-Nahandi","submitted_at":"2011-04-23T13:14:02Z","abstract_excerpt":"A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\\Delta$ is called pure if all of its facets have the same cardinality. Let $\\mathcal G$ be the class of graphs with some disjoint maximal cliques covering all vertices. In this paper, we prove that for any simplicial complex or any graph, there is a corresponding graph in class $\\mathcal G$ with the same well-coveredness property. Then some necessary and sufficient conditions are presented to recognize fast when a graph in the class $\\cal G$ is well-covered or not. To"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4556","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":"1104.4556","created_at":"2026-05-18T03:51:25.697932+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4556v2","created_at":"2026-05-18T03:51:25.697932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4556","created_at":"2026-05-18T03:51:25.697932+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBTLQQUCMFY4","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBTLQQUCMFY4MLUY","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBTLQQUC","created_at":"2026-05-18T12:26:34.985390+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/LBTLQQUCMFY4MLUYHMLL62TUG2","json":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2.json","graph_json":"https://pith.science/api/pith-number/LBTLQQUCMFY4MLUYHMLL62TUG2/graph.json","events_json":"https://pith.science/api/pith-number/LBTLQQUCMFY4MLUYHMLL62TUG2/events.json","paper":"https://pith.science/paper/LBTLQQUC"},"agent_actions":{"view_html":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2","download_json":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2.json","view_paper":"https://pith.science/paper/LBTLQQUC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4556&json=true","fetch_graph":"https://pith.science/api/pith-number/LBTLQQUCMFY4MLUYHMLL62TUG2/graph.json","fetch_events":"https://pith.science/api/pith-number/LBTLQQUCMFY4MLUYHMLL62TUG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/action/storage_attestation","attest_author":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/action/author_attestation","sign_citation":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/action/citation_signature","submit_replication":"https://pith.science/pith/LBTLQQUCMFY4MLUYHMLL62TUG2/action/replication_record"}},"created_at":"2026-05-18T03:51:25.697932+00:00","updated_at":"2026-05-18T03:51:25.697932+00:00"}